On the public citation graph

On the accuracy of the binomial approximation to the distance distribution of codes

0 signed · 24 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-662-00174-5openalex-snapshot
Introduction to coding theory
inferredcites →https://doi.org/10.1016/0012-365x(95)00167-uopenalex-snapshot
Degree conditions for vertex switching reconstruction
inferredcites →https://doi.org/10.1016/c2013-0-02379-1openalex-snapshot
Orthogonal Polynomials
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.382026openalex-snapshot
On spectra of BCH codes
inferredcites →https://doi.org/10.1109/18.50398openalex-snapshot
A limit law on the distance distribution of binary codes
inferredcites →https://doi.org/10.1109/tit.1985.1057107openalex-snapshot
An approximation to the weight distribution of binary linear codes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4757-3585-7_7openalex-snapshot
Sloppy Alice attacks! Adaptive chosen ciphertext attacks on the McEliece Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-319-51103-0_1openalex-snapshot
Bounds on Error-Correction Coding Performance
inferred← citeshttps://doi.org/10.1007/978-3-319-51103-0_14openalex-snapshot
Erasures and Error-Correcting Codes
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.1016/s1571-0653(04)00152-0openalex-snapshot
Estimates of the Distance Distribution of Codes and Designs
inferred← citeshttps://doi.org/10.1023/a:1008206125050openalex-snapshot
Bounds on Spectra of Codes with Known Dual Distance
inferred← citeshttps://doi.org/10.1049/iet-com:20060393openalex-snapshot
Analysis of the distribution of the number of erasures correctable by a binary linear code and the link to low-weight codewords
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.904542openalex-snapshot
Bounds for the weight distribution of weakly self-dual codes
inferred← citeshttps://doi.org/10.1109/18.915662openalex-snapshot
Estimates of the distance distribution of codes and designs
inferred← citeshttps://doi.org/10.1109/isit.1995.550331openalex-snapshot
On the binomial approximation to the distance distribution of codes
inferred← citeshttps://doi.org/10.1109/isit.2001.935974openalex-snapshot
Estimates of the distance distribution of codes and designs
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/tcomm.2021.3096961openalex-snapshot
Primitive Rateless Codes
inferred← citeshttps://doi.org/10.1109/tit.2004.831751openalex-snapshot
Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.920241openalex-snapshot
The Average Value for the Probability of an Undetected Error
inferred← citeshttps://doi.org/10.3934/amc.2024007openalex-snapshot
A criterion for decoding on the binary symmetric channel
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.