Bounds on the trellis size of linear block codes
From MaRDI portal
Publication:4034451
DOI10.1109/18.179359zbMATH Open0765.94020OpenAlexW2051426885MaRDI QIDQ4034451FDOQ4034451
Authors: 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
Recommendations
- Bounds on complexity of trellis decoding of linear block codes
- On the trellis complexity of certain binary linear block codes
- Lower bounds on trellis complexity of block codes
- On complexity of trellis structure of linear block codes
- scientific article; zbMATH DE number 1284417
- Dimension/length profiles and trellis complexity of linear block codes
- Trellis decoding complexity of linear block codes
- scientific article; zbMATH DE number 4123671
- On the trellis structure of block codes
- On the trellis complexity of block and convolutional codes
Reed-Muller codesrepeated-root cyclic codessoft-decision decodingcontraction indexmaximum-likelihood decodingminimal trellis representation of linear block codeszero-concurring codewords
Cited In (7)
- On the BCJR trellis for linear block codes
- Some Bounds on the Size of Codes
- Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
- Block transitive codes attaining the Tsfasman-Vladut-Zink bound
- Trellis complexity of linear block codes via atomic codewords
- Title not available (Why is that?)
- On trellis structures for Reed-Muller codes
This page was built for publication: Bounds on the trellis size of linear block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4034451)
