On the public citation graph

A note on perfect multiple coverings of the Hamming space

0 signed · 22 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.1007/978-3-662-20712-3openalex-snapshot
Coding Theory
inferredcites →https://doi.org/10.1016/0097-3165(89)90036-8openalex-snapshot
New upper bounds for the football pool problem for 6, 7, and 8 matches
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.45285openalex-snapshot
On normal and subnormal q-ary codes
inferredcites →https://doi.org/10.1109/tit.1968.1054129openalex-snapshot
Exponential error bounds for erasure, list, and decision feedback schemes
inferredcites →https://doi.org/10.1216/rmj-1975-5-2-199openalex-snapshot
A survey of perfect 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/jcta.1996.0038openalex-snapshot
On Integral Zeros of Krawtchouk Polynomials
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_4openalex-snapshot
Binary Perfect Weighted Coverings (PWC)
inferred← citeshttps://doi.org/10.1007/978-3-7091-2786-5_4openalex-snapshot
On Weighted Coverings and Packings with Diameter One
inferred← citeshttps://doi.org/10.1007/bf01388486openalex-snapshot
Bounds for binary multiple covering codes
inferred← citeshttps://doi.org/10.1007/bfb0034338openalex-snapshot
On perfect weighted coverings with small radius
inferred← citeshttps://doi.org/10.1007/s002000050061openalex-snapshot
Covering Radius 1985-1994
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/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.1080/00029890.1995.12004624openalex-snapshot
Football Pools--A Game for Mathematicians
inferred← citeshttps://doi.org/10.1109/18.335963openalex-snapshot
New lower bounds for binary covering codes
inferred← citeshttps://doi.org/10.1109/18.476311openalex-snapshot
Weighted coverings and packings
inferred← citeshttps://doi.org/10.3934/amc.2015.9.63openalex-snapshot
Multiple coverings of the farthest-off points with small density from projective geometry
inferred← citeshttps://doi.org/10.3934/amc.2016030openalex-snapshot
Further results on multiple coverings of the farthest-off points
inferred← citeshttps://doi.org/10.3934/amc.2025050openalex-snapshot
New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
inferred← citeshttps://doi.org/10.48550/arxiv.1603.09156openalex-snapshot
New identities for binary Krawtchouk polynomials, binomial coefficients and Catalan numbers
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.