Matrix characterization of linear codes with arbitrary Hamming weight hierarchy

DOI10.1016/J.LAA.2005.07.008MaRDI QIDQ2576228zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 27 December 2005

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2005.07.008

zbMATH Keywords

MDS codesnear-MDS codesgeneralized Griesmer boundHamming weight hierarchynear-near-MDS codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• A matrix characterization of Near-MDS codes.
• On \(m\)-MDS codes over finite fields
• The weight hierarchy of Hadamard codes
• A characterization of MMD codes
• Note on MDS codes over the integers modulo p^m

Cites work

• scientific article; zbMATH DE number 1189015 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3616332 (Why is no real title available?)
• scientific article; zbMATH DE number 1026591 (Why is no real title available?)
• scientific article; zbMATH DE number 2154155 (Why is no real title available?)
• A comment on the weight structure of generator matrices of linear codes
• Algebraic function fields and codes
• Almost MDS codes
• Almost-MDS and near-MDS codes for error detection
• Bounds on the minimum support weights
• Code construction for the noiseless binary switching multiple-access channel
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of linear codes
• Maximum distance<tex>q</tex>-nary codes
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• On generator matrices of MDS codes (Corresp.)
• On near-MDS codes
• On the generalized Hamming weights of several classes of cyclic cods
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• Wire-Tap Channel II

Cited in

(3)

• Generalized Secret Sharing Schemes Using N$$^\mu $$MDS Codes
• A matrix characterization of Near-MDS codes.
• Defects of codes from higher dimensional algebraic varieties

This page was built for publication: Matrix characterization of linear codes with arbitrary Hamming weight hierarchy

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