Title :
Some results on the norm of codes
Author_Institution :
Dept. of Math., Illinois Univ., Chicago, IL, USA
fDate :
5/1/1990 12:00:00 AM
Abstract :
Two upper bounds for the norm N(C) of a binary linear code C with minimal weight d and covering radius R are given. The second of these bounds implies that C is normal if R=3
Keywords :
error correction codes; binary linear code; covering radius; minimal weight; norm; upper bounds; Block codes; Concatenated codes; Cutoff frequency; Decoding; Error correction codes; Interference; Linear code; Reed-Solomon codes; Spread spectrum communication; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
