New code equivalence based on relative generalized Hamming weights

DOI10.1016/J.INS.2011.04.021zbMath1242.94012OpenAlexW2022268882MaRDI QIDQ433083

Yuan Luo, Xin-Wen Wu, Wende Chen, Zi-Hui Liu

Publication date: 13 July 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/40950

zbMATH Keywords

relative generalized Hamming weightcode equivalencerelative projective subspacesrelative subcodesvalue assignment

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Coding theorems (Shannon theory) (94A24)

Cites Work

• Unnamed Item
• Secret sharing schemes from binary linear codes
• Generalized Hamming weights and equivalences of codes
• \((l,s)\)-extension of linear codes
• The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
• Classification of Griesmer codes and dual transform
• Characters and the equivalence of codes
• Some New Characters on the Wire-Tap Channel of Type II
• Generalized Hamming weights for linear codes
• An elementary proof of the MacWilliams theorem on equivalence of codes
• Duality for modules over finite rings and applications to coding theory
• The weight hierarchies of q-ary codes of dimension 4
• Geometric approach to higher weights
• Code equivalence characterizes finite Frobenius rings

This page was built for publication: New code equivalence based on relative generalized Hamming weights