On a decoding algorithm for codes on maximal curves

DOI10.1109/18.45279zbMath0694.94015OpenAlexW2141839400MaRDI QIDQ3470416

Pellikaan, Ruud

Publication date: 1989

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.45279

zbMATH Keywords

minimum distancedecoding algorithmmaximal curvesalgebraic geometric codes

Mathematics Subject Classification ID

Decoding (94B35)

Related Items

On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\) ⋮ A characterization of MDS codes that have an error correcting pair ⋮ The genus of maximal function fields over finite fields ⋮ On the existence of error-correcting pairs ⋮ The error-correcting pair for TGRS codes ⋮ The properties and the error-correcting pair for lengthened GRS codes ⋮ On the error-correcting pair for MDS linear codes with even minimum distance ⋮ On decoding by error location and dependent sets of error positions ⋮ Hermitian codes as generalized Reed-Solomon codes