On the public citation graph

Character sum constructions of constrained error-correcting codes

0 signed · 17 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/bfb0034336openalex-snapshot
Exponential sums and constrained error-correcting codes
inferredcites →https://doi.org/10.1007/bfb0080437openalex-snapshot
Equations over Finite Fields An Elementary Approach
inferredcites →https://doi.org/10.1007/bfb0082026openalex-snapshot
Incomplete sums and two applications of Deligne's result
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.79949openalex-snapshot
DC-constrained codes from Hadamard matrices
inferredcites →https://doi.org/10.1109/tit.1984.1056930openalex-snapshot
An upper bound on the aperiodic autocorrelation function for a maximal-length sequence (Corresp.)
inferredcites →https://doi.org/10.1109/tmag.1985.1063972openalex-snapshot
Recording codes for digital magnetic storage

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-46665-7_1openalex-snapshot
Applications of Exponential Sums in Communications Theory
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_3openalex-snapshot
A Method to Estimate Partial-Period Correlations
inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_35openalex-snapshot
Incomplete Additive Character Sums and Applications
inferred← citeshttps://doi.org/10.1007/s002000050050openalex-snapshot
Fractal digital sums and codes
inferred← citeshttps://doi.org/10.1109/18.412698openalex-snapshot
On the odd and the aperiodic correlation properties of the Kasami sequences
inferred← citeshttps://doi.org/10.1109/18.481796openalex-snapshot
Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences
inferred← citeshttps://doi.org/10.1109/18.623155openalex-snapshot
On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences
inferred← citeshttps://doi.org/10.1109/18.669265openalex-snapshot
Bounds on partial correlations of sequences
inferred← citeshttps://doi.org/10.1109/isit.1995.531296openalex-snapshot
An upper bound for the aperiodic correlation of weighted-degree CDMA sequences
inferred← citeshttps://doi.org/10.1109/isssta.1996.563741openalex-snapshot
On sequence design for CDMA
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.