On the public citation graph

Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables

0 signed · 36 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/3-540-56686-4_48openalex-snapshot
An elementary proof of a partial improvement to the Ax-Katz Theorem
inferredcites →https://doi.org/10.1007/bf01223730openalex-snapshot
Divisible codes
inferredcites →https://doi.org/10.1007/bf02684373openalex-snapshot
La conjecture de Weil : I
inferredcites →https://doi.org/10.1007/bfb0019846openalex-snapshot
New bounds on cyclic codes from algebraic curves
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/0022-314x(92)90106-yopenalex-snapshot
An improved Bombieri-Weil bound and applications to coding theory
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.1073/pnas.34.5.204openalex-snapshot
On Some Exponential Sums
inferredcites →https://doi.org/10.1090/s0002-9939-1991-1028291-1openalex-snapshot
Exponential Sums and Goppa Codes: I
inferredcites →https://doi.org/10.1109/18.108271openalex-snapshot
A bound for divisible codes
inferredcites →https://doi.org/10.1109/18.144703openalex-snapshot
Exponential sums and Goppa codes. II
inferredcites →https://doi.org/10.1109/18.259637openalex-snapshot
Minimum distance bounds for cyclic codes and Deligne's theorem
inferredcites →https://doi.org/10.1109/18.340464openalex-snapshot
The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes
inferredcites →https://doi.org/10.1109/18.79916openalex-snapshot
Prime-phase sequences with periodic correlation properties better than binary sequences
inferredcites →https://doi.org/10.1109/isit.1991.695093openalex-snapshot
Minimum Distance Bounds For Cyclic Codes And Deligne's Theorem
inferredcites →https://doi.org/10.1137/0109055openalex-snapshot
A New Treatment of Bose-Chaudhuri Codes
inferredcites →https://doi.org/10.1137/0116016openalex-snapshot
A New Class of Cyclic Codes
inferredcites →https://doi.org/10.1215/s0012-7094-57-02406-7openalex-snapshot
Bounds for exponential sums
inferredcites →https://doi.org/10.2307/2373048openalex-snapshot
On Exponential Sums in Finite Fields
inferredcites →https://doi.org/10.2307/2375042openalex-snapshot
Improvements of the Chevalley-Warning and the Ax-Katz Theorems
inferredcites →https://doi.org/10.24033/asens.1543openalex-snapshot
$p$-adic estimates for exponential sums and the theorem of Chevalley-Warning

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.1997.0193openalex-snapshot
Ap-Adic Serre Bound
inferred← citeshttps://doi.org/10.1007/3-540-56686-4_48openalex-snapshot
An elementary proof of a partial improvement to the Ax-Katz Theorem
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_5openalex-snapshot
On Duals of Binary Primitive BCH Codes
inferred← citeshttps://doi.org/10.1007/s002000050061openalex-snapshot
Covering Radius 1985-1994
inferred← citeshttps://doi.org/10.1016/s0924-6509(13)70005-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0924-6509(97)80023-2openalex-snapshot
Complexity
inferred← citeshttps://doi.org/10.1016/s1071-5797(02)00016-3openalex-snapshot
Weight of duals of BCH codes and exponential sums
inferred← citeshttps://doi.org/10.1023/a:1005794417363openalex-snapshot
Exponential Sums and Coding Theory: A Review
inferred← citeshttps://doi.org/10.1109/18.340464openalex-snapshot
The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes
inferred← citeshttps://doi.org/10.1109/18.382026openalex-snapshot
On spectra of BCH codes
inferred← citeshttps://doi.org/10.1109/18.746798openalex-snapshot
On the distance distribution of duals of BCH codes
inferred← citeshttps://doi.org/10.1109/isit.1998.709040openalex-snapshot
On the distance distribution of duals of BCH codes
inferred← citeshttps://doi.org/10.24033/bsmf.2418openalex-snapshot
Poids des duaux des codes BCH de distance prescrite $2^a+1$ et sommes exponentielles
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.