Lower bounds for q-ary covering codes

1 May 1990

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 36 (3) , 664-671
https://doi.org/10.1109/18.54887

Abstract

The authors prove combinatorial lower bounds for Kq (n,R), the minimal cardinality of any q-ary code of length n and covering radius R. Tables of lower bounds for Kq(n,R) are presented for q=3, 4, 5

Keywords

COMBINATORIAL LOWER BOUNDS
MINIMAL CARDINALITY
LENGTH N
COMBINATORIAL MATHEMATICS
Q-ARY CODE
RADIUS R
CODES
Q-ARY COVERING CODES
LOWER BOUND
COVERING RADIUS
MATHEMATICS
UPPER BOUND
HAMMING DISTANCE

This publication has 0 references indexed in Scilit: