On Binary Linear Codes Whose Automorphism Group is Trivial

DOI10.1080/09720529.2014.927650zbMath1495.94107OpenAlexW1943969337MaRDI QIDQ5069726

Driss Harzalla, Abdelfattah 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

bipartite graphautomorphism groupsignatureinvariantbinary matrixequivalent code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (2)

Maximum weight spectrum codes ⋮ A note on full weight spectrum codes

Cites Work

• Classification algorithms for codes and designs
• Fundamentals of Error-Correcting Codes
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Binary Linear Codes Whose Automorphism Group is Trivial