Bounded Minimum Distance Decoding of Unit Memory Codes

IEEE Transactions on Information Theory

Volumn 41, Issue 2, 1995, Pages 591-596

  Dettmar, Uwe ^a   Sorger, Ulrich K ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

(Partial) unit memory codes; bounded minimum distance decoding; convolutional codes; extended row distance

Indexed keywords

ALGORITHMS; BLOCK CODES; COMPUTATIONAL COMPLEXITY; CONVOLUTIONAL CODES; DATA STORAGE EQUIPMENT; FINITE AUTOMATA; TABLE LOOKUP; TRELLIS CODES;

BOUNDED MINIMUM DISTANCE DECODING; ERROR PATTERNS; EXTENDED ROW DISTANCE; MULTIMEMORY CODES; SOFT DECISION DECODING; UNIT MEMORY CODES;

DECODING;

EID: 0029277040     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.370160     Document Type: Article

References (11)

1. L. Lee, “Short unit-memory byte-oriented binary convolutional codes having maximal free distance,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 349–352, May 1976.
2. G. Lauer, “Some optimal partial-unit-memory codes,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 240–243, Mar. 1979.
3. J. Justesen, “Bounded distance decoding of unit memory codes,” Rep. IT-121 ISSN 0105-8541, Institute of Circuit Theory and Telecommun., Tech. Univ, of Denmark, Lyngby, Sept. 1990.
4. V. Zyablov and S. Shavgulidze, Generalized Concatenated Constructions on the Base of Convolulionul Codes. Moscow, Russia: Nauka, 1991, in Russian.
5. U. Dettmar and S. A. Shavgulidze, “New optimal partial unit memory codes,” IEE Electron. Lett., vol. 28, pp. 1748–1749, Aug. 1992.
6. C. Thommesen and J. Justesen, “Bounds on distances and error exponents of unit-memory codes,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 637–649, Sept. 1983.
7. E. Blokh and V. Zyablov, “Coding of generalized concatenated codes,” Probl. Inform. Tramm., vol. 10, no. 3, pp. 218–222, 1974.
8. V. Zinov'ev, “Generalized concatenated codes for channels with error bursts and independent errors,” Probl. Inform. Transm., vol. 17, no. 4, pp. 53–56, 1981.
9. G. Kabatyansky. “About metrics and decoding domains of Forney's algorithm,” in Proc. 5th Int. Workshop on Information Theory (Moscow, Russia, 1991), pp. 81–85.
10. U. Sorger, “A new Reed-Solomon code decoding algorithm based on Newton's interpolation,” IEEE Trans. Inform. Theory, vol. 39, pp. 358–365, Mar. 1993.
11. J. Justesen, C. Thommesen, and V. Zyablov, “Concatenated codes with convolutional inner codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1217–1225, Sept. 1988.