On the public citation graph

A limit law on the distance distribution of binary codes

0 signed · 30 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.1109/proc.1980.11608openalex-snapshot
The theory of error-correcting codes
inferredcites →https://doi.org/10.1109/proc.1980.11697openalex-snapshot
Crosscorrelation properties of pseudorandom and related sequences
inferredcites →https://doi.org/10.1109/tit.1985.1057107openalex-snapshot
An approximation to the weight distribution of binary linear codes
inferredcites →https://doi.org/10.1142/9789811268571_0003openalex-snapshot
Differential and integral calculus

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jath.2001.3570openalex-snapshot
Nonnegative Quadratic Forms and Bounds on Orthogonal Polynomials
inferred← citeshttps://doi.org/10.1007/11617983_28openalex-snapshot
Long Extended BCH Codes Are Spanned by Minimum Weight Words
inferred← citeshttps://doi.org/10.1007/3-540-60114-7_9openalex-snapshot
Which families of long binary linear codes have a binomial weight distribution?
inferred← citeshttps://doi.org/10.1007/bf02997781openalex-snapshot
On the relation between distance distributions of binary block codes and the binomial distribution
inferred← citeshttps://doi.org/10.1007/bf03253309openalex-snapshot
Une nouvelle identité relative à l’énumérateur de poids des codes binaires linéaires en blocs
inferred← citeshttps://doi.org/10.1007/s00493-002-0003-yopenalex-snapshot
Linear Codes and Character Sums
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90020-xopenalex-snapshot
The second eigenvalue of regular graphs of given girth
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80076-5openalex-snapshot
Diameter, Covering Index, Covering Radius and Eigenvalues
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.1023/a:1008206125050openalex-snapshot
Bounds on Spectra of Codes with Known Dual Distance
inferred← citeshttps://doi.org/10.1023/a:1011220817609openalex-snapshot
On the Distance Distributions of BCH Codes and Their Duals
inferred← citeshttps://doi.org/10.1109/18.144721openalex-snapshot
On computing the weight spectrum of cyclic codes
inferred← citeshttps://doi.org/10.1109/18.382026openalex-snapshot
On spectra of BCH codes
inferred← citeshttps://doi.org/10.1109/18.412690openalex-snapshot
On the accuracy of the binomial approximation to the distance distribution of codes
inferred← citeshttps://doi.org/10.1109/18.568707openalex-snapshot
Estimates for the range of binomiality in codes' spectra
inferred← citeshttps://doi.org/10.1109/18.651049openalex-snapshot
Spectra of long primitive binary BCH codes cannot approach the binomial distribution
inferred← citeshttps://doi.org/10.1109/18.746800openalex-snapshot
More on the distance distribution of BCH codes
inferred← citeshttps://doi.org/10.1109/18.904542openalex-snapshot
Bounds for the weight distribution of weakly self-dual codes
inferred← citeshttps://doi.org/10.1109/eeis.1995.514178openalex-snapshot
On spectra of BCH codes
inferred← citeshttps://doi.org/10.1109/isit.1991.695107openalex-snapshot
On Computing The Weight Spectrum Of Cyclic Codes
inferred← citeshttps://doi.org/10.1109/isit.2004.1365425openalex-snapshot
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design
inferred← citeshttps://doi.org/10.1109/isit.2015.7282791openalex-snapshot
Weight Distribution of Cosets of Small Codes With Good Dual Properties
inferred← citeshttps://doi.org/10.1109/tit.2005.864433openalex-snapshot
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design
inferred← citeshttps://doi.org/10.48550/arxiv.1806.02099openalex-snapshot
Binary linear code weight distribution estimation by random bit stream compression
inferred← citeshttps://doi.org/10.48550/arxiv.math/0104016openalex-snapshot
Bounds for weight distribution of weakly self-dual 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.