A note on bounds for q-ary covering codes | IEEE Journals & Magazine | IEEE Xplore

A note on bounds for q-ary covering codes


Abstract:

Two strongly seminormal codes over Z/sub 5/ are constructed to prove a conjecture of Ostergard (see ibid., vol.37, no.3, p.660-4, 1991). It is shown that a result of Honk...Show More

Abstract:

Two strongly seminormal codes over Z/sub 5/ are constructed to prove a conjecture of Ostergard (see ibid., vol.37, no.3, p.660-4, 1991). It is shown that a result of Honkala (see ibid., vol.37, no.4, p.1203-6, 1991) on (k,t)-subnormal codes holds also under weaker assumptions. A lower bound and an upper bound on K/sub q/(n, R), the minimal cardinality of a q-ary code of length n with covering radius R are obtained. These give improvements in seven upper bounds and twelve lower bounds by Ostergard for K/sub q/(n, R) for q=3, 4, and 5.
Published in: IEEE Transactions on Information Theory ( Volume: 42, Issue: 5, September 1996)
Page(s): 1640 - 1642
Date of Publication: 06 August 2002

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.