On the public citation graph

New bounds on cyclic codes from algebraic curves

0 signed · 71 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-1-4613-1983-2openalex-snapshot
Finite Fields for Computer Scientists and Engineers
inferredcites →https://doi.org/10.1007/978-1-4757-3849-0openalex-snapshot
Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-94-010-1826-5_9openalex-snapshot
Irreducible Cyclic Codes and Gauss Sums
inferredcites →https://doi.org/10.1007/bf01228261openalex-snapshot
�ber die Automorphismengruppe eines algebraischen Funktionenk�rpers von Primzahlcharakteristik
inferredcites →https://doi.org/10.1007/bfb0019847openalex-snapshot
Exponential sums and the Carlitz-Uchiyama bound
inferredcites →https://doi.org/10.1016/0012-365x(75)90017-5openalex-snapshot
Codes projectifs a deux ou trois poids associfs aux hyperquadriques d'une geometrie finie
inferredcites →https://doi.org/10.1016/0012-365x(89)90145-3openalex-snapshot
The weights of the dual code of the MELAS code over GF(3)
inferredcites →https://doi.org/10.1016/s0019-9958(72)90354-3openalex-snapshot
Weights of irreducible cyclic codes
inferredcites →https://doi.org/10.1016/s0019-9958(77)80009-0openalex-snapshot
Weights of cyclic codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.21268openalex-snapshot
A duality theorem for the weight distribution of some cyclic codes
inferredcites →https://doi.org/10.1137/1016056openalex-snapshot
Coding and Combinatorics
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.

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.1996.0012openalex-snapshot
Weight Behavior of Irreducible Cyclic BWD-Codes
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4openalex-snapshot
Topics in Geometry, Coding Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4_3openalex-snapshot
ARTIN-SCHREIER EXTENSIONS AND THEIR APPLICATIONS
inferred← citeshttps://doi.org/10.1007/3-540-56686-4_46openalex-snapshot
Exponential sums as discrete fourier transform with invariant phase functions
inferred← citeshttps://doi.org/10.1007/978-3-642-25516-8_6openalex-snapshot
On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}
inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_29openalex-snapshot
Comparison of Techniques on Divisibility Properties of Exponential Sums and Applications
inferred← citeshttps://doi.org/10.1007/978-3-7091-2786-5_10openalex-snapshot
Weights of Primitive Binary Cyclic Codes from Non-Primitive Codes
inferred← citeshttps://doi.org/10.1007/978-3-7091-2786-5_12openalex-snapshot
Bound for Trace-Equation and Application to Coding Theory
inferred← citeshttps://doi.org/10.1007/bf00123957openalex-snapshot
Covering radius and dual distance
inferred← citeshttps://doi.org/10.1007/bf00124594openalex-snapshot
Stickelberger Codes
inferred← citeshttps://doi.org/10.1007/bf01195336openalex-snapshot
Bounds on the minimum distance of the duals of extended BCH codes over $$\mathbb{F}_p $$
inferred← citeshttps://doi.org/10.1007/bf01235721openalex-snapshot
Linear Codes with Balanced Weight Distribution
inferred← citeshttps://doi.org/10.1007/bf01418531openalex-snapshot
Cross-correlations of geometric sequences in characteristic two
inferred← citeshttps://doi.org/10.1007/bf01438279openalex-snapshot
Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables
inferred← citeshttps://doi.org/10.1007/bf01810572openalex-snapshot
Polynomial description of binary linear codes and related properties
inferred← citeshttps://doi.org/10.1007/bf02570836openalex-snapshot
Trace codes and families of algebraic curves
inferred← citeshttps://doi.org/10.1007/bfb0019841openalex-snapshot
Coding Theory and Applications
inferred← citeshttps://doi.org/10.1007/bfb0088002openalex-snapshot
On the weights of trace codes
inferred← citeshttps://doi.org/10.1007/s10623-005-3394-0openalex-snapshot
Improvements on Generalized Hamming Weights of Some Trace Codes
inferred← citeshttps://doi.org/10.1007/s10623-015-0081-7openalex-snapshot
Switchings of semifield multiplications
inferred← citeshttps://doi.org/10.1007/s10623-015-0170-7openalex-snapshot
Index bounds for character sums of polynomials over finite fields
inferred← citeshttps://doi.org/10.1007/s10623-016-0198-3openalex-snapshot
Hasse–Weil bound for additive cyclic codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01464-0openalex-snapshot
New distance bounds for quasi-cyclic codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01532-5openalex-snapshot
A construction of optimal quasi-cyclic locally recoverable codes using constituent codes
inferred← citeshttps://doi.org/10.1007/s40314-026-03635-2openalex-snapshot
PIR Schemes from nD-Cyclic and nD-Constacyclic Codes and Their Monomial Equivalence
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90040-mopenalex-snapshot
Artin-Schreier curves, exponential sums, and coding theory
inferred← citeshttps://doi.org/10.1016/j.aim.2017.01.011openalex-snapshot
An improvement to the Hasse–Weil bound and applications to character sums, cryptography and coding
inferred← citeshttps://doi.org/10.1016/j.cam.2012.12.017openalex-snapshot
Supersingular curves over finite fields and weight divisibility of codes
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.035openalex-snapshot
Weight enumerators of reducible cyclic codes and their dual codes
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.2011.07.004openalex-snapshot
A relation between quasi-cyclic codes and 2-D cyclic codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.06.004openalex-snapshot
A minimum distance bound for quasi-nD-cyclic codes
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80076-5openalex-snapshot
Diameter, Covering Index, Covering Radius and Eigenvalues
inferred← citeshttps://doi.org/10.1023/a:1005794417363openalex-snapshot
Exponential Sums and Coding Theory: A Review
inferred← citeshttps://doi.org/10.1070/rm1991v046n01abeh002725openalex-snapshot
On some problems in the theory of finite fields
inferred← citeshttps://doi.org/10.1109/18.135637openalex-snapshot
Cyclic concatenated codes with constacyclic outer codes
inferred← citeshttps://doi.org/10.1109/18.259637openalex-snapshot
Minimum distance bounds for cyclic codes and Deligne's theorem
inferred← citeshttps://doi.org/10.1109/18.312185openalex-snapshot
Generalized Hamming weights of trace codes
inferred← citeshttps://doi.org/10.1109/18.370143openalex-snapshot
d-form sequences: families of sequences with low correlation values and large linear spans
inferred← citeshttps://doi.org/10.1109/18.508853openalex-snapshot
Bounds on the minimum distance of the duals of BCH codes
inferred← citeshttps://doi.org/10.1109/18.669413openalex-snapshot
An improved Serre bound for elementary Abelian extensions of F/sub q/(x) and the generalized Hamming weights of duals of BCH codes
inferred← citeshttps://doi.org/10.1109/bsc.2006.1644571openalex-snapshot
A Lower Bound on the Minimum Distance of a 1-Generator Quasi-Cyclic Code
inferred← citeshttps://doi.org/10.1109/cwit.2007.375724openalex-snapshot
A Minimum Distance Bound for 1-Generator Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.1109/isit.1994.394928openalex-snapshot
Bounds on the minimum distance of the duals of BCH codes
inferred← citeshttps://doi.org/10.1109/tit.2008.2006436openalex-snapshot
Weil-Serre Type Bounds for Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2021.3069772openalex-snapshot
Geometric Approach to b -Symbol Hamming Weights of Cyclic Codes
inferred← citeshttps://doi.org/10.1137/16m1065604openalex-snapshot
Quasi-Cyclic Subcodes of Cyclic Codes
inferred← citeshttps://doi.org/10.1142/s0219749909004979openalex-snapshot
QUANTUM DUADIC AND AFFINE-INVARIANT CODES
inferred← citeshttps://doi.org/10.1201/9781315371993-25openalex-snapshot
AG codes, Weierstraß points and universal hashing
inferred← citeshttps://doi.org/10.22215/etd/2013-10033openalex-snapshot
Interleaved Sequences Over Finite Fields
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.756-759.2588openalex-snapshot
Generalized Hamming Weights of Cyclic Codes from Algebraic Function Fields
inferred← citeshttps://doi.org/10.4064/aa105-2-5openalex-snapshot
Poids des duaux des codes BCH de distance prescrite pa0et sommes exponentielles
inferred← citeshttps://doi.org/10.48550/arxiv.0711.2050openalex-snapshot
Two Families of Quantum Codes Derived from Cyclic Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1309.1623openalex-snapshot
Quasi-Cyclic Codes Over Finite Chain Rings
inferred← citeshttps://doi.org/10.48550/arxiv.1505.01700openalex-snapshot
An Improvement on the Hasse-Weil Bound and applications to Character Sums, Cryptography and Coding
inferred← citeshttps://doi.org/10.48550/arxiv.1507.00988openalex-snapshot
Index bounds for character sums with polynomials over finite fields
inferred← citeshttps://doi.org/10.48550/arxiv.2105.04370openalex-snapshot
An improvement of the Hasse-Weil bound for Artin-Schreier curves via cyclotomic function fields
inferred← citeshttps://doi.org/10.70675/30e2ea2cz3cc5z4819zb918zf8338041000dopenalex-snapshot
Codes with locality : constructions and applications to cryptographic protocols
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.