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

Lower bound on minimum Lee distance of algebraic–geometric codes over finite fields

Lower bound on minimum Lee distance of algebraic–geometric codes over finite fields

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

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

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.

  • Author(s): X.-W. Wu 1 ; M. Kuijper 2 ; P. Udaya 3
    • View affiliations
    • Affiliations: 1: School of Information Technology and Mathematical Sciences, University of Ballarat, Australia
      2: Department of Electrical and Electronic Engineering, University of Melbourne, Australia
      3: Department of Computer Science and Software Engineering, University of Melbourne, Australia
  • Source: Volume 43, Issue 15, 19 July 2007, p. 820 – 822
    DOI:  10.1049/el:20070641 , Print ISSN 0013-5194, Online ISSN 1350-911X
© The Institution of Engineering and Technology
Published

Algebraic–geometric (AG) codes over finite fields with respect to the Lee metric have been studied. A lower bound on the minimum Lee distance is derived, which is a Lee-metric version of the well-known Goppa bound on the minimum Hamming distance of AG codes. The bound generalises a lower bound on the minimum Lee distance of Lee-metric BCH and Reed-Solomon codes, which have been successfully used for protecting against bitshift and synchronisation errors in constrained channels and for error control in partial-response channels.

Inspec keywords: synchronisation; channel coding; error correction codes; BCH codes; Hamming codes; Reed-Solomon codes; Goppa codes; algebraic geometric codes

Other keywords: Lee-metric version; minimum Hamming distance; algebraic-geometric codes; minimum Lee distance; finite field; BCH codes; partial-response channel; Goppa bound; synchronisation error control; Reed-Solomon codes

Subjects: Codes

References

    1. 1)
      • Wu, X.-W., Kuijper, M., Udaya, P.: `On the decoding radius of Lee-metric decoding of algebraic-geometric codes', Proc. 2005 IEEE Int. Symp. on Information Theory, September 2005, Adelaide, Australia.
    2. 2)
      • Wu, X.-W., Kuijper, M., Udaya, P.: `Improved decoding of algebraic-geometric codes with respect to the Lee metric', Proc. 2005 Australian Communications Theory Workshop, February 2005, Brisbane, Australia.
    3. 3)
    4. 4)
    5. 5)
      • T. Høholdt , J.H. van Lint , R. Pellikaan , V.S. Pless , W.C. Huffman , R.A. Brualdi . (1998) Algebraic geometry codes, Handbook of coding theory.
    6. 6)
      • E.R. Berlekamp . (1984) , Algebraic coding theory.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20070641
Loading

Related content

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