DocumentCode :
1311514
Title :
On the information function of an error-correcting code
Author :
Helleseth, Tor ; Klove, T. ; Levenshtein, Vladimir I.
Author_Institution :
Dept. of Inf., Bergen Univ., Norway
Volume :
43
Issue :
2
fYear :
1997
fDate :
3/1/1997 12:00:00 AM
Firstpage :
549
Lastpage :
557
Abstract :
The information function eh of a code is the average amount of information contained in h positions of the codewords. Upper and lower bounds on the information function of binary linear codes are given. The average value and variance of the information function over all [n, k] codes are determined,
Keywords :
binary sequences; error correction codes; information theory; linear codes; binary linear codes; codewords; error-correcting code; information function; lower bounds; upper bounds; variance; Binary codes; Councils; Cryptography; Decoding; Error correction codes; Hamming weight; Informatics; Linear code; Mathematics; Vectors;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.556112
Filename :
556112
Link To Document :
بازگشت