A remark on Haas' method

Alain Plagne

doi:10.1016/j.disc.2008.09.042

A remark on Haas' method

Alain Plagne

Research output: Contribution to journal › Article › peer-review

Abstract

We introduce a refinement in the method proposed some time ago by Haas for obtaining new lower bounds for the cardinality of codes with covering radius 1. As an application, we show that the minimal cardinality of a binary code in dimension 27 with covering radius 1 is at least K₂ (27, 1) ≥ 4 794 174.

Original language	English
Pages (from-to)	3318-3322
Number of pages	5
Journal	Discrete Mathematics
Volume	309
Issue number	10
DOIs	https://doi.org/10.1016/j.disc.2008.09.042
Publication status	Published - 28 May 2009

Keywords

Covering codes

Access to Document

10.1016/j.disc.2008.09.042

Cite this

@article{ccb09f65ca1e44b2842f1642094e4b88,

title = "A remark on Haas' method",

abstract = "We introduce a refinement in the method proposed some time ago by Haas for obtaining new lower bounds for the cardinality of codes with covering radius 1. As an application, we show that the minimal cardinality of a binary code in dimension 27 with covering radius 1 is at least K2 (27, 1) ≥ 4 794 174.",

keywords = "Covering codes",

author = "Alain Plagne",

year = "2009",

month = may,

day = "28",

doi = "10.1016/j.disc.2008.09.042",

language = "English",

volume = "309",

pages = "3318--3322",

journal = "Discrete Mathematics",

issn = "0012-365X",

number = "10",

}

TY - JOUR

T1 - A remark on Haas' method

AU - Plagne, Alain

PY - 2009/5/28

Y1 - 2009/5/28

N2 - We introduce a refinement in the method proposed some time ago by Haas for obtaining new lower bounds for the cardinality of codes with covering radius 1. As an application, we show that the minimal cardinality of a binary code in dimension 27 with covering radius 1 is at least K2 (27, 1) ≥ 4 794 174.

AB - We introduce a refinement in the method proposed some time ago by Haas for obtaining new lower bounds for the cardinality of codes with covering radius 1. As an application, we show that the minimal cardinality of a binary code in dimension 27 with covering radius 1 is at least K2 (27, 1) ≥ 4 794 174.

KW - Covering codes

U2 - 10.1016/j.disc.2008.09.042

DO - 10.1016/j.disc.2008.09.042

M3 - Article

AN - SCOPUS:67349266690

SN - 0012-365X

VL - 309

SP - 3318

EP - 3322

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 10

ER -

A remark on Haas' method

Abstract

Keywords

Access to Document

Fingerprint

Cite this