Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes

DOI10.1109/TCOM.1985.1096299zbMATH Open0571.94001OpenAlexW1995025575MaRDI QIDQ3689074FDOQ3689074

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

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

zbMATH Keywords

sliding windowsequence of signal points

Mathematics Subject Classification ID

Communication theory (94A05)

Cited In (10)

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