Algebraic decoding for doubly cyclic convolutional codes

Heide Gluesing-Luerssen, Uwe Helmke, José Ignacio Iglesias Curto

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


An iterative decoding algorithm for convolutional codes is presented. It successively processes N consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be corrected. The algorithm can be efficiently used on a particular class of convolutional codes, known as doubly cyclic convolutional codes. Due to their highly algebraic structure those codes are well suited for the algorithm and the main step of the procedure can be carried out using Reed-Solomon decoding. Examples illustrate the decoding and a comparison with existing algorithms is made.

Original languageEnglish
Pages (from-to)83-99
Number of pages17
JournalAdvances in Mathematics of Communications
Issue number1
StatePublished - Feb 2010


  • Algebraic decoding
  • Convolutional codes
  • Cyclic convolutional codes
  • List decoding
  • Reed-solomon decoding

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computer Networks and Communications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Algebraic decoding for doubly cyclic convolutional codes'. Together they form a unique fingerprint.

Cite this