On doubly-cyclic convolutional codes

Heide Gluesing-Luerssen, Wiland Schmale

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra [x]/(xn-1), where 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 near optimal with respect to distance and performance.

Original languageEnglish
Pages (from-to)151-170
Number of pages20
JournalApplicable Algebra in Engineering, Communications and Computing
Issue number2
StatePublished - Jun 2006


  • Convolutional coding theory
  • Cyclic codes
  • Skew polynomial rings

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Applied Mathematics


Dive into the research topics of 'On doubly-cyclic convolutional codes'. Together they form a unique fingerprint.

Cite this