On the trellis structure of block codes

DOI10.1109/18.476317zbMath0847.94009OpenAlexW2155364287WikidataQ59768152 ScholiaQ59768152MaRDI QIDQ4880314

Vladislav Sorokine, Frank R. Kschischang

Publication date: 15 October 1996

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

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

zbMATH Keywords

boundsNP-completeStirling numbernonlinear codetrellischess board

Mathematics Subject Classification ID

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

Related Items (7)

Kernel code and its controllability ⋮ On viewing block codes as finite automata. ⋮ On trellis structures for Reed-Muller codes ⋮ The generalization of some trellis properties of linear codes to group codes ⋮ Concatenated kernel codes ⋮ On Viterbi-like algorithms and their application to Reed-Muller codes ⋮ Matrix theory for minimal trellises

This page was built for publication: On the trellis structure of block codes