A characterization of certain Griesmer codes: MMD codes in a more general sense

DOI10.1109/18.782160zbMATH Open0958.94032OpenAlexW2148512923MaRDI QIDQ4503373FDOQ4503373

Authors: Jonas Olsson, Wolfgang Willems 

Publication date: 7 September 2000

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

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

Recommendations

• A characterization of MMD codes
• Characterization of two classes of codes that attain the Griesmer bound
• scientific article; zbMATH DE number 3877079
• scientific article; zbMATH DE number 4077121
• On g-th MDS Codes and Matroids
• scientific article; zbMATH DE number 459296
• A characterization of MDS codes that have an error correcting pair
• On a characterization of Gauss codes
• Characterization and existence conditions of codes meeting the Varshamov- Griesmer bound
• scientific article; zbMATH DE number 3861051

zbMATH Keywords

optimal codesweight distributionlinear codesGriesmer codesformal equivalencedefect of codesmaximum minimum distanceMMD codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (1)

• A survey on proper codes

This page was built for publication: A characterization of certain Griesmer codes: MMD codes in a more general sense

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