On the public citation graph

Fast decoding of algebraic-geometric codes up to the designed minimum distance

0 signed · 98 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.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.1016/0022-4049(88)90046-1openalex-snapshot
Self-dual 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.1016/s0747-7171(88)80033-6openalex-snapshot
Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
inferredcites →https://doi.org/10.1017/cbo9780511525988openalex-snapshot
Finite Fields and Applications
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.21267openalex-snapshot
A note on Hermitian codes over GF(q/sup 2/)
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.335972openalex-snapshot
A simple approach for construction of algebraic-geometric codes from affine plane curves
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.476248openalex-snapshot
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
inferredcites →https://doi.org/10.1109/18.57204openalex-snapshot
On the decoding of algebraic-geometric codes
inferredcites →https://doi.org/10.1109/isit.1993.748618openalex-snapshot
A Novel Approach for Construction of Algebraic Geometric Codes from Affine Plane Curves

What points at this work

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

inferred← citeshttps://doi.org/10.1002/dac.901openalex-snapshot
Serial concatenation of Hermitian codes with ring‐TCM codes
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-60114-7_32openalex-snapshot
A fast parallel implementation of the Berlekamp-Massey algorithm with a 1D systolic array architecture
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_4openalex-snapshot
The BM Algorithm and the BMS Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4757-3585-7_12openalex-snapshot
Coding for Slow-Frequency-Hop Transmission: Variations on a Theme of McEliece
inferred← citeshttps://doi.org/10.1007/978-3-319-08293-6_2openalex-snapshot
Theoretical Background
inferred← citeshttps://doi.org/10.1007/978-3-319-08293-6_3openalex-snapshot
Literature Review
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-662-03891-8_11openalex-snapshot
Gröbner Bases for Decoding
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/s10559-005-0069-9openalex-snapshot
Asymmetric Code-Theoretical Schemes Constructed with the Use of Algebraic Geometric Codes
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.1049/el.2009.0940openalex-snapshot
Soft decoding of algebraic–geometric codes using Koetter-Vardy algorithm
inferred← citeshttps://doi.org/10.1049/el:20045392openalex-snapshot
Design of algebraic-geometric codes over fading channels
inferred← citeshttps://doi.org/10.1049/el:20061999openalex-snapshot
List decoding performance of algebraic geometric codes
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.1049/ip-com:20045153openalex-snapshot
Construction and performance of algebraic–geometric codes over AWGN and fading channels
inferred← citeshttps://doi.org/10.1049/ip-com:20050241openalex-snapshot
Performance of Hermitian codes using combined error and erasure decoding
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.476320openalex-snapshot
A code decomposition approach for decoding cyclic and algebraic-geometric codes
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.705564openalex-snapshot
Subspace subcodes of Reed-Solomon codes
inferred← citeshttps://doi.org/10.1109/18.705565openalex-snapshot
Determination of error values for algebraic-geometry codes and the Forney formula
inferred← citeshttps://doi.org/10.1109/18.720549openalex-snapshot
The art of signaling: fifty years of coding theory
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/apccas.1998.743827openalex-snapshot
Algebraic geometry code decoding based on Chinese remainder theorem
inferred← citeshttps://doi.org/10.1109/comcas.2009.5386010openalex-snapshot
Performance comparison between Hermitian codes and shortened non-binary BCH codes
inferred← citeshttps://doi.org/10.1109/gcwkshps58843.2023.10464872openalex-snapshot
Low-Complexity Chase Decoding of Hermitian Codes with Re-encoding Transform and Fast Factorization
inferred← citeshttps://doi.org/10.1109/icccc.2016.7496747openalex-snapshot
McEliece's public key cryptosystem based on non-binary algebraic codes
inferred← citeshttps://doi.org/10.1109/icccworkshops55477.2022.9896651openalex-snapshot
Parameters and Decoding Performance of Subfield Subcodes of One-Point Elliptic Codes
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.2011.6033681openalex-snapshot
Solving the key equation for Hermitian codes with a division algorithm
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/isit54713.2023.10206531openalex-snapshot
Systematic Encoding of Elliptic Codes with Dynamic Information Sets
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654087openalex-snapshot
Progressive Algebraic Soft Decoding of Hermitian Codes
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195257openalex-snapshot
Algebraic Soft Decoding of Hermitian Codes with Re-Encoding Transform
inferred← citeshttps://doi.org/10.1109/itw.1998.706395openalex-snapshot
Using Grobner bases in decoding AG codes
inferred← citeshttps://doi.org/10.1109/itw.2012.6404687openalex-snapshot
Iterative soft-decision decoding of Hermitian codes
inferred← citeshttps://doi.org/10.1109/itw.2016.7606867openalex-snapshot
Low-complexity Chase decoding of algebraic-geometric codes using Koetter's interpolation
inferred← citeshttps://doi.org/10.1109/itw44776.2019.8989286openalex-snapshot
Design of Guruswami-Sudan List Decoding for Elliptic Codes
inferred← citeshttps://doi.org/10.1109/milcom.2001.986071openalex-snapshot
Frequency-hop spread-spectrum packet radio with Hermitian codes
inferred← citeshttps://doi.org/10.1109/t-wc.2008.070615openalex-snapshot
Reduced Complexity Interpolation for List Decoding Hermitian Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2009.08.070302openalex-snapshot
Soft-decision list decoding of hermitian codes
inferred← citeshttps://doi.org/10.1109/tcomm.2012.100512.110871openalex-snapshot
Iterative Soft-Decision Decoding of Hermitian Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2357026openalex-snapshot
Iterative Detection-Decoding of Interleaved Hermitian Codes for High Density Storage Devices
inferred← citeshttps://doi.org/10.1109/tcomm.2017.2786667openalex-snapshot
Interpolation-Based Low-Complexity Chase Decoding Algorithms for Hermitian Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3146278openalex-snapshot
Algebraic Soft Decoding of Elliptic Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3524035openalex-snapshot
Low-Complexity Chase Decoding of Hermitian Codes With Improved Interpolation and Root-Finding
inferred← citeshttps://doi.org/10.1109/tcomm.2025.3566988openalex-snapshot
Low-Complexity Chase Decoding of Elliptic Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2054670openalex-snapshot
Minimum Distance Decoding of General Algebraic Geometry Codes via Lists
inferred← citeshttps://doi.org/10.1109/tit.2019.2930538openalex-snapshot
Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound
inferred← citeshttps://doi.org/10.1109/tit.2021.3109447openalex-snapshot
Guruswami-Sudan Decoding of Elliptic Codes Through Module Basis Reduction
inferred← citeshttps://doi.org/10.1109/tit.2026.3678324openalex-snapshot
Low-Complexity Algebraic Soft Decoding of Hermitian Codes With Re-Encoding Transform
inferred← citeshttps://doi.org/10.1109/twc.2003.811183openalex-snapshot
Hermitian codes for frequency-hop spread-spectrum packet radio networks
inferred← citeshttps://doi.org/10.1109/ukrmico43733.2018.9047556openalex-snapshot
Analysis and Investigation of Properties of Algebraic Geometric 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.1145/301250.301311openalex-snapshot
A displacement approach to efficient decoding of algebraic-geometric codes
inferred← citeshttps://doi.org/10.1360/ssm-2021-0013openalex-snapshot
Ten key ICT challenges in the post-Shannon era
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.14232/actacyb.285453openalex-snapshot
Estimating the Dimension of the Subfield Subcodes of Hermitian Codes
inferred← citeshttps://doi.org/10.14232/phd.10475openalex-snapshot
On the dimension of the subfield subcodes of Hermitian codes
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/essfr.1.3_44openalex-snapshot
Algebraic Coding Theory
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.18725/oparu-3912openalex-snapshot
Decoding Hermitian codes - an engineering approach
inferred← citeshttps://doi.org/10.21236/ada393087openalex-snapshot
Frequency-Hop Spread-Spectrum Packet Radio with Hermitian Codes
inferred← citeshttps://doi.org/10.24382/1976openalex-snapshot
Algebraic Codes For Error Correction In Digital Communication Systems
inferred← citeshttps://doi.org/10.30837/rt.2018.4.195.08openalex-snapshot
Analysis and investigation of algebraic geometric codes properties
inferred← citeshttps://doi.org/10.3934/amc.2012.6.419openalex-snapshot
Syndrome decoding for Hermite codes with a Sugiyama-type algorithm
inferred← citeshttps://doi.org/10.47839/ijc.18.4.1610openalex-snapshot
NOISE IMMUNITY OF THE ALGEBRAIC GEOMETRIC CODES
inferred← citeshttps://doi.org/10.5802/ccirm.8openalex-snapshot
Les codes algébriques principaux et leur décodage
inferred← citeshttps://doi.org/10.70675/17b64e9dz8e46z4befzb63fz93eccc4f45b4openalex-snapshot
On the security of short McEliece keys from algebraic andalgebraic geometry codes with automorphisms
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.