A characterization of MMD codes

DOI10.1109/18.681331MaRDI QIDQ4701126zbMATH OpenOpenAlexFDO

Authors Andreas Faldum, Wolfgang Willems

Publication date 21 November 1999

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

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

zbMATH Keywords

maximum-minimum distanceoptimal codesovoids

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes and caps in Galois spaces (51E22) Linear codes (general theory) (94B05)

Recommendations

• A characterization of certain Griesmer codes: MMD codes in a more general sense
• scientific article; zbMATH DE number 1189055
• On m-MDS codes over finite fields

Cited in

(12)

• Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities
• Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
• On m-MDS codes over finite fields
• scientific article; zbMATH DE number 3877080 (Why is no real title available?)
• A coding scheme for m-out-of-n codes
• scientific article; zbMATH DE number 1189055 (Why is no real title available?)
• A characterization of codes with extreme parameters
• A characterization of certain Griesmer codes: MMD codes in a more general sense
• A survey on proper codes
• Defects of codes from higher dimensional algebraic varieties
• Several classes of linear codes and their weight distributions
• Projective two-weight codes with small parameters and their corresponding graphs

This page was built for publication: A characterization of MMD codes

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