On the public citation graph

Bounds for abnormal binary codes with covering radius one

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.1016/0012-365x(91)90028-zopenalex-snapshot
All binary codes with covering radius one are subnormal
inferredcites →https://doi.org/10.1016/0097-3165(91)90024-bopenalex-snapshot
Upper bounds for football pool problems and mixed covering codes
inferredcites →https://doi.org/10.1109/18.2644openalex-snapshot
Lower bounds for binary covering codes
inferredcites →https://doi.org/10.1109/18.45285openalex-snapshot
On normal and subnormal q-ary codes
inferredcites →https://doi.org/10.1109/18.59947openalex-snapshot
More binary covering codes are normal
inferredcites →https://doi.org/10.1109/18.75253openalex-snapshot
Modified bounds for covering codes
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/0608050openalex-snapshot
On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal 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/bf01388486openalex-snapshot
Bounds for binary multiple covering codes
inferred← citeshttps://doi.org/10.1007/s002000050061openalex-snapshot
Covering Radius 1985-1994
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(92)90536-oopenalex-snapshot
Covering machines
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(91)90024-bopenalex-snapshot
Upper bounds for football pool problems and mixed covering codes
inferred← citeshttps://doi.org/10.1016/0097-3165(92)90041-ropenalex-snapshot
Covering bounds for codes
inferred← citeshttps://doi.org/10.1016/s0924-6509(13)70005-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0924-6509(97)80023-2openalex-snapshot
Complexity
inferred← citeshttps://doi.org/10.1109/18.108275openalex-snapshot
Further results on (k, t)-subnormal covering codes
inferred← citeshttps://doi.org/10.1109/18.243469openalex-snapshot
Normal and abnormal codes
inferred← citeshttps://doi.org/10.1109/18.59947openalex-snapshot
More binary covering codes are normal
inferred← citeshttps://doi.org/10.1109/18.75253openalex-snapshot
Modified bounds for covering codes
inferred← citeshttps://doi.org/10.1109/18.86975openalex-snapshot
On (k, t)-subnormal covering codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748511openalex-snapshot
Normal and Abnormal 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.