### Skapa referens, olika format (klipp och klistra)

**Harvard**

Dodunekova, R. och Nikolova, E. (2005) *Sufficient conditions for the monotonicity of the undetected error
probability for large channel error probabilities*.

** BibTeX **

@article{

Dodunekova2005,

author={Dodunekova, Rossitza and Nikolova, Evgenia},

title={Sufficient conditions for the monotonicity of the undetected error
probability for large channel error probabilities},

journal={Problems of Information
Transmission},

volume={41},

issue={3},

pages={187-198},

abstract={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.},

year={2005},

keywords={linear code, error detection, proper code,
interval propernes},

}

** RefWorks **

RT Journal Article

SR Print

ID 25921

A1 Dodunekova, Rossitza

A1 Nikolova, Evgenia

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

YR 2005

JF Problems of Information
Transmission

VO 41

IS 3

SP 187

OP 198

AB 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.

LA eng

OL 30