On the public citation graph

On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes

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.
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.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.1016/0097-3165(86)90007-5openalex-snapshot
A new approach to the covering radius of 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-51082-6_80openalex-snapshot
Non linear covering codes : A few results and conjectures
inferred← citeshttps://doi.org/10.1007/978-1-4612-4808-8_11openalex-snapshot
Unsolved Problems Related to the Covering Radius of Codes
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(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.1023/a:1008397405457openalex-snapshot
Some Upper Bounds on the Covering Radii of Linear Codes Over Fq and Their Applications
inferred← citeshttps://doi.org/10.1023/a:1019903407222openalex-snapshot
Classifying Subspaces of Hamming Spaces
inferred← citeshttps://doi.org/10.1109/18.243469openalex-snapshot
Normal and abnormal codes
inferred← citeshttps://doi.org/10.1109/18.45285openalex-snapshot
On normal and subnormal q-ary 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.54891openalex-snapshot
Some results on the norm of codes
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.1109/18.75253openalex-snapshot
Modified bounds for covering codes
inferred← citeshttps://doi.org/10.1109/18.75256openalex-snapshot
Bounds for abnormal binary codes with covering radius one
inferred← citeshttps://doi.org/10.1109/isit.1993.748511openalex-snapshot
Normal and Abnormal Codes
inferred← citeshttps://doi.org/10.1109/tit.2026.3716379openalex-snapshot
New Upper Bounds for Binary Linear 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.