Onm-MDS codes over finite fields

DOI10.1080/00207160.2013.818669zbMath1300.94119OpenAlexW2058092035MaRDI QIDQ2921896

Qunying Liao, Huan Liao

Publication date: 14 October 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.818669

zbMATH Keywords

Hamming codegenerator matrixMDS codeparity-check matrix\(m\)-MDS codeSingleton defectthe minimum distance

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (1)

Linear codes of larger lengths with Galois hulls of arbitrary dimensions and related entanglement-assisted quantum error-correcting codes

Cites Work

• Unnamed Item
• Algebraic function fields and codes
• On near-MDS codes
• NNMDS codes
• Generalized Hamming weights for linear codes
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• Geometric approach to higher weights

This page was built for publication: Onm-MDS codes over finite fields