A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound

DOI10.1006/ffta.1995.1006zbMath0814.94028OpenAlexW2053801375MaRDI QIDQ1344098

Y. Madelung, Tom Høholdt, Shojiro Sakata, Helge Elbrond Jensen, Jørn Justesen

Publication date: 9 February 1995

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1995.1006

zbMATH Keywords

Berlekamp-Massey algorithmgeometric Goppa codesFeng-Rao boundone-point codesalgebraic- geometric codesfast decodingFeng-Rao algorithmMiura-Kamiya curvesSakata algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Computational aspects of algebraic curves (14Q05) Decoding (94B35)

Related Items

A sequence of one-point codes from a tower of function fields, Aggregate error locator and error value computation in AG codes, On codes from norm-trace curves