On a family of Abelian codes and their state complexities

DOI10.1109/18.904535MaRDI QIDQ4544478zbMATH OpenOpenAlexFDO

Authors T. Blackmore, G. H. Norton

Publication date 4 August 2002

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

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

zbMATH Keywords

minimum distanceReed-Muller codesstate complexityAbelian codesduals of Berman codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Recommendations

• scientific article; zbMATH DE number 1222363
• Weighted Reed-Muller codes and algebraic-geometric codes
• Bounds on the state complexity of codes from the Hermitian function field and its subfields
• On the theory of group codes
• On Berman's characterization of the Reed-Muller codes

Cited in

(1)

• scientific article; zbMATH DE number 1504688 (Why is no real title available?)

This page was built for publication: On a family of Abelian codes and their state complexities

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