On the public citation graph
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
0 signed · 84 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/ffta.1995.1006openalex-snapshot
A Fast Decoding Method of AG Codes from Miura-Kamiya Curves Cab up to Half the Feng-Rao Bound
inferredcites →https://doi.org/10.1007/978-3-0348-9286-5openalex-snapshot
Introduction to Coding Theory and Algebraic Geometry
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.1016/0890-5401(90)90039-kopenalex-snapshot
Extension of the Berlekamp-Massey algorithm to N dimensions
inferredcites →https://doi.org/10.1080/00927879508825294openalex-snapshot
A family of kummer extensions of the hermitian function field
inferredcites →https://doi.org/10.1109/18.108255openalex-snapshot
Fast decoding of codes from algebraic plane curves
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.272487openalex-snapshot
Fast decoding of codes from algebraic curves
inferredcites →https://doi.org/10.1109/18.476240openalex-snapshot
Fast decoding of algebraic-geometric codes up to the designed minimum distance
inferredcites →https://doi.org/10.1109/18.476244openalex-snapshot
Decoding of codes defined by a single point on a curve
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/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.6100/ir399251openalex-snapshot
Decoding codes from curves and cyclic codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.2965openalex-snapshot
Finding Recursions for Multidimensional Arrays
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-46796-3_30openalex-snapshot
A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_23openalex-snapshot
A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes
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-1-4615-5121-8_4openalex-snapshot
The BM Algorithm and the BMS Algorithm
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/978-3-642-57189-3_7openalex-snapshot
On Weierstrass Semigroups and One-point Algebraic Geometry Codes
inferred← citeshttps://doi.org/10.1007/978-3-662-44199-2_21openalex-snapshot
Magma Implementation of Decoding Algorithms for General Algebraic Geometry Codes
inferred← citeshttps://doi.org/10.1007/bf02883631openalex-snapshot
Syndrome series of one point algebraic-geometric codes and majority voting scheme
inferred← citeshttps://doi.org/10.1007/bf02917047openalex-snapshot
A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes (I)
inferred← citeshttps://doi.org/10.1007/bf02917055openalex-snapshot
A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes (II)
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-006-9013-xopenalex-snapshot
A sequence of one-point codes from a tower of function fields
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/j.jsc.2016.02.015openalex-snapshot
List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.025openalex-snapshot
Improved probabilistic decoding of interleaved Reed–Solomon codes and folded Hermitian 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.476240openalex-snapshot
Fast decoding of algebraic-geometric codes up to the designed minimum distance
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.771253openalex-snapshot
Performance analysis of a decoding algorithm for algebraic-geometry codes
inferred← citeshttps://doi.org/10.1109/isit.1995.531300openalex-snapshot
Fast erasure-and-error decoding of any one-point AG codes up to the Feng-Rao bound
inferred← citeshttps://doi.org/10.1109/isit.1995.531303openalex-snapshot
A fast parallel decoding algorithm for general one-point AG codes with a systolic array architecture
inferred← citeshttps://doi.org/10.1109/isit.1997.613315openalex-snapshot
A systolic array architecture for implementing a fast parallel decoding algorithm of one-point AG codes
inferred← citeshttps://doi.org/10.1109/isit.1997.613318openalex-snapshot
Grobner bases for linear recursion relations on m-D arrays and applications to decoding
inferred← citeshttps://doi.org/10.1109/isit.1997.613319openalex-snapshot
Fast erasure and error decoding of algebraic geometry codes up to the Feng-Rao bound
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/isit.2002.1023330openalex-snapshot
Synthesis of the simplest linear feedback shift register allowing prescribed pairs of input and output sequences - a fast algorithm for solving discrete-time Wiener-Hopf equations
inferred← citeshttps://doi.org/10.1109/isit.2005.1523689openalex-snapshot
Multiple-sequence BM algorithm can be replaced by a succession of single-sequence BM algorithm
inferred← citeshttps://doi.org/10.1109/isit.2007.4557619openalex-snapshot
Encoding via Gröbner bases and discrete Fourier transforms for several types of algebraic codes
inferred← citeshttps://doi.org/10.1109/isit.2011.6033681openalex-snapshot
Solving the key equation for Hermitian codes with a division algorithm
inferred← citeshttps://doi.org/10.1109/isit.2011.6033684openalex-snapshot
On a fast decoding of multipoint codes from algebraic curves
inferred← citeshttps://doi.org/10.1109/isit.2012.6284685openalex-snapshot
List decoding algorithms based on Gröbner bases for general one-point AG codes
inferred← citeshttps://doi.org/10.1109/isit.2015.7282946openalex-snapshot
Linear complexity for multidimensional arrays - a numerical invariant
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619084openalex-snapshot
Efficient Root-Finding for Interpolation-Based Decoding of Elliptic and Hyperelliptic Codes
inferred← citeshttps://doi.org/10.1109/isita.2008.4895446openalex-snapshot
Unified systems of encoding and decoding for a class of algebraic-geometric 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.1562357openalex-snapshot
Hardware analysis of decoding algorithms for AGC
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/secon.1996.510063openalex-snapshot
Algebraic geometry codes from Reed Solomon codes
inferred← citeshttps://doi.org/10.1109/tit.2005.846428openalex-snapshot
On the Quadratic Span of Binary Sequences
inferred← citeshttps://doi.org/10.1109/tit.2005.856950openalex-snapshot
Systolic Array Architecture Implementing Berlekamp–Massey–Sakata Algorithm for Decoding Codes on a Class of Algebraic 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.2311042openalex-snapshot
Lemma for Linear Feedback Shift Registers and DFTs Applied to Affine Variety Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2424415openalex-snapshot
Sub-Quadratic Decoding of One-Point Hermitian 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.1109/tit.2020.3042248openalex-snapshot
Fast Encoding of AG Codes Over CabCurves
inferred← citeshttps://doi.org/10.1109/tit.2025.3566240openalex-snapshot
Algebraic Chase Decoding of Elliptic Codes With Generalized Re-Encoding Transform and Improved Root-Finding
inferred← citeshttps://doi.org/10.1109/wcnc.2003.1200390openalex-snapshot
Hardware implementation issues of a BMS decoding approach for AG based codes
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
inferred← citeshttps://doi.org/10.1515/9783110811056.155openalex-snapshot
The shift bound for cyclic, Reed-Muller and geometric Goppa codes
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.857openalex-snapshot
Can the BMS Algorithm Decode Up to [(dG)-g-1)/2] Errors? Yes, but with Some Additional Remarks
inferred← citeshttps://doi.org/10.1587/transfun.e99.a.733openalex-snapshot
Decoding of Projective Reed-Muller Codes by Dividing a Projective Space into Affine Spaces
inferred← citeshttps://doi.org/10.3934/amc.2016007openalex-snapshot
Decoding of differential AG codes
inferred← citeshttps://doi.org/10.4213/dm446openalex-snapshot
Алгоритм Берлекэмпа - Месси над конечными кольцами, модулями и бимодулями
inferred← citeshttps://doi.org/10.48550/arxiv.1210.0083openalex-snapshot
Decoding a Class of Affine Variety Codes with Fast DFT
inferred← citeshttps://doi.org/10.48550/arxiv.2003.13333openalex-snapshot
Fast Encoding of AG Codes over $C_{ab}$ Curves
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.