More binary covering codes are normal

G.J.M. Wee, van

doi:10.1109/18.59947

More binary covering codes are normal

G.J.M. Wee, van

Mathematics and Computer Science

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

10 Citations (Scopus)

Abstract

It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves a conjecture of Cohen, Lobstein, and Sloane (1986). It is also proved that codes with minimal distance 2R or 2R+1 are normal. A generalization of Frankl's construction (1987) of abnormal codes is given.

Original language	English
Pages (from-to)	1466-1470
Journal	IEEE Transactions on Information Theory
Volume	36
Issue number	6
DOIs	https://doi.org/10.1109/18.59947
Publication status	Published - 1990

Access to Document

10.1109/18.59947

Cite this

@article{aa8abe70b44140ca9f9770a4aaf6a3d3,

title = "More binary covering codes are normal",

abstract = "It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves a conjecture of Cohen, Lobstein, and Sloane (1986). It is also proved that codes with minimal distance 2R or 2R+1 are normal. A generalization of Frankl's construction (1987) of abnormal codes is given.",

author = "\{Wee, van\}, G.J.M.",

year = "1990",

doi = "10.1109/18.59947",

language = "English",

volume = "36",

pages = "1466--1470",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "6",

}

TY - JOUR

T1 - More binary covering codes are normal

AU - Wee, van, G.J.M.

PY - 1990

Y1 - 1990

N2 - It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves a conjecture of Cohen, Lobstein, and Sloane (1986). It is also proved that codes with minimal distance 2R or 2R+1 are normal. A generalization of Frankl's construction (1987) of abnormal codes is given.

AB - It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves a conjecture of Cohen, Lobstein, and Sloane (1986). It is also proved that codes with minimal distance 2R or 2R+1 are normal. A generalization of Frankl's construction (1987) of abnormal codes is given.

U2 - 10.1109/18.59947

DO - 10.1109/18.59947

M3 - Article

SN - 0018-9448

VL - 36

SP - 1466

EP - 1470

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

ER -

More binary covering codes are normal

Abstract

Access to Document

Fingerprint

Cite this