On the public citation graph
Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
0 signed · 97 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.1007/3-540-56686-4_51openalex-snapshot
On hyperbolic cascaded Reed-Solomon codes
inferredcites →https://doi.org/10.1007/978-1-4613-8994-1openalex-snapshot
Coding Theory and Design Theory
inferredcites →https://doi.org/10.1007/978-1-4613-8994-1_12openalex-snapshot
Algebraic Geometric Codes
inferredcites →https://doi.org/10.1007/978-1-4757-2181-2openalex-snapshot
Ideals, Varieties, and Algorithms
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-94-009-5225-6_6openalex-snapshot
Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory
inferredcites →https://doi.org/10.1016/0001-8708(76)90212-7openalex-snapshot
Basic algebraic geometry
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/s0019-9958(77)90232-7openalex-snapshot
A theory of two-dimensional cyclic codes
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.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/cbo9780511608766openalex-snapshot
Algebraic Curves over Finite Fields
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.86974openalex-snapshot
Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.5860/choice.30-5053aopenalex-snapshot
Algebraic geometry: a first course
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6440(199911)82:11<18::aid-ecjc3>3.0.co;2-gopenalex-snapshot
On generalized hyperbolic cascaded Reed-Solomon codes
inferred← citeshttps://doi.org/10.1002/(sici)1520-6440(200011)83:11<85::aid-ecjc9>3.0.co;2-4openalex-snapshot
The optimality of Feng-Rao designed minimum distance for Hermitian codes constructed by weight order based on pole order
inferred← citeshttps://doi.org/10.1006/ffta.2001.0347openalex-snapshot
On the Structure of Order Domains
inferred← citeshttps://doi.org/10.1006/inco.2001.2965openalex-snapshot
Finding Recursions for Multidimensional Arrays
inferred← citeshttps://doi.org/10.1006/jsco.2000.0372openalex-snapshot
Finding a Basis of a Linear System with Pairwise Distinct Discrete Valuations on an Algebraic Curve
inferred← citeshttps://doi.org/10.1007/3-540-44828-4_14openalex-snapshot
Good Expander Graphs and Expander Codes: Parameters and Decoding
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_27openalex-snapshot
Computing a Basis of $$ \mathcal{L}(D) $$ on an affine algebraic curve with one rational place at infinit
inferred← citeshttps://doi.org/10.1007/978-3-030-26831-2_24openalex-snapshot
On Berlekamp–Massey and Berlekamp–Massey–Sakata Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-68869-1_7openalex-snapshot
Decoding up to 4 Errors in Hyperbolic-Like Abelian Codes by the Sakata Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-27998-5_24openalex-snapshot
A Memory Efficient Variant of an Implementation of the F $$_4$$ Algorithm for Computing Gröbner Bases
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/978-3-662-64331-0_15openalex-snapshot
Fraud and Data Availability Proofs: Detecting Invalid Blocks in Light Clients
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/s00200-023-00595-6openalex-snapshot
Two dimensional double cyclic codes over finite fields
inferred← citeshttps://doi.org/10.1007/s11045-010-0139-7openalex-snapshot
Algebraic decoder of multidimensional convolutional code: constructive algorithms for determining syndrome decoder and decoder matrix based on Gröbner basis
inferred← citeshttps://doi.org/10.1016/j.ffa.2003.10.002openalex-snapshot
Artin–Schreier curves and weights of two-dimensional cyclic codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.12.003openalex-snapshot
Multidimensional cyclic codes and Artin–Schreier type hypersurfaces over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.07.004openalex-snapshot
A relation between quasi-cyclic codes and 2-D cyclic codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2013.08.001openalex-snapshot
2-D skew-cyclic codes over Fq[x,y;ρ,θ]
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.07.005openalex-snapshot
Quasi-cyclic complementary dual codes
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.03.001openalex-snapshot
Generalization of the Lee–OʼSullivan list decoding for one-point 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.jsc.2016.11.005openalex-snapshot
Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
inferred← citeshttps://doi.org/10.1016/s1071-5797(03)00038-8openalex-snapshot
Integral closures and weight functions over finite fields
inferred← citeshttps://doi.org/10.1023/a:1008274212057openalex-snapshot
Decoding Affine Variety Codes Using Gröbner Bases
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.1090/conm/376/06948openalex-snapshot
Recent results on ring constructions for error-correcting codes
inferred← citeshttps://doi.org/10.1090/conm/779/15669openalex-snapshot
On the constant 𝐷(𝑞) defined by Homma
inferred← citeshttps://doi.org/10.1109/12.780877openalex-snapshot
A systolic array implementation of the Feng-Rao algorithm
inferred← citeshttps://doi.org/10.1109/18.476214openalex-snapshot
On the decoding of algebraic-geometric codes
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.681332openalex-snapshot
Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
inferred← citeshttps://doi.org/10.1109/18.746805openalex-snapshot
Efficient Forney functions for decoding AG codes
inferred← citeshttps://doi.org/10.1109/18.817522openalex-snapshot
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
inferred← citeshttps://doi.org/10.1109/18.945271openalex-snapshot
Finding the defining functions for one-point algebraic-geometry 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/ieecon.2014.6925869openalex-snapshot
Decoding matrix for two dimensional convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.1994.394816openalex-snapshot
Decoding algebraic-geometric codes using Grobner bases
inferred← citeshttps://doi.org/10.1109/isit.1997.613316openalex-snapshot
A fast parallel implementation of Feng-Rao algorithm with systolic array structure
inferred← citeshttps://doi.org/10.1109/isit.1998.708635openalex-snapshot
Multidimensional extension of Reed-Solomon codes
inferred← citeshttps://doi.org/10.1109/isit.2002.1023331openalex-snapshot
Integral closures and weight functions over finite fields
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.2012.6284685openalex-snapshot
List decoding algorithms based on Gröbner bases for general one-point AG codes
inferred← citeshttps://doi.org/10.1109/ita.2018.8502956openalex-snapshot
Two Dimensional Algebraic Error Correcting Codes
inferred← citeshttps://doi.org/10.1109/itw55543.2023.10161663openalex-snapshot
Hyperbolic Sets in Incomplete Tables
inferred← citeshttps://doi.org/10.1109/itwf.2015.7360746openalex-snapshot
Two dimensional error-correcting codes using finite field Fourier transform
inferred← citeshttps://doi.org/10.1109/tcomm.2003.822740openalex-snapshot
Architectures for Syndrome Generation and Error-Location Search in the Decoding of Hermitian Codes
inferred← citeshttps://doi.org/10.1109/tcsi.2007.914007openalex-snapshot
A Tutorial on GrÖbner Bases With Applications in Signals and Systems
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.2016.2616467openalex-snapshot
Multidimensional Quasi-Cyclic and Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.3027751openalex-snapshot
A New Approach to the Berlekamp-Massey-Sakata Algorithm: Improving Locator Decoding
inferred← citeshttps://doi.org/10.1145/1993886.1993908openalex-snapshot
Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
inferred← citeshttps://doi.org/10.1145/2755996.2756673openalex-snapshot
Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences
inferred← citeshttps://doi.org/10.1145/2930889.2930926openalex-snapshot
Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra
inferred← citeshttps://doi.org/10.1145/3087604.3087632openalex-snapshot
Fast Algorithm for Border Bases of Artinian Gorenstein Algebras
inferred← citeshttps://doi.org/10.1587/essfr.8.151openalex-snapshot
Algebraic Methods in Coding Theory
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.22124/jart.2017.2713openalex-snapshot
Algebraic adjoint of the polynomials-polynomial matrix multiplication
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.1505.02238openalex-snapshot
2-D Skew Constacyclic Codes Over $R[x,y,ρ,θ]$
inferred← citeshttps://doi.org/10.48550/arxiv.1507.01350openalex-snapshot
Two-dimensional Burst Error Correcting Code using Finite Field Fourier Transforms
inferred← citeshttps://doi.org/10.48550/arxiv.1809.09044openalex-snapshot
Fraud and Data Availability Proofs: Maximising Light Client Security and Scaling Blockchains with Dishonest Majorities
inferred← citeshttps://doi.org/10.48550/arxiv.1906.01428openalex-snapshot
A Dynamical System-based Key Equation for Decoding One-Point Algebraic-Geometry Codes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0303299openalex-snapshot
A key equation and the computation of error values for codes from order domains
inferred← citeshttps://doi.org/10.51286/albjm/1300195228openalex-snapshot
GENUS CALCULATIONS FOR TOWERS OF FUNCTION FIELDS ARISING FROM EQUATIONS OF Cab CURVES
inferred← citeshttps://doi.org/10.5802/ccirm.8openalex-snapshot
Les codes algébriques principaux et leur décodage
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.