On the public citation graph

Bounds for binary multiple covering codes

0 signed · 56 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/3-540-51082-6_80openalex-snapshot
Non linear covering codes : A few results and conjectures
inferredcites →https://doi.org/10.1007/3-540-51083-4_44openalex-snapshot
Recent results on covering problems
inferredcites →https://doi.org/10.1007/978-3-7091-2786-5_4openalex-snapshot
On Weighted Coverings and Packings with Diameter One
inferredcites →https://doi.org/10.1007/bfb0034338openalex-snapshot
On perfect weighted coverings with small radius
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(83)90032-8openalex-snapshot
On the football pool problem for 6 matches: A new upper bound
inferredcites →https://doi.org/10.1016/0097-3165(84)90010-4openalex-snapshot
More coverings by rook domains
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/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/0097-3165(91)90024-bopenalex-snapshot
Upper bounds for football pool problems and mixed covering 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.108275openalex-snapshot
Further results on (k, t)-subnormal covering codes
inferredcites →https://doi.org/10.1109/18.165440openalex-snapshot
Linear inequalities for covering codes. II. Triple covering inequalities
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.335963openalex-snapshot
New 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.54891openalex-snapshot
Some results on the norm of codes
inferredcites →https://doi.org/10.1109/18.59947openalex-snapshot
More binary covering codes are normal
inferredcites →https://doi.org/10.1109/18.59951openalex-snapshot
An improved sphere covering bound for the codes with n=3R+2
inferredcites →https://doi.org/10.1109/18.75253openalex-snapshot
Modified bounds for 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/18.75258openalex-snapshot
Binary linear quasi-perfect codes are normal
inferredcites →https://doi.org/10.1109/18.79914openalex-snapshot
Linear inequalities for covering codes. I. Pair covering inequalities
inferredcites →https://doi.org/10.1109/18.79926openalex-snapshot
Upper bounds for q-ary covering codes
inferredcites →https://doi.org/10.1109/18.79931openalex-snapshot
A note on perfect multiple coverings of the Hamming space
inferredcites →https://doi.org/10.1109/18.86975openalex-snapshot
On (k, t)-subnormal 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.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
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.1137/s0895480193252100openalex-snapshot
Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.22266744zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1006/jcta.1996.0038openalex-snapshot
On Integral Zeros of Krawtchouk Polynomials
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/s002000050061openalex-snapshot
Covering Radius 1985-1994
inferred← citeshttps://doi.org/10.1007/s10623-007-9089-yopenalex-snapshot
New lower bounds for multiple coverings
inferred← citeshttps://doi.org/10.1007/s40314-019-0828-2openalex-snapshot
Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom–Tsfasman space
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90556-uopenalex-snapshot
On lengthening of covering codes
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)81825-0openalex-snapshot
New upper bounds for binary 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.1017/cbo9781139506748.003openalex-snapshot
The geometry of covering codes: small complete caps and saturating sets in Galois spaces
inferred← citeshttps://doi.org/10.1023/a:1008228721072openalex-snapshot
A New Table of Binary/Ternary Mixed Covering Codes
inferred← citeshttps://doi.org/10.1023/a:1008364924033openalex-snapshot
On Lower Bounds For Covering Codes
inferred← citeshttps://doi.org/10.1023/a:1011256721935openalex-snapshot
On Codes Identifying Sets of Vertices in Hamming Spaces
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.1109/tit.2020.3046260openalex-snapshot
On Multifold Packings of Radius-1 Balls in Hamming Graphs
inferred← citeshttps://doi.org/10.1137/s0895480193252100openalex-snapshot
Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
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.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.