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

Xin-Wen Wu | Zendy; Margreta Kuijper | Zendy; Udaya Parampalli | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Xin-Wen Wu,

Margreta Kuijper,

Udaya Parampalli

Publication year - 2007

Publication title -

electronics letters

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.375

H-Index - 146

eISSN - 1350-911X

pISSN - 0013-5194

DOI - 10.1049/el:20070641

Subject(s) - hamming distance , bch code , minimum distance , finite field , mathematics , upper and lower bounds , metric (unit) , reed–solomon error correction , hamming code , algebraic number , discrete mathematics , combinatorics , error detection and correction , block code , linear code , algorithm , decoding methods , mathematical analysis , operations management , economics

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.No Full Tex

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research