Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes

DOI10.1109/TCOM.1985.1096299MaRDI QIDQ3689074zbMATH OpenOpenAlexFDO

Authors Robert Calderbank, J. E. Mazo, Victor K. Wei

Publication date 1985

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcom.1985.1096299

zbMATH Keywords

sliding windowsequence of signal points

Mathematics Subject Classification ID

Communication theory (94A05)

Recommendations

• Bounds on the minimum distance of trellis codes
• A new description of trellis codes
• Minimum distance bounding techniques for individual trellis codes
• scientific article; zbMATH DE number 3943703
• Minimal trellises for block codes

Cited in

(10)

• On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels
• Minimum distance bounding techniques for individual trellis codes
• Asymptotically good codes have infinite trellis complexity
• A new description of trellis codes
• Distance spectra and upper bounds on error probability for trellis codes
• Bounds on the minimum distance of trellis codes
• Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound
• Comments on "A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes"
• A New Upper Bound on the Minimum Distance of Turbo Codes
• An Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes

This page was built for publication: Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes

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