On binary linear codes which satisfy the two-way chain condition

DOI10.1109/18.490573MaRDI QIDQ4887090zbMATH OpenOpenAlexFDO

Authors Sylvia Encheva

Publication date 31 July 1996

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

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

zbMATH Keywords

binary linear codesstate complexitytwo-way chain condition

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• On codes satisfying the double chain condition
• On linear projective codes which satisfy the chain condition.
• Projective codes which satisfy the chain condition

Cited in

(5)

• On codes satisfying the double chain condition
• On self-dual ternary codes and their coordinate ordering.
• Projective codes which satisfy the chain condition
• On linear projective codes which satisfy the chain condition.
• A table of state complexity bounds for binary linear codes

This page was built for publication: On binary linear codes which satisfy the two-way chain condition

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