Constructing covering codes with given automorphisms

DOI10.1023/A:1008326409439MaRDI QIDQ1283221zbMATH OpenOpenAlexFDO

Authors Patric R. J. Östergård, William D. Weakley

Publication date 17 December 1999

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008326409439

zbMATH Keywords

automorphism groupbinary codecovering codescovering radiustabu searchupper bounds

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Review text

The authors consider the problem of finding upper bounds on \(K(n,r)\), the minimum number of words in a binary code of length \(n\) and covering radius \(r\). Constructions of covering codes give these bounds on \(K(n,r)\). It is shown how computer searches for covering codes can be speed up by requiring that the code has a given (not necessarily full) automorphism group. The optimization method used is tabu search. A new code is presented which proves a new record \(K(13,1)\leq 704\). This code has a very large full automorphism group and several other interesting properties.

Recommendations

• Constructing covering codes via automorphisms
• On the automorphism Group of a putative code
• Construction of self-dual codes with an automorphism of order \(p\)
• scientific article; zbMATH DE number 520162
• New constructions of covering codes
• The automorphism groups of certain codes
• scientific article; zbMATH DE number 3952657
• Constructing two-weight codes with prescribed groups of automorphisms
• Decomposing and shortening codes using automorphisms (Corresp.)
• On automorphisms of generalized algebraic-geometry codes

Cited in

(12)

• New upper bounds for binary covering codes
• \(K_{5}(7,3) \leqslant 100\).
• scientific article; zbMATH DE number 1229706 (Why is no real title available?)
• scientific article; zbMATH DE number 2148773 (Why is no real title available?)
• An updated table of binary/ternary mixed covering codes
• scientific article; zbMATH DE number 825138 (Why is no real title available?)
• New binary covering codes obtained by simulated annealing
• Rainbow perfect domination in lattice graphs
• Constructing covering codes via automorphisms
• Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
• Perfect truncated-metric codes in lattice graphs and superlattice graphs
• Perfect domination sets in Cayley graphs

This page was built for publication: Constructing covering codes with given automorphisms

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