Title :
The worst case probability of undetected error for linear codes on the local binomial channel
Author_Institution :
Dept. of Inf., Bergen Univ., Norway
fDate :
1/1/1996 12:00:00 AM
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 is determined explicitly for some classes of codes
Keywords :
channel coding; coding errors; error detection codes; error statistics; linear codes; probability; telecommunication channels; linear [n,k:q] code; linear codes; local binomial channel; undetected error; weight hierarchy; worst case probability; Codes; Computer aided software engineering; Councils; Error probability; Hamming weight; Informatics; Information theory; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on