Bounds on the trellis size of linear block codes

DOI10.1109/18.179359zbMath0765.94020OpenAlexW2051426885MaRDI QIDQ4034451

Yuval Berger, Yair Be'ery

Publication date: 16 May 1993

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

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

zbMATH Keywords

Reed-Muller codesrepeated-root cyclic codessoft-decision decodingcontraction indexmaximum-likelihood decodingminimal trellis representation of linear block codeszero-concurring codewords

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (1)

On trellis structures for Reed-Muller codes

This page was built for publication: Bounds on the trellis size of linear block codes