On the public citation graph
On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
0 signed · 27 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.1002/j.1538-7305.1960.tb03958.xopenalex-snapshot
Some Further Theory of Group Codes
inferredcites →https://doi.org/10.1007/3-540-16767-6_53openalex-snapshot
An improved upper bound on covering radius
inferredcites →https://doi.org/10.1007/978-1-4612-4808-8_11openalex-snapshot
Unsolved Problems Related to the Covering Radius of Codes
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/tit.1973.1055009openalex-snapshot
Minimum-distance bounds for binary linear codes
inferredcites →https://doi.org/10.1109/tit.1982.1056498openalex-snapshot
Computing automorphism groups of error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1985.1057039openalex-snapshot
On the covering radius of codes
inferredcites →https://doi.org/10.1109/tit.1985.1057043openalex-snapshot
Covering radius---Survey and recent results
inferredcites →https://doi.org/10.1109/tit.1986.1057227openalex-snapshot
Further results on the covering radius of 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/3-540-16767-6_52openalex-snapshot
On a conjecture concerning coverings of Hamming space
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_44openalex-snapshot
Recent results on covering problems
inferred← citeshttps://doi.org/10.1007/bf01388486openalex-snapshot
Bounds for binary multiple covering codes
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90141-6openalex-snapshot
The solution to Berlekamp's switching game
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/0097-3165(92)90041-ropenalex-snapshot
Covering bounds for codes
inferred← citeshttps://doi.org/10.1023/a:1008397405457openalex-snapshot
Some Upper Bounds on the Covering Radii of Linear Codes Over Fq and Their Applications
inferred← citeshttps://doi.org/10.1090/s0025-5718-1991-1079013-8openalex-snapshot
Covering Radius Computations for Binary Cyclic Codes
inferred← citeshttps://doi.org/10.1109/18.53766openalex-snapshot
Comments on "On the covering radius of codes" [with reply]
inferred← citeshttps://doi.org/10.1109/18.59947openalex-snapshot
More binary covering codes are normal
inferred← citeshttps://doi.org/10.1109/18.61146openalex-snapshot
Linear codes with covering radius 2 and other new covering codes
inferred← citeshttps://doi.org/10.3934/amc.2010.4.399openalex-snapshot
On the least covering radius of binary linear codes of dimension 6
inferred← citeshttps://doi.org/10.3934/amc.2011.5.681openalex-snapshot
All binary linear codes of lengths up to 18 or redundancy up to 10 are normal
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.