Minimum distance bounding techniques for individual trellis codes

DOI10.1109/26.380092MaRDI QIDQ2726498zbMATH OpenOpenAlexFDO

Authors Jan-Erik Porath

Publication date 18 July 2001

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

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

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12)

Review text

Lower- and upper distance bounds are developed for arbitrary individual trellis codes. The bounds are evaluated with help of error state trellises. The computational complexity is significantly reduced since pair states are avoided. The bounds may be applied to non-regular codes.

Recommendations

• Bounds on the minimum distance of trellis codes
• Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes
• Comments on "A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes"
• Lower bounds on trellis complexity of block codes
• Bounds on complexity of trellis decoding of linear block codes

Cited in

(4)

• Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes
• Minimal trellises for block codes
• Bounds on the minimum distance of trellis codes
• Comments on "A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes"

This page was built for publication: Minimum distance bounding techniques for individual trellis codes

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