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

DOI10.1109/18.850685zbMath0998.94029OpenAlexW2147557228MaRDI QIDQ4501736

Yair Be'ery, Yaron Shany

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)

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