On the public citation graph

Decoding of codes defined by a single point on a curve

0 signed · 53 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-76878-4openalex-snapshot
Algebraic Function Fields and Codes
inferredcites →https://doi.org/10.1007/978-3-7091-2786-5_20openalex-snapshot
On the Efficient Decoding of Algebraic-Geometric Codes
inferredcites →https://doi.org/10.1007/bfb0087995openalex-snapshot
On the true minimum distance of Hermitian codes
inferredcites →https://doi.org/10.1016/0022-4049(93)90039-vopenalex-snapshot
Consecutive Weierstrass gaps and minimum distance of Goppa codes
inferredcites →https://doi.org/10.1016/0890-5401(90)90039-kopenalex-snapshot
Extension of the Berlekamp-Massey algorithm to N dimensions
inferredcites →https://doi.org/10.1109/18.108255openalex-snapshot
Fast decoding of codes from algebraic plane curves
inferredcites →https://doi.org/10.1109/18.165441openalex-snapshot
Decoding geometric Goppa codes using an extra place
inferredcites →https://doi.org/10.1109/18.179340openalex-snapshot
Decoding algebraic-geometric codes up to the designed minimum distance
inferredcites →https://doi.org/10.1109/18.212305openalex-snapshot
Algebraic decoding using special divisors
inferredcites →https://doi.org/10.1109/18.256485openalex-snapshot
Achieving the designed error capacity in decoding algebraic-geometric codes
inferredcites →https://doi.org/10.1109/18.256518openalex-snapshot
Majority coset decoding
inferredcites →https://doi.org/10.1109/18.272487openalex-snapshot
Fast decoding of codes from algebraic curves
inferredcites →https://doi.org/10.1109/18.32157openalex-snapshot
Construction and decoding of a class of algebraic geometry codes
inferredcites →https://doi.org/10.1109/18.45279openalex-snapshot
On a decoding algorithm for codes on maximal curves
inferredcites →https://doi.org/10.1109/18.476245openalex-snapshot
The minimum distance of codes in an array coming from telescopic semigroups
inferredcites →https://doi.org/10.1109/18.57204openalex-snapshot
On the decoding of algebraic-geometric codes
inferredcites →https://doi.org/10.1109/18.86974openalex-snapshot
Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/ffta.2000.0283openalex-snapshot
New Codes for the Berlekamp–Massey–Sakata Algorithm
inferred← citeshttps://doi.org/10.1006/ffta.2001.0347openalex-snapshot
On the Structure of Order Domains
inferred← citeshttps://doi.org/10.1007/11423461_21openalex-snapshot
Algebraic Feedback Shift Registers Based on Function Fields
inferred← citeshttps://doi.org/10.1007/3-540-44828-4_22openalex-snapshot
Improvements to Evaluation Codes and New Characterizations of Arf Semigroups
inferred← citeshttps://doi.org/10.1007/978-1-4615-5121-8_1openalex-snapshot
On (or in) the Blahut Footprint
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_10openalex-snapshot
The BMS Algorithm and Decoding of AG Codes
inferred← citeshttps://doi.org/10.1007/s00200-006-0015-8openalex-snapshot
The Correction Capability of the Berlekamp–Massey–Sakata Algorithm with Majority Voting
inferred← citeshttps://doi.org/10.1007/s00200-015-0271-6openalex-snapshot
On the evaluation codes given by simple $$\delta $$ δ -sequences
inferred← citeshttps://doi.org/10.1007/s10623-012-9738-7openalex-snapshot
Evaluation codes defined by finite families of plane valuations at infinity
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.03.016openalex-snapshot
Aggregate error locator and error value computation in AG codes
inferred← citeshttps://doi.org/10.1016/s0022-4049(01)00074-3openalex-snapshot
The key equation for one-point codes and efficient error evaluation
inferred← citeshttps://doi.org/10.1023/b:desi.0000012445.67356.7aopenalex-snapshot
On Koetter's Algorithm and the Computation of Error Values
inferred← citeshttps://doi.org/10.1049/iet-com.2013.0175openalex-snapshot
Efficient VLSI architecture for interpolation decoding of Hermitian codes
inferred← citeshttps://doi.org/10.1090/conm/642/12883openalex-snapshot
Evaluation Codes and Plane Valuations
inferred← citeshttps://doi.org/10.1109/18.476214openalex-snapshot
On the decoding of algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/18.476248openalex-snapshot
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
inferred← citeshttps://doi.org/10.1109/18.508855openalex-snapshot
A generalized Forney formula for algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/18.681314openalex-snapshot
A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/18.681332openalex-snapshot
Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
inferred← citeshttps://doi.org/10.1109/18.720550openalex-snapshot
Algebraic-geometry codes
inferred← citeshttps://doi.org/10.1109/18.746805openalex-snapshot
Efficient Forney functions for decoding AG codes
inferred← citeshttps://doi.org/10.1109/18.771253openalex-snapshot
Performance analysis of a decoding algorithm for algebraic-geometry codes
inferred← citeshttps://doi.org/10.1109/18.825814openalex-snapshot
Decoding of Hermitian codes: the key equation and efficient error evaluation
inferred← citeshttps://doi.org/10.1109/apccas.1998.743827openalex-snapshot
Algebraic geometry code decoding based on Chinese remainder theorem
inferred← citeshttps://doi.org/10.1109/isit.1997.613313openalex-snapshot
VLSI architecture for a decoder for Hermitian codes
inferred← citeshttps://doi.org/10.1109/isit.1997.613314openalex-snapshot
Decoding of one-point codes using error evaluator polynomials
inferred← citeshttps://doi.org/10.1109/isit.1997.613321openalex-snapshot
Decoding Hermitian codes beyond (d/sub min/-1)/2
inferred← citeshttps://doi.org/10.1109/isit.1998.708983openalex-snapshot
Performance analysis of a decoding algorithm for algebraic geometry codes
inferred← citeshttps://doi.org/10.1109/itw.1998.706397openalex-snapshot
Recent results in the decoding of algebraic geometry codes
inferred← citeshttps://doi.org/10.1109/mwscas.2003.1562576openalex-snapshot
Architecture for a decoder of algebraic-geometric codes based on Hermitian curves
inferred← citeshttps://doi.org/10.1109/tit.2014.2300473openalex-snapshot
Fast Decoding of Multipoint Codes from Algebraic Curves
inferred← citeshttps://doi.org/10.1109/tit.2014.2306816openalex-snapshot
Unique Decoding of General AG Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2807478openalex-snapshot
Fast Decoding of Dual Multipoint Codes From Algebraic Curves Up to the Kirfel–Pellikaan Bound
inferred← citeshttps://doi.org/10.1112/plms/pdn042openalex-snapshot
δ-sequences and evaluation codes defined by plane valuations at infinity
inferred← citeshttps://doi.org/10.14209/jcis.2003.15openalex-snapshot
Decodificação de Códigos Algébrico-Geométrico
inferred← citeshttps://doi.org/10.14209/jcis.2006.1openalex-snapshot
Arquitetura para um Decodificador de Códigos de Hermite Pela Solução de uma Equação Chave
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.