On the Feng-Rao Bound for the L-construction of Algebraic Geometry Codes

Ryutaroh MATSUMOTO  Shinji MIURA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E83-A   No.5   pp.923-926
Publication Date: 2000/05/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Information Theory
algebraic geometry code,  minimum distance,  decoding,  L-construction,  

Full Text: PDF>>
Buy this Article

We show how to apply the Feng-Rao decoding algorithm and the Feng-Rao bound for the Ω-construction of algebraic geometry codes to the L-construction. Then we give examples in which the L-construction gives better linear codes than the Ω-construction in certain range of parameters on the same curve.