On binary linear codes whose automorphism group is trivial

DOI10.1080/09720529.2014.927650zbMATH Open1495.94107OpenAlexW1943969337MaRDI QIDQ5069726FDOQ5069726

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

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

zbMATH Keywords

automorphism groupbipartite graphsignaturebinary matrixinvariantequivalent code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Fundamentals of Error-Correcting Codes
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Classification algorithms for codes and designs
• About the code equivalence
• Title not available (Why is that?)

Cited In (7)

• Maximum weight spectrum codes
• Codes with a certain weight-preserving transitive group of automorphisms
• Title not available (Why is that?)
• A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code
• Self-orthogonal codes with distance four are not rigid
• A note on full weight spectrum codes
• Title not available (Why is that?)

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)