On the public citation graph

A code decomposition approach for decoding cyclic and algebraic-geometric codes

0 signed · 57 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.1002/9780470050118.ecse011openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1007/3-540-51083-4_50openalex-snapshot
Decoding of generalized concatenated codes
inferredcites →https://doi.org/10.1007/978-1-4613-8994-1_12openalex-snapshot
Algebraic Geometric Codes
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-7091-2786-5_20openalex-snapshot
On the Efficient Decoding of Algebraic-Geometric Codes
inferredcites →https://doi.org/10.1007/978-94-011-3810-9openalex-snapshot
Algebraic-Geometric Codes
inferredcites →https://doi.org/10.1007/bf00147606openalex-snapshot
Asymptotically good families of subfield subcodes of geometric Goppa codes
inferredcites →https://doi.org/10.1007/bfb0087991openalex-snapshot
Goppa codes and Weierstrass gaps
inferredcites →https://doi.org/10.1007/bfb0087995openalex-snapshot
On the true minimum distance of Hermitian codes
inferredcites →https://doi.org/10.1016/0022-314x(91)90031-6openalex-snapshot
Artin-Schreier curves, exponential sums, and the Carlitz-Uchiyama bound for geometric codes
inferredcites →https://doi.org/10.1016/s0019-9958(75)90090-xopenalex-snapshot
A method for solving key equation for decoding goppa codes
inferredcites →https://doi.org/10.1080/00927878708823481openalex-snapshot
Funny plane curves in characteristic P > 0
inferredcites →https://doi.org/10.1090/conm/093/1003354openalex-snapshot
A remark on algebraic geometric codes
inferredcites →https://doi.org/10.1109/18.104340openalex-snapshot
Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
inferredcites →https://doi.org/10.1109/18.108255openalex-snapshot
Fast decoding of codes from algebraic plane curves
inferredcites →https://doi.org/10.1109/18.119709openalex-snapshot
On error-and-erasure decoding of cyclic codes
inferredcites →https://doi.org/10.1109/18.133246openalex-snapshot
A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
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.179365openalex-snapshot
A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
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.30981openalex-snapshot
A generalized Euclidean algorithm for multisequence shift-register synthesis
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.32173openalex-snapshot
A bounded-distance decoding algorithm for the Leech lattice, with generalizations
inferredcites →https://doi.org/10.1109/18.333854openalex-snapshot
A new procedure for decoding cyclic and BCH codes up to actual minimum distance
inferredcites →https://doi.org/10.1109/18.335964openalex-snapshot
Error-locating pairs for cyclic 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.335973openalex-snapshot
Simplified understanding and efficient decoding of a class of algebraic-geometric 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.476240openalex-snapshot
Fast decoding of algebraic-geometric codes up to the designed minimum distance
inferredcites →https://doi.org/10.1109/18.476242openalex-snapshot
Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring
inferredcites →https://doi.org/10.1109/18.476243openalex-snapshot
Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes
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.476246openalex-snapshot
Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
inferredcites →https://doi.org/10.1109/18.50376openalex-snapshot
On the dimension of subfield subcodes
inferredcites →https://doi.org/10.1109/18.57204openalex-snapshot
On the decoding of algebraic-geometric codes
inferredcites →https://doi.org/10.1109/18.57215openalex-snapshot
Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound
inferredcites →https://doi.org/10.1109/18.59945openalex-snapshot
On the decoding of algebraic-geometric codes over F/sub q/ for q
inferredcites →https://doi.org/10.1109/isit.1991.695148openalex-snapshot
On Error-and-erasure Decoding Of Cyclic Codes Up To The Roos Bound
inferredcites →https://doi.org/10.1109/tit.1965.1053825openalex-snapshot
On decoding BCH codes
inferredcites →https://doi.org/10.1109/tit.1966.1053873openalex-snapshot
Generalized minimum distance decoding
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.1109/tit.1972.1054893openalex-snapshot
Class of constructive asymptotically good algebraic codes
inferredcites →https://doi.org/10.1109/tit.1976.1055517openalex-snapshot
An erasures-and-errors decoding algorithm for Goppa codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1984.1056879openalex-snapshot
Modular curves and codes with a polynomial construction
inferredcites →https://doi.org/10.1147/rd.233.0299openalex-snapshot
Transform Techniques for Error Control Codes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-981-97-6934-6_65openalex-snapshot
An Efficient and Fast Hardware Implementation of Parallel BCH Decoder
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.03.020openalex-snapshot
A symmetric Roos bound for linear codes
inferred← citeshttps://doi.org/10.1016/s0378-3758(00)00260-3openalex-snapshot
On the existence of order functions
inferred← citeshttps://doi.org/10.1109/18.476214openalex-snapshot
On the decoding of algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/18.476243openalex-snapshot
Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/18.556690openalex-snapshot
A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient
inferred← citeshttps://doi.org/10.1109/18.568709openalex-snapshot
A construction of codes with exponential error bounds on arbitrary discrete memoryless channels
inferred← citeshttps://doi.org/10.1109/18.959290openalex-snapshot
An algebraic construction of codes for Slepian-Wolf source networks
inferred← citeshttps://doi.org/10.1109/tit.2018.2875546openalex-snapshot
Radical-Locator Polynomials and Row-Echelon Partial Syndrome Matrices With Applications to Decoding Cyclic Codes
inferred← citeshttps://doi.org/10.1515/9783110811056.155openalex-snapshot
The shift bound for cyclic, Reed-Muller and geometric Goppa codes
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.