CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Sufficient conditions for the monotonicity of the undetected error probability for large channel error probabilities

Rossitza Dodunekova (Institutionen för matematiska vetenskaper) ; Evgenia Nikolova
Problems of Information Transmission Vol. 41 (2005), 3, p. 187-198.
[Artikel, refereegranskad vetenskaplig]

The performance of a linear error-detecting code in a symmetric memoryless channel is characterized by its probability of undetected error, which is a function of the channel symbol error probability, involving basic parameters of a code and its weight distribution. However, the code weight distribution is known for relatively few codes since its computation is an NP-hard problem. It should therefore be useful to have criteria for properness and goodness in error detection that do not involve the code weight distribution. In this work we give two such criteria. We show that a binary linear code C of length n and its dual code C ⊥ of minimum code distance d ⊥ are proper for error detection whenever d ⊥ ≥ ⌊n/2⌋ + 1, and that C is proper in the interval [(n + 1 − 2d ⊥)/(n − d ⊥); 1/2] whenever ⌈n/3⌉ + 1 ≤ d ⊥ ≤ ⌊n/2⌋. We also provide examples, mostly of Griesmer codes and their duals, that satisfy the above conditions.

Nyckelord: linear code, error detection, proper code, interval propernes



Denna post skapades 2007-01-25.
CPL Pubid: 25921

 

Institutioner (Chalmers)

Institutionen för matematiska vetenskaperInstitutionen för matematiska vetenskaper (GU)

Ämnesområden

Annan matematik

Chalmers infrastruktur