On the decoding of algebraic-geometric codes
DOI10.1109/18.476214zbMATH Open0847.94012OpenAlexW2105882027MaRDI QIDQ4880282FDOQ4880282
Authors: Tom Høholdt, Ruud Pellikaan 
Publication date: 4 June 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.476214
Recommendations
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cited In (36)
- Computational aspects of retrieving a representation of an algebraic geometry code
- On the construction of algebraic-geometric codes
- Codes and the cartier operator
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- Sums of residues on algebraic surfaces and application to coding theory
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I
- On the dimension of the subfield subcodes of 1-point Hermitian codes
- Hermitian codes with automorphism group isomorphic to \(\operatorname{PGL}(2,q)\) with \(q\) odd
- On Decoding Algebraic Codes Using Radical Locators
- Hermitian codes from higher degree places
- Differential codes on higher dimensional varieties via Grothendieck's residue symbol
- On the structure of order domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coherence of sensing matrices coming from algebraic-geometric codes
- On the unique representation of very strong algebraic geometry codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- A displacement approach to efficient decoding of algebraic-geometric codes
- Achieving the designed error capacity in decoding algebraic-geometric codes
- On the decoding of algebraic-geometric codes
- Performance analysis of a decoding algorithm for algebraic-geometry codes
- Testing algebraic geometric codes
- Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
- Power error locating pairs
- On codes and learning with errors over function fields
- Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
- Syndrome series of one point algebraic-geometric codes and majority voting scheme
- Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
- Lower bounds on the minimum distance in Hermitian one-point differential codes
- Decoding algebraic geometry codes by a key equation
- Generalization of the Lee-O'Sullivan list decoding for one-point AG codes
This page was built for publication: On the decoding of algebraic-geometric codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880282)
