Generalized bounds on binary/ternary mixed packing and covering codes

J.H. van Lint; G.J.M. Wee, van

doi:10.1016/0097-3165(91)90011-5

Generalized bounds on binary/ternary mixed packing and covering codes

J.H. van Lint, G.J.M. Wee, van

Mathematics and Computer Science

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

11 Citations (Scopus)

Abstract

We derive lower bounds onR-coverings and upper bounds one-packings of . These bounds are generalizations of the bounds for the cases R = 1, e = 1 or t = 0 or b = 0, which were already derived in a paper by the second-named author. The present work is a supplement to that paper. The computed results for t + b = 13 and R, e = 3 are collected in a table.

Original language	English
Pages (from-to)	130-143
Number of pages	14
Journal	Journal of Combinatorial Theory, Series A
Volume	57
Issue number	1
DOIs	https://doi.org/10.1016/0097-3165(91)90011-5
Publication status	Published - 1991

Access to Document

10.1016/0097-3165(91)90011-5

Cite this

@article{bc51d208c86040768d11c22dbb0f1214,

title = "Generalized bounds on binary/ternary mixed packing and covering codes",

abstract = "We derive lower bounds onR-coverings and upper bounds one-packings of . These bounds are generalizations of the bounds for the cases R = 1, e = 1 or t = 0 or b = 0, which were already derived in a paper by the second-named author. The present work is a supplement to that paper. The computed results for t + b = 13 and R, e = 3 are collected in a table.",

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

year = "1991",

doi = "10.1016/0097-3165(91)90011-5",

language = "English",

volume = "57",

pages = "130--143",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Generalized bounds on binary/ternary mixed packing and covering codes

AU - van Lint, J.H.

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

PY - 1991

Y1 - 1991

N2 - We derive lower bounds onR-coverings and upper bounds one-packings of . These bounds are generalizations of the bounds for the cases R = 1, e = 1 or t = 0 or b = 0, which were already derived in a paper by the second-named author. The present work is a supplement to that paper. The computed results for t + b = 13 and R, e = 3 are collected in a table.

AB - We derive lower bounds onR-coverings and upper bounds one-packings of . These bounds are generalizations of the bounds for the cases R = 1, e = 1 or t = 0 or b = 0, which were already derived in a paper by the second-named author. The present work is a supplement to that paper. The computed results for t + b = 13 and R, e = 3 are collected in a table.

U2 - 10.1016/0097-3165(91)90011-5

DO - 10.1016/0097-3165(91)90011-5

M3 - Article

SN - 0097-3165

VL - 57

SP - 130

EP - 143

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 1

ER -

Generalized bounds on binary/ternary mixed packing and covering codes

Abstract

Access to Document

Fingerprint

Cite this