Improved sphere bounds on the covering radius of codes

G.J.M. Wee, van

doi:10.1109/18.2632

Improved sphere bounds on the covering radius of codes

G.J.M. Wee, van

Mathematics and Computer Science

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

60 Citations (Scopus)

1 Downloads (Pure)

Abstract

The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)&ges;2 n/n for n even. A table of lower and upper bounds on K(n,R) for n&les;33, R &les;10 is included

Original language	English
Pages (from-to)	237-245
Number of pages	9
Journal	IEEE Transactions on Information Theory
Volume	34
Issue number	2
DOIs	https://doi.org/10.1109/18.2632
Publication status	Published - 1988

Access to Document

10.1109/18.2632

Cite this

@article{084980637aa6476cb88027075af11cbd,

title = "Improved sphere bounds on the covering radius of codes",

abstract = "The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)&ges;2 n/n for n even. A table of lower and upper bounds on K(n,R) for n&les;33, R &les;10 is included",

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

year = "1988",

doi = "10.1109/18.2632",

language = "English",

volume = "34",

pages = "237--245",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "2",

}

TY - JOUR

T1 - Improved sphere bounds on the covering radius of codes

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

PY - 1988

Y1 - 1988

N2 - The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)&ges;2 n/n for n even. A table of lower and upper bounds on K(n,R) for n&les;33, R &les;10 is included

AB - The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)&ges;2 n/n for n even. A table of lower and upper bounds on K(n,R) for n&les;33, R &les;10 is included

U2 - 10.1109/18.2632

DO - 10.1109/18.2632

M3 - Article

VL - 34

SP - 237

EP - 245

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2

ER -

Improved sphere bounds on the covering radius of codes

Abstract

Access to Document

Fingerprint

Cite this