A remark on Haas' method
type: Item
instance of: scholarly article
title: A remark on Haas' method
zbMATH Open document ID: 1169.94018
author: Alain Plagne
published in: Discrete Mathematics
publication date: 2009-06-23T00:00:00Z
review text: The minimum cardinality of a binary code of length \(n\) and covering radius \(R\) is denoted by \(K(n,R)\). The author refines a method by \textit{W. Haas} [Discrete Math. 256, No. 1--2, 161--178 (2002; Zbl 1013.94039)] for obtaining lower bounds on \(K(n,1)\). The results include one specific new bound, \(K(27,1) \geq 4794174\).
reviewed by: Patric R. J. Östergård
Mathematics Subject Classification ID: 94B75
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 5569078
zbMATH Keywords: covering code
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: j.disc.2008.09.042
OpenAlex ID: W2064613794
cites work: Q4342497
cites work: Binary and ternary codes of covering radius one: some new lower bounds
cites work: Lower bounds for \(q\)-ary coverings by spheres of radius one
cites work: On the size of optimal binary codes of length 9 and covering radius 1
cites work: New upper bounds for binary covering codes
DOI: 10.1016/J.DISC.2008.09.042
Recommended article: Haas' theorem revisited
Recommended article: A note on the Hasse principle
Recommended article: Q4443192
Recommended article: A Note on Haar Measure
Recommended article: Q3982350
Recommended article: Q3352152
Recommended article: A note on Horner's method
Recommended article: A Remark on the Hensel Factorization Method
Recommended article: Remarks on a result of Hayman
description: scientific article; zbMATH DE number 5569078