Bounds on distances and error exponents of unit memory codes

DOI10.1109/TIT.1983.1056739MaRDI QIDQ3669302zbMATH OpenOpenAlexFDO

Authors 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 boundserror-exponenterror-patternfree distanceunit memory codes

Mathematics Subject Classification ID

Convolutional codes (94B10)

Cited in

(6)

• On doubly-cyclic convolutional codes
• On optimal extended row distance profile
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3669302)