A table of state complexity bounds for binary linear codes

DOI10.1109/18.556700zbMATH Open0865.94027OpenAlexW2157272916MaRDI QIDQ3129486FDOQ3129486

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)

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• Trellis Complexity of Short Linear Codes 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On binary linear codes which satisfy the two-way chain condition 👍 👎

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)