On the equivalence of linear codes

DOI10.1007/S00200-011-0142-8zbMATH Open1257.94038OpenAlexW2076719652MaRDI QIDQ429744FDOQ429744

Authors: Zhimin Sun, Zihui Liu 

Publication date: 20 June 2012

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-011-0142-8

Recommendations

• Generalized Hamming weights and equivalences of codes
• Further results on the semilinear equivalence of linear codes
• New code equivalence based on relative generalized Hamming weights
• Characters and the equivalence of codes
• The equivalence of linear codes implies semi-linear equivalence

zbMATH Keywords

projective spacesupport weightcode equivalencerelative generalized Hamming weightmonomial transformationrelative subcode

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Characters and the equivalence of codes
• An elementary proof of the MacWilliams theorem on equivalence of codes
• The weight hierarchies of q-ary codes of dimension 4
• Title not available (Why is that?)
• Generalized Hamming weights for linear codes
• Some New Characters on the Wire-Tap Channel of Type II
• The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
• Error-correcting codes: An axiomatic approach
• Generalized Hamming weights and equivalences of codes

Cited In (14)

• Note sur la notion d'équivalence entre deux codes linéaires
• Edge local complementation and equivalence of binary linear codes
• Generalized Hamming weights and equivalences of codes
• On the equivalence of linear cyclic and constacyclic codes
• About the code equivalence
• Characters and the equivalence of codes
• Title not available (Why is that?)
• Generalized Hamming weights and semilinear equivalence of codes
• Equivalence of linear codes with the same weight enumerator
• Isometries of the Hamming Space and Equivalence Relations of Linear Codes Over a Finite Field
• On the asymptotic number of non-equivalent \(q\)-ary linear codes.
• On the characterization of linear uniquely decodable codes
• On linear rigidity of a class of codes
• Finding the permutation between equivalent linear codes: the support splitting algorithm

This page was built for publication: On the equivalence of linear codes

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