On Doubly-Cyclic Convolutional Codes

Heide Gluesing-Luerssen, Wiland Schmale
2006 Applicable Algebra in Engineering, Communication and Computing  
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x n − 1), where F is a finite field. A particular choice of the data leads to the class of doubly-cyclic CC's. Within this large class Reed-Solomon and BCH convolutional codes can be defined. After constructing doubly-cyclic CC's, basic properties are derived on the basis of which distance properties of Reed-Solomon convolutional codes are investigated. This shows that some of them are optimal or
more » ... near optimal with respect to distance and performance.
doi:10.1007/s00200-006-0014-9 fatcat:dbrc4i5wpnfmtlkr4cobwqgaze