Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Lee-metric decoding of BCH and Reed–Solomon codes

Lee-metric decoding of BCH and Reed–Solomon codes

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A Lee-metric list-decoding algorithm for Reed–Solomon (RS) codes over GF( p) is presented. The algorithm is obtained by generalising the Guruswami–Sudan (Hamming metric) list-decoding algorithm for RS codes. The algorithm can be used to decode the Lee-metric BCH codes, and outperforms the known Lee-metric decoding algorithm for BCH codes.

References

    1. 1)
    2. 2)
      • L.E. Mazur . Codes correcting errors of large weight in Lee metric. Probl. Inf. Transm. (USSR) , 4 , 277 - 281
    3. 3)
      • E.R.: Berlekamp . (1984) Algebraic coding theory.
    4. 4)
    5. 5)
    6. 6)
      • Kötter, R., Vardy, A.: `Decoding of Reed–Solomon codes for additive cost functions', Proc. of 2002 IEEE Int. Symp. Information Theory, June 2002, Lausanne, Switzerland.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20030912
Loading

Related content

content/journals/10.1049/el_20030912
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address