On binary linear codes whose automorphism group is trivial

DOI10.1080/09720529.2014.927650MaRDI QIDQ5069726zbMATH OpenOpenAlexFDO

Authors Driss Harzalla, A. Haily

Publication date 19 April 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2014.927650

zbMATH Keywords

automorphism groupbinary matrixbipartite graphequivalent codeinvariantsignature

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• On the existence of extended perfect binary codes with trivial symmetry group
• On automorphism groups of binary linear codes
• scientific article; zbMATH DE number 1284430
• Binary optimal linear rate 1/2 codes
• An extremal ternary self-dual \([28,14,9]\) code with a trivial automorphism group

Cites work

• About the code equivalence
• Classification algorithms for codes and designs
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Fundamentals of Error-Correcting Codes
• scientific article; zbMATH DE number 53946 (Why is no real title available?)
• scientific article; zbMATH DE number 238421 (Why is no real title available?)

Cited in

(8)

• Self-orthogonal codes with distance four are not rigid
• Maximum weight spectrum codes
• Codes with a certain weight-preserving transitive group of automorphisms
• scientific article; zbMATH DE number 4029440 (Why is no real title available?)
• A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code
• A note on full weight spectrum codes
• scientific article; zbMATH DE number 7758721 (Why is no real title available?)
• MWS and FWS codes for coordinate-wise weight functions

This page was built for publication: On binary linear codes whose automorphism group is trivial

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