On a decoding algorithm for codes on maximal curves

DOI10.1109/18.45279MaRDI QIDQ3470416zbMATH OpenOpenAlexFDO

Authors Ruud Pellikaan

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)

Recommendations

• On the decoding of algebraic-geometric codes
• On the decoding of algebraic-geometric codes over F/sub q/ for q<or=16
• Fast decoding of codes from algebraic plane curves
• Fast decoding of algebraic-geometric codes up to the designed minimum distance
• Decoding of codes defined by a single point on a curve

Cited in

(16)

• The genus of maximal function fields over finite fields
• A characterization of MDS codes that have an error correcting pair
• Hermitian codes as generalized Reed-Solomon codes
• The properties and the error-correcting pair for lengthened GRS codes
• scientific article; zbMATH DE number 125906 (Why is no real title available?)
• On decoding by error location and dependent sets of error positions
• An improvement for error-correcting pairs of some special MDS codes
• On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\)
• On the existence of error-correcting pairs
• The error-correcting pair for direct sum codes
• Power error locating pairs
• The error-correcting pair for TGRS codes
• On the error-correcting pair for MDS linear codes with even minimum distance
• On the decoding of algebraic-geometric codes over F/sub q/ for q<or=16
• Codes defined from some maximal curves
• Fast decoding of codes from algebraic curves

This page was built for publication: On a decoding algorithm for codes on maximal curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470416)