On the public citation graph
A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0012-365x(72)90025-8openalex-snapshot
Nearly perfect binary codes
inferredcites →https://doi.org/10.1016/s0019-9958(68)90874-7openalex-snapshot
A class of optimum nonlinear double-error-correcting codes
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.212301openalex-snapshot
An updated table of minimum-distance bounds for binary linear codes
inferredcites →https://doi.org/10.1109/18.212302openalex-snapshot
The linear programming bound for binary linear codes
inferredcites →https://doi.org/10.1109/tit.1959.1057514openalex-snapshot
On upper bounds for error detecting and error correcting codes of finite length
inferredcites →https://doi.org/10.1109/tit.1962.1057714openalex-snapshot
A new upper bound for error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1987.1057356openalex-snapshot
An updated table of minimum-distance bounds for 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.1006/ffta.2000.0281openalex-snapshot
A Proof of the Welch and Niho Conjectures on Cross-Correlations of Binary m-Sequences
inferred← citeshttps://doi.org/10.1006/inco.1998.2763openalex-snapshot
On Cryptographic Propagation Criteria for Boolean Functions
inferred← citeshttps://doi.org/10.1006/jcta.2000.3064openalex-snapshot
Maximal Arcs in Projective Three-Spaces and Double-Error-Correcting Cyclic Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-19574-7_1openalex-snapshot
Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256
inferred← citeshttps://doi.org/10.1007/978-94-011-4459-9_3openalex-snapshot
Error Correcting Codes, Correlation and Quantum Entanglement
inferred← citeshttps://doi.org/10.1007/bf00202271openalex-snapshot
An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions
inferred← citeshttps://doi.org/10.1007/bfb0054146openalex-snapshot
On the propagation criterion of degree l and order k
inferred← citeshttps://doi.org/10.1007/s00200-003-0128-2openalex-snapshot
Binary Two-Error-Correcting Codes are Better than Quaternary
inferred← citeshttps://doi.org/10.1007/s10623-010-9402-zopenalex-snapshot
Notes on APN functions, semibiplanes and dimensional dual hyperovals
inferred← citeshttps://doi.org/10.1007/s10623-012-9650-1openalex-snapshot
New ring-linear codes from dualization in projective Hjelmslev geometries
inferred← citeshttps://doi.org/10.1007/s10623-015-0151-xopenalex-snapshot
Almost perfect and planar functions
inferred← citeshttps://doi.org/10.1016/s0195-6698(02)00116-6openalex-snapshot
Codes, graphs, and schemes from nonlinear functions
inferred← citeshttps://doi.org/10.1023/a:1008207230165openalex-snapshot
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions
inferred← citeshttps://doi.org/10.1023/a:1008344232130openalex-snapshot
Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems
inferred← citeshttps://doi.org/10.1090/conm/642/12886openalex-snapshot
Equivalence Classes and Structures of Constacyclic Codes Over Finite Fields
inferred← citeshttps://doi.org/10.1109/18.212302openalex-snapshot
The linear programming bound for binary linear codes
inferred← citeshttps://doi.org/10.1109/18.312154openalex-snapshot
The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
inferred← citeshttps://doi.org/10.1109/18.335936openalex-snapshot
An improvement of the Van Wee bound for binary linear covering codes
inferred← citeshttps://doi.org/10.1109/18.370138openalex-snapshot
Quaternary quadratic residue codes and unimodular lattices
inferred← citeshttps://doi.org/10.1109/itw.1998.706485openalex-snapshot
On cryptographic propagation criteria for Boolean functions
inferred← citeshttps://doi.org/10.1109/tit.2012.2191389openalex-snapshot
Minimum Weights and Weight Enumerators of $\BBZ_{4}$-Linear Quadratic Residue Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2612654openalex-snapshot
New Upper Bounds on Binary Linear Codes and a $ {\mathbb Z}_{4}$ -Code With a Better-Than-Linear Gray Image
inferred← citeshttps://doi.org/10.1109/tit.2025.3590510openalex-snapshot
The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes
inferred← citeshttps://doi.org/10.3934/amc.2009.3.59openalex-snapshot
A new almost perfect nonlinear function which is not quadratic
inferred← citeshttps://doi.org/10.3934/amc.2023054openalex-snapshot
Sidon sets, sum-free sets and linear codes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0207208openalex-snapshot
The Z_4-Linearity of Kerdock, Preparata, Goethals and Related Codes
inferred← citeshttps://doi.org/10.56824/vujs.2019nt40openalex-snapshot
Algebraic structure of cyclic and negacyclic codes over a finite chain ring alphabet and applications
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.