On normal and subnormal q-ary codes

A.C. Lobstein; G.J.M. Wee, van

doi:10.1109/18.45285

On normal and subnormal q-ary codes

A.C. Lobstein, G.J.M. Wee, van

Mathematics and Computer Science

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

22 Citations (Scopus)

Abstract

The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgamated direct sum construction, in order to investigate problems related to the covering radius of codes. For example, the authors prove that every nonbinary nontrivial perfect code is absubnormal. They also include some linear-programming lower bounds on ternary codes with covering radius 2 or 3.

Original language	English
Pages (from-to)	1291-1295
Journal	IEEE Transactions on Information Theory
Volume	35
Issue number	6
DOIs	https://doi.org/10.1109/18.45285
Publication status	Published - 1989

Access to Document

10.1109/18.45285

Cite this

@article{d6362a4c6c0e4ba9a17898822c1bbd7a,

title = "On normal and subnormal q-ary codes",

abstract = "The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgamated direct sum construction, in order to investigate problems related to the covering radius of codes. For example, the authors prove that every nonbinary nontrivial perfect code is absubnormal. They also include some linear-programming lower bounds on ternary codes with covering radius 2 or 3.",

author = "A.C. Lobstein and {Wee, van}, G.J.M.",

year = "1989",

doi = "10.1109/18.45285",

language = "English",

volume = "35",

pages = "1291--1295",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "6",

}

TY - JOUR

T1 - On normal and subnormal q-ary codes

AU - Lobstein, A.C.

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

PY - 1989

Y1 - 1989

N2 - The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgamated direct sum construction, in order to investigate problems related to the covering radius of codes. For example, the authors prove that every nonbinary nontrivial perfect code is absubnormal. They also include some linear-programming lower bounds on ternary codes with covering radius 2 or 3.

AB - The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgamated direct sum construction, in order to investigate problems related to the covering radius of codes. For example, the authors prove that every nonbinary nontrivial perfect code is absubnormal. They also include some linear-programming lower bounds on ternary codes with covering radius 2 or 3.

U2 - 10.1109/18.45285

DO - 10.1109/18.45285

M3 - Article

SN - 0018-9448

VL - 35

SP - 1291

EP - 1295

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

ER -

On normal and subnormal q-ary codes

Abstract

Access to Document

Fingerprint

Cite this