On the public citation graph

An updated table of binary/ternary mixed covering codes

0 signed · 31 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/1520-6610(2000)8:6<391::aid-jcd1>3.0.co;2-ropenalex-snapshot
Classification of binary covering codes
inferredcites →https://doi.org/10.1006/jcta.1997.2825openalex-snapshot
Ternary Covering Codes Derived from BCH Codes
inferredcites →https://doi.org/10.1006/jcta.2002.3260openalex-snapshot
A New Lower Bound for the Football Pool Problem for Six Matches
inferredcites →https://doi.org/10.1016/0097-3165(91)90010-eopenalex-snapshot
Bounds on packings and coverings by spheres inq-ary and mixed Hamming spaces
inferredcites →https://doi.org/10.1016/0097-3165(91)90011-5openalex-snapshot
Generalized bounds on binary/ternary mixed packing and covering codes
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/s0012-365x(00)00011-xopenalex-snapshot
New lower bounds for covering codes
inferredcites →https://doi.org/10.1016/s0012-365x(00)00017-0openalex-snapshot
Classification of binary/ternary one-error-correcting codes
inferredcites →https://doi.org/10.1016/s0012-365x(99)00338-6openalex-snapshot
Lower bounds for q-ary codes of covering radius one
inferredcites →https://doi.org/10.1016/s0097-3165(03)00010-4openalex-snapshot
An improved upper bound for the football pool problem for nine matches
inferredcites →https://doi.org/10.1023/a:1008228721072openalex-snapshot
A New Table of Binary/Ternary Mixed Covering Codes
inferredcites →https://doi.org/10.1023/a:1008326409439openalex-snapshot
Constructing Covering Codes with Given Automorphisms
inferredcites →https://doi.org/10.1080/00029890.1995.12004624openalex-snapshot
Football Pools--A Game for Mathematicians
inferredcites →https://doi.org/10.1109/18.108275openalex-snapshot
Further results on (k, t)-subnormal covering codes
inferredcites →https://doi.org/10.1109/18.61135openalex-snapshot
A new binary code of length 10 and covering radius 1
inferredcites →https://doi.org/10.1109/18.623161openalex-snapshot
Long packing and covering codes
inferredcites →https://doi.org/10.1109/18.705582openalex-snapshot
Several new lower bounds on the size of codes with covering radius one
inferredcites →https://doi.org/10.1109/18.945268openalex-snapshot
On the size of optimal binary codes of length 9 and covering radius 1
inferredcites →https://doi.org/10.1556/sscmath.40.2003.1-2.20openalex-snapshot
On the covering radius of small codes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jcd.20081openalex-snapshot
Optimal binary covering codes of length 2j
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_17openalex-snapshot
Symmetry in Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/s10623-004-3804-8openalex-snapshot
Bounds for Covering Codes over Large Alphabets
inferred← citeshttps://doi.org/10.1007/s10623-007-9156-4openalex-snapshot
On the minimum size of binary codes with length 2R + 4 and covering radius R
inferred← citeshttps://doi.org/10.1016/j.disc.2006.04.038openalex-snapshot
Further results on the covering radius of small codes
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113752openalex-snapshot
Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
inferred← citeshttps://doi.org/10.1109/tit.2005.860449openalex-snapshot
Unidirectional covering codes
inferred← citeshttps://doi.org/10.1155/2018/3041426openalex-snapshot
The Domination Complexity and Related Extremal Values of Large 3D Torus
inferred← citeshttps://doi.org/10.1556/sscmath.2007.1027openalex-snapshot
On small covering codes in arbitrary mixed hamming spaces
inferred← citeshttps://doi.org/10.48550/arxiv.2009.04636openalex-snapshot
A performance study of some approximation algorithms for minimum dominating set in a graph
inferred← citeshttps://doi.org/10.48550/arxiv.2103.10713openalex-snapshot
On Domatic and Total Domatic Numbers of Product Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1233openalex-snapshot
On the domination number of prisms of graphs
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.