On the public citation graph
More binary covering codes are normal
0 signed · 33 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.1007/3-540-51082-6_80openalex-snapshot
Non linear covering codes : A few results and conjectures
inferredcites →https://doi.org/10.1007/978-3-662-07998-0openalex-snapshot
Introduction to coding theory
inferredcites →https://doi.org/10.1016/0097-3165(86)90007-5openalex-snapshot
A new approach to the covering radius of 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.21265openalex-snapshot
A new construction for covering codes
inferredcites →https://doi.org/10.1109/18.2632openalex-snapshot
Improved sphere bounds on the covering radius of codes
inferredcites →https://doi.org/10.1109/18.2644openalex-snapshot
Lower bounds for binary covering codes
inferredcites →https://doi.org/10.1109/18.75256openalex-snapshot
Bounds for abnormal binary codes with covering radius one
inferredcites →https://doi.org/10.1109/tit.1985.1057039openalex-snapshot
On the covering radius of codes
inferredcites →https://doi.org/10.1109/tit.1986.1057227openalex-snapshot
Further results on the covering radius of codes
inferredcites →https://doi.org/10.1137/0608049openalex-snapshot
On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
inferredcites →https://doi.org/10.1137/0608050openalex-snapshot
On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
inferredcites →https://doi.org/10.6100/ir256674openalex-snapshot
Some distance problems in coding theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01388486openalex-snapshot
Bounds for binary multiple covering codes
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90028-zopenalex-snapshot
All binary codes with covering radius one are subnormal
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90164-3openalex-snapshot
On the normality of multiple covering codes
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.042openalex-snapshot
Density of constant radius normal binary covering codes
inferred← citeshttps://doi.org/10.1109/18.108275openalex-snapshot
Further results on (k, t)-subnormal covering codes
inferred← citeshttps://doi.org/10.1109/18.243470openalex-snapshot
Distributed estimation and quantization
inferred← citeshttps://doi.org/10.1109/18.75256openalex-snapshot
Bounds for abnormal binary codes with covering radius one
inferred← citeshttps://doi.org/10.1109/18.75258openalex-snapshot
Binary linear quasi-perfect codes are normal
inferred← citeshttps://doi.org/10.1109/18.75259openalex-snapshot
Performance analysis of disk allocation method using error-correcting codes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0409171openalex-snapshot
Density of normal binary covering 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.