A Chernoff type error bound for algebraic soft-decision decoding of Reed Solomon codes

We present exponential upper bounds on the performance of algebraic soft-decision decoding algorithm in the decoding of Reed-Solomon codes for a symmetric channel. The symmetric channels are useful for computing the performance of the algebraic soft-decision decoding algorithm in regimes where the p...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002 Ročník 1; s. 155 - 159 vol.1
Hlavní autoři: Ratnakar, N., Koetter, R.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2002
Témata:
Algorithm design and analysis
Analytical models
Decoding
Galois fields
H infinity control
Performance analysis
Polynomials
Reed-Solomon codes
Upper bound
ISBN:0780375769, 9780780375765
ISSN:1058-6393
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present exponential upper bounds on the performance of algebraic soft-decision decoding algorithm in the decoding of Reed-Solomon codes for a symmetric channel. The symmetric channels are useful for computing the performance of the algebraic soft-decision decoding algorithm in regimes where the probability of error is low. In such regimes, these bounds are of particular interest since it is impractical to run simulations. The bounds are Chernoff-type error bounds.
ISBN:0780375769
9780780375765
ISSN:1058-6393
DOI:10.1109/ACSSC.2002.1197167