MacWilliams extension theorem for MDS codes over a vector space alphabet

DOI10.1007/s10623-016-0247-yzbMath1402.94083arXiv1504.01355OpenAlexW3102477066MaRDI QIDQ510449

Serhii Dyshko

Publication date: 10 February 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.01355

zbMATH Keywords

MacWilliams extension theoremMDS codecode isometrycode over a vector space alphabetmonomial mapnear-MDS codepartition of a vector space

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Geometric approach to the MacWilliams extension theorem for codes over module alphabets ⋮ Minimal solutions of the isometry equation

Cites Work

• Unnamed Item
• On extendability of additive code isometries
• On \(\lambda \)-fold partitions of finite vector spaces and duality
• On metric rigidity for some classes of codes
• Blocking sets and partial spreads in finite projective spaces
• On the extendability of code isometries
• Isometry groups of combinatorial codes
• On the equivalence of codes over finite rings
• On near-MDS codes
• To the metrical rigidity of binary codes
• On the concept of code-isomorphy
• On the equivalence of codes over rings and modules
• FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
• FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES

This page was built for publication: MacWilliams extension theorem for MDS codes over a vector space alphabet