DocumentCode :
2922887
Title :
The worst-case probability of undetected error for linear codes on the local binomial channel
Author :
Kløve, Torleiv
Author_Institution :
Dept. of Inf., Bergen Univ., Norway
fYear :
1995
fDate :
17-22 Sep 1995
Firstpage :
342
Abstract :
The worst-case probability of undetected error for a linear [n,k;q] code used on a local binomial channel is studied. For the two most important cases it is determined in terms of the weight hierarchy of the code. The worst-case probability of undetected error for simplex codes is determined explicitly. A conjecture about Hamming codes is given
Keywords :
Hamming codes; channel coding; error statistics; linear codes; probability; telecommunication channels; Hamming codes; linear codes; local binomial channel; simplex codes; undetected error; weight hierarchy; worst-case probability; Codes; Councils; Equations; Error probability; Informatics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
Type :
conf
DOI :
10.1109/ISIT.1995.550329
Filename :
550329
Link To Document :
بازگشت