Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes

DOI10.1109/18.850685MaRDI QIDQ4501736zbMATH OpenOpenAlexFDO

Authors Yaron Shany, Yair Be'ery

Publication date 7 September 2000

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

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

zbMATH Keywords

linear codeReed-Muller codesquare-root boundlinear tail-biting trellisesmerging intervalsub-tail-biting trellissubtrellis

Mathematics Subject Classification ID

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

Recommendations

• On trellis structures for Reed-Muller codes
• Trellis complexity of linear block codes via atomic codewords
• The structure of tail-biting trellises: Minimality and basic principles
• Tailbiting codes: bounds and search results
• Bounds on the trellis size of linear block codes

Cited in

(3)

• scientific article; zbMATH DE number 2154517 (Why is no real title available?)
• A multivariate weight enumerator for tail-biting trellis pseudocodewords
• Tailbiting codes: bounds and search results

This page was built for publication: Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes

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