Constructing covering codes with given automorphisms

DOI10.1023/A:1008326409439zbMath0927.94020OpenAlexW1585940209MaRDI QIDQ1283221

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

upper boundsautomorphism groupcovering radiustabu searchcovering codesbinary code

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)

Related Items (6)

New upper bounds for binary covering codes ⋮ Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ \(K_{5}(7,3) \leqslant 100\). ⋮ Perfect domination sets in Cayley graphs ⋮ An updated table of binary/ternary mixed covering codes ⋮ Rainbow perfect domination in lattice graphs

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