The trellis structure of maximal fixed-cost codes

DOI10.1109/18.556678MaRDI QIDQ3129470zbMATH OpenOpenAlexWikidataFDO

Authors Frank R. Kschischang

Publication date 7 September 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d97e14bcc87861d79b323855368af9ab2f6a3244

zbMATH Keywords

biproper trellisconstant-weight subcodesmaximal fixed-cost codesminimal trellisesrectangular codes

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 1284437
• Minimal trellises for block codes
• On the trellis structure of block codes

Cited in

(9)

• On viewing block codes as finite automata.
• On trellis structures for Reed-Muller codes
• Nondeterministic syntactic complexity
• A systematic approach to the construction of bandwidth-efficient multidimensional trellis codes
• A note on characteristic generators of a free cyclic code and its dual
• Structure, optimization, and realization of FFSK trellis codes
• scientific article; zbMATH DE number 1284437 (Why is no real title available?)
• Trellis structure and higher weights of extremal self-dual codes
• Minimal trellises for non-degenerate and degenerate decoding of quantum stabilizer codes

This page was built for publication: The trellis structure of maximal fixed-cost codes

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