- Title
- Lower bound on minimum lee distance of algebraic-geometric codes over finite fields
- Creator
- Wu, Xinwen; Kuijper, Margreta; Udaya, Parampalli
- Date
- 2007
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/59411
- Identifier
- vital:950
- Identifier
-
https://doi.org/10.1049/el:20070641
- Identifier
- ISSN:0013-5194
- Abstract
- 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.; C1
- Publisher
- The Institution of Engineering and Technology
- Relation
- Electronics Letters Vol. 43, no. 15 (2007), p. 820-822
- Rights
- Copyright The Institution of Engineering and Technology
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0906 Electrical and Electronic Engineering; Finite fields (Alegbra); Reed-Solomon codes; Synchronization; Error-correcting codes; Mathematics
- Full Text
- Reviewed
- Hits: 1311
- Visitors: 1593
- Downloads: 327
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | DS1 | Final Version | 76 KB | Adobe Acrobat PDF | View Details Download |