A table of state complexity bounds for binary linear codes

DOI10.1109/18.556700MaRDI QIDQ3129486zbMATH OpenOpenAlexFDO

Authors P. Schuurman

Publication date 15 July 1997

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

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

zbMATH Keywords

binary linear codesstate complexity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Trellis Complexity of Short Linear Codes
• scientific article; zbMATH DE number 1284417
• scientific article; zbMATH DE number 3878836
• On binary linear codes which satisfy the two-way chain condition

Cited in

(2)

• Trellis Complexity of Short Linear Codes
• scientific article; zbMATH DE number 1504688 (Why is no real title available?)

This page was built for publication: A table of state complexity bounds for binary linear codes

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