Tree-codifications and convolutional codes

Abstract

The paper deals with some C-grammars and tree-codification properties extending the result in [1]. We try to exhibit new aspects and important results, e.g. that any algebraic convolutional code is a particular case of a tree-code, as well as the finite forms of the code-sets. They can result in new methods of decodification and error correction in the case of convolutional coding.