Preparata codes through lattices

DOI10.1109/18.904501MaRDI QIDQ4544452zbMATH OpenOpenAlexFDO

Authors Iwan Duursma

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.904501

zbMATH Keywords

cyclic codesGoethals codelatticesmodular codepreparata code

Mathematics Subject Classification ID

Relations with coding theory (11H71) Cyclic codes (94B15) Other types of codes (94B60) Bounds on codes (94B65)

Recommendations

• Extending and lengthening BCH codes.
• An introduction to linear and cyclic codes
• scientific article; zbMATH DE number 53945
• Construction and decomposition of cyclic codes of composite length (Corresp.)
• A new class of binary codes constructed on the basis of BCH codes (Corresp.)
• scientific article; zbMATH DE number 1284424
• scientific article; zbMATH DE number 218558
• Lee-metric BCH codes and their application to constrained and partial-response channels
• A new proof of the BCH bound (Corresp.)

Cited in

(3)

• Character sums over p-adic fields
• On the decoding of Preparata codes
• On the optimal Z₄ codes of type II and length 16

This page was built for publication: Preparata codes through lattices

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