Finite-state codes

DOI10.1109/18.21238zbMath0665.94017OpenAlexW2152640148MaRDI QIDQ3818246

Khaled A. S. Abdel-Ghaffar, Fabrizio Pollara, Robert J. McEliece

Publication date: 1989

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:POLieeetit88

zbMATH Keywords

upper boundsfree distanceencodersblock and convolutional codescatastrophic error propagationfinite-state machines with parallel inputs and outputsminimum distance of block codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Convolutional codes (94B10)

Related Items (4)

Concatenation of convolutional codes and rank metric codes for multi-shot network coding ⋮ A new rank metric for convolutional codes ⋮ On periodic (partial) unit memory codes with maximum free distance ⋮ On (partial) unit memory codes based on Gabidulin codes

This page was built for publication: Finite-state codes