Construction and decoding of a class of algebraic geometry codes
From MaRDI portal
Publication:4735143
DOI10.1109/18.32157zbMath0684.94017OpenAlexW2131723039MaRDI QIDQ4735143
Helge Elbrond Jensen, Knud J. Larsen, Tom Høholdt, Allan Havemose, Jørn Justesen
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/4016cde9-de6a-42f1-9555-da48b5656a9a
decoding algorithmcodes derived from algebraic plane curvesgenerator and parity-check matricesPeterson algorithm for decoding BCH codes
Related Items (13)
On the evaluation codes given by simple \(\delta \)-sequences ⋮ On the weight hierarchy of codes associated to curves of complete intersection ⋮ A generalization of Baker's theorem ⋮ Evaluation codes defined by finite families of plane valuations at infinity ⋮ Linear codes associated to the ideal of points in PdAnd its canonical module ⋮ Gröbner basis approach to list decoding of algebraic geometry codes ⋮ Almost MDS codes ⋮ On decoding by error location and dependent sets of error positions ⋮ Hermitian codes as generalized Reed-Solomon codes ⋮ Decoding by rank-2 bundles over plane quartics ⋮ Improved evaluation codes defined by plane valuations ⋮ Explicit computation of generalized Hamming weights for some algebraic geometric codes ⋮ Power error locating pairs
This page was built for publication: Construction and decoding of a class of algebraic geometry codes