New linear codes with prescribed group of automorphisms found by heuristic search

DOI10.3934/AMC.2009.3.157MaRDI QIDQ2268247zbMATH OpenOpenAlexFDO

Authors Axel Kohnert, Johannes Zwanzger

Publication date 10 March 2010

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/amc.2009.3.157

zbMATH Keywords

automorphism groupheuristic algorithmlinear codescoding theoryMonte-Carlohigh minimum distance

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10) Linear codes (general theory) (94B05) Diophantine equations (11D99)

Recommendations

• Optimal Linear Codes From Matrix Groups
• A Heuristic Algorithm for the Construction of Good Linear Codes
• Construction of Linear Codes With Large Minimum Distance
• scientific article; zbMATH DE number 1792627
• New constant weight codes from linear permutation groups

Cited in

(6)

• A heuristic approach for designing cyclic group codes
• On the existence of PD-sets: algorithms arising from automorphism groups of codes
• Optimal Linear Codes From Matrix Groups
• On the non-existence of a projective \((75, 4, 12, 5)\) set in \(\mathrm{PG}(3, 7)\)
• A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code
• On linear codes admitting large automorphism groups

This page was built for publication: New linear codes with prescribed group of automorphisms found by heuristic search

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