New upper bounds for binary covering codes
type: Item
instance of: scholarly article
title: New upper bounds for binary covering codes
zbMATH Open document ID: 0898.94017
DOI: 10.1016/S0012-365X(97)81825-0
author: Markku K. Kaikkonen
author: Patric R. J. Östergård
published in: Discrete Mathematics
publication date: 1998-01-26T00:00:00Z
review text: The authors consider upper bounds on \(K(n,r)\), the minimum cardinality of a binary code of length \(n\) and covering radius \(r\). Such bounds are obtained by constructing a corresponding covering code. The methods discussed are both combinatorial and based on computer search. The authors give an updated table of upper bounds on \(K(n,r)\), \(n\leq 64\), \(r\leq 12\).
Mathematics Subject Classification ID: 94B75
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 1110090
zbMATH Keywords: upper bounds
zbMATH Keywords: minimum cardinality
zbMATH Keywords: binary code
zbMATH Keywords: covering radius
zbMATH Keywords: covering code
zbMATH Keywords: table
MaRDI profile type: Publication
cites work: More coverings by rook domains
cites work: Q3487282
cites work: Covering radius---Survey and recent results
cites work: Covering radius 1985-1994
cites work: Further results on the covering radius of codes
cites work: Construction of linear covering codes
cites work: Constructions for perfect mixed codes and other covering codes
cites work: Linear codes with covering radius 2 and other new covering codes
cites work: Tabu Search—Part I
cites work: Rook domains, Latin squares, affine planes, and error-distributing codes
cites work: On the covering radius of codes
cites work: Bounds for binary multiple covering codes
cites work: Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
cites work: Lower bounds for binary covering codes
cites work: Modified bounds for covering codes
cites work: On (k, t)-subnormal covering codes
cites work: A new construction for covering codes
cites work: Some results on the norm of codes
cites work: Q5682335
cites work: Unit sphere packings and coverings of the Hamming space
cites work: On covering sets and error-correcting codes
cites work: Optimization by Simulated Annealing
cites work: New lower bounds for binary covering codes
cites work: Group Partitions and Mixed Perfect Codes
cites work: Q4954410
cites work: Q4146667
cites work: A new binary code of length 10 and covering radius 1
cites work: Upper bounds for q-ary covering codes
cites work: Further results on (k, t)-subnormal covering codes
cites work: On the covering radius of small codes
cites work: Q4307539
cites work: A coloring problem in Hamming spaces
cites work: Q4222145
cites work: A new table of binary/ternary mixed covering codes
cites work: New single-error-correcting codes
cites work: Constructing covering codes with given automorphisms
cites work: Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
cites work: Covering problems for dichotomized matchings
cites work: Q3831025
cites work: The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
cites work: New binary covering codes obtained by simulated annealing
full work available at URL: s0012-365x(97)81825-0
OpenAlex ID: W1975005357
description: scientific article; zbMATH DE number 1110090