Trellis complexity of linear block codes via atomic codewords

DOI10.1007/BFB0025141MaRDI QIDQ4375829zbMATH OpenFDO

Authors T. Aaron Gulliver, Norman P. Secord, Morteza Esmaeili

Publication date 8 February 1998

Published in Information Theory and Applications II (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0025141

Mathematics Subject Classification ID

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

Recommendations

• On complexity of trellis structure of linear block codes
• On the trellis complexity of certain binary linear block codes
• Trellis decoding complexity of linear block codes
• Bounds on complexity of trellis decoding of linear block codes
• On the trellis complexity of block and convolutional codes
• Lower bounds on trellis complexity of block codes
• Trellis Complexity of Short Linear Codes
• Bounds on the trellis size of linear block codes
• Dimension/length profiles and trellis complexity of linear block codes
• On the trellis structure of block codes

Cited in

(9)

• The minimal generator matrix of a vector space
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• On complexity of trellis structure of linear block codes
• scientific article; zbMATH DE number 1498785 (Why is no real title available?)
• Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
• On the trellis complexity of certain binary linear block codes
• Dimension/length profiles and trellis complexity of linear block codes
• Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes
• On bit-level trellis complexity of Reed-Muller codes

This page was built for publication: Trellis complexity of linear block codes via atomic codewords

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