Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one

DOI10.1016/j.disc.2023.113752arXiv2203.16901OpenAlexW4387796040MaRDI QIDQ6184529

Ying-Sian Wu, Jun-Yo Chen

Publication date: 25 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.16901

zbMATH Keywords

covering radiusbinary codescovering codeshypercubesdominating setdomination number

Mathematics Subject Classification ID

Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A remark on Haas' method
• Constructing covering codes with given automorphisms
• New upper bounds for binary covering codes
• Lower Bounds for Binary Codes of Covering Radius One
• Further results on the covering radius of codes
• Improved sphere bounds on the covering radius of codes
• New lower bounds for binary covering codes
• On the size of optimal binary codes of length 9 and covering radius 1
• Several new lower bounds on the size of codes with covering radius one
• An updated table of binary/ternary mixed covering codes
• New binary covering codes obtained by simulated annealing
• Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r, q)
• A Combinatorial Problem in Matching
• New lower bounds for covering codes
• Covering problems for dichotomized matchings

This page was built for publication: Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one