Minimal tail-biting trellises: the Golay code and more

DOI10.1109/18.771145zbMath0965.94024OpenAlexW2112682069MaRDI QIDQ4701404

Alexander Vardy, Robert Calderbank, G. David jun. Forney

Publication date: 21 November 1999

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

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

zbMATH Keywords

convolutional codesbinary Hamming codebinary Golay codeiterative decoding\(\mathbb{Z}_4\)-linear octacodetail-biting trellis representations of block codesternary tetracode

Mathematics Subject Classification ID

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

Related Items

On viewing block codes as finite automata., \(M_{24}\)-orbits of octad triples, The generalization of some trellis properties of linear codes to group codes, Codes on graphs: Recent progress, Matrix theory for minimal trellises