On the public citation graph

New Extension of the Weil Bound for Character Sums with Applications to Coding

0 signed · 37 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-3-642-03685-9_40openalex-snapshot
Succinct Representation of Codes with Applications to Testing
inferredcites →https://doi.org/10.1007/978-3-642-16367-8_25openalex-snapshot
Symmetric LDPC Codes and Local Testing
inferredcites →https://doi.org/10.1007/bfb0091523openalex-snapshot
Applications de la formule des traces aux sommes trigonométrigues
inferredcites →https://doi.org/10.1007/s00037-009-0273-5openalex-snapshot
The Sum of D Small-Bias Generators Fools Polynomials of Degree D
inferredcites →https://doi.org/10.1007/s00493-008-2259-3openalex-snapshot
Deterministic extractors for affine sources over large fields
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1090/s0894-0347-05-00476-5openalex-snapshot
Mordell’s exponential sum estimate revisited
inferredcites →https://doi.org/10.1109/focs.2007.42openalex-snapshot
Pseudorandom Bits for Polynomials
inferredcites →https://doi.org/10.1109/focs.2007.56openalex-snapshot
Spectral Graph Theory and its Applications
inferredcites →https://doi.org/10.1109/focs.2007.65openalex-snapshot
On the Advantage over Random for Maximum Acyclic Subgraph
inferredcites →https://doi.org/10.1109/focs.2007.8openalex-snapshot
Sparse Random Linear Codes are Locally Decodable and Testable
inferredcites →https://doi.org/10.1109/sfcs.2005.16openalex-snapshot
Almost Orthogonal Linear Codes are Locally Testable
inferredcites →https://doi.org/10.1109/tit.2012.2184841openalex-snapshot
Weight Distribution and List-Decoding Size of Reed–Muller Codes
inferredcites →https://doi.org/10.1137/100811945openalex-snapshot
Local List-Decoding and Testing of Random Linear Codes from High Error
inferredcites →https://doi.org/10.1145/1374376.1374434openalex-snapshot
Algebraic property testing
inferredcites →https://doi.org/10.1145/1374376.1374455openalex-snapshot
Unconditional pseudorandom generators for low degree polynomials
inferredcites →https://doi.org/10.1215/s0012-7094-57-02406-7openalex-snapshot
Bounds for exponential sums
inferredcites →https://doi.org/10.4086/toc.2009.v005a003openalex-snapshot
inferredcites →https://doi.org/10.48550/arxiv.0811.2356openalex-snapshot
The List-Decoding Size of Reed-Muller Codes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20637openalex-snapshot
A combinatorial characterization of smooth LTCs and applications
inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_4openalex-snapshot
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_39openalex-snapshot
Tight Lower Bounds for Testing Linear Isomorphism
inferred← citeshttps://doi.org/10.1007/s00037-012-0055-3openalex-snapshot
2-Transitivity is Insufficient for Local Testability
inferred← citeshttps://doi.org/10.1007/s00037-015-0115-6openalex-snapshot
Sparse affine-invariant linear codes are locally testable
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.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.1109/ccc.2011.14openalex-snapshot
Symmetric LDPC Codes are not Necessarily Locally Testable
inferred← citeshttps://doi.org/10.1109/focs.2012.38openalex-snapshot
Sparse Affine-Invariant Linear Codes Are Locally Testable
inferred← citeshttps://doi.org/10.1109/focs.2013.43openalex-snapshot
Strong LTCs with Inverse Poly-Log Rate and Constant Soundness
inferred← citeshttps://doi.org/10.1109/icmse.2011.6070099openalex-snapshot
Reseach of security risk identification based on rough set theory for highway subgrade stability in the slope of reservoir
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206937openalex-snapshot
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
inferred← citeshttps://doi.org/10.1109/tit.2011.2167739openalex-snapshot
Explicit Low-Weight Bases for BCH Codes
inferred← citeshttps://doi.org/10.1109/tit.2024.3449041openalex-snapshot
Repairing Reed-Solomon Codes Over Prime Fields via Exponential Sums
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
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.