Higher weights and near-MDR codes over chain rings

DOI10.3934/amc.2018045zbMath1402.94089OpenAlexW2892484637WikidataQ129183615 ScholiaQ129183615MaRDI QIDQ1620974

Dajian Liao, Zi-Hui Liu

Publication date: 15 November 2018

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2018045

zbMATH Keywords

chain conditiontensor productgeneralized Hamming weightsecret sharing schemenear-MDR code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (1)

Further results on higher weights of codes over finite rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On MDR codes over a finite ring
• Higher weights for codes over rings
• On the weight hierarchy of product codes
• On the structure of linear and cyclic codes over a finite chain ring
• On near-MDS codes
• Generalized Hamming weights of three classes of linear codes
• Generalized Hamming Weights of Irreducible Cyclic Codes
• How to share a secret
• Generalized Hamming weights for linear codes
• Duality for modules over finite rings and applications to coding theory
• On the generalized Hamming weights of product codes
• On the Hamming distance of linear codes over a finite chain ring
• Chains, Demi-Matroids, and Profiles

This page was built for publication: Higher weights and near-MDR codes over chain rings