On normal and subnormal q-ary codes

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...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 35; no. 6; pp. 1291 - 1295
Main Authors Lobstein, A.C., van Wee, G.J.M.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.11.1989
Institute of Electrical and Electronics Engineers
Subjects
Applied sciences
Coding, codes
Error correction codes
Exact sciences and technology
Galois fields
Hamming distance
Information, signal and communications theory
Linear code
Linear programming
Mathematics
Signal and communications theory
Telecommunications and information theory
Upper bound
Lower bound
Linear programming
Ternary system
Binary code
Code
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.45285