Bounds on distances and error exponents of unit memory codes

DOI10.1109/TIT.1983.1056739zbMath0518.94016OpenAlexW2044921145MaRDI QIDQ3669302

C. Thommesen, Jørn Justesen

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1109/tit.1983.1056739

zbMATH Keywords

asymptotic boundsfree distanceunit memory codeserror-exponenterror-pattern

Mathematics Subject Classification ID

Convolutional codes (94B10)

Related Items (6)

On Optimal Extended Row Distance Profile ⋮ On doubly-cyclic convolutional codes ⋮ Some constructions of generalised concatenated codes based on unit memory codes ⋮ Partial unit memory codes on the base of subcodes of Hadamard 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: Bounds on distances and error exponents of unit memory codes