On the public citation graph

Upper bounds for q-ary covering codes

0 signed · 47 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-16767-6_52openalex-snapshot
On a conjecture concerning coverings of Hamming space
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(87)90012-4openalex-snapshot
The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
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.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.54887openalex-snapshot
Lower bounds for q-ary 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.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.1109/tit.1987.1057277openalex-snapshot
Using simulated annealing to design good codes
inferredcites →https://doi.org/10.1112/jlms/s2-1.1.493openalex-snapshot
Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing

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.1016/0012-365x(92)90556-uopenalex-snapshot
On lengthening of covering codes
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(94)90010-8openalex-snapshot
New upper bounds for the football pool problem for 11 and 12 matches
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90141-4openalex-snapshot
On (q, 1)-subnormal q-ary covering codes
inferred← citeshttps://doi.org/10.1016/j.dam.2009.11.006openalex-snapshot
Bounds for short covering codes and reactive tabu search
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.2012.10.002openalex-snapshot
Covering codes and extremal problems from invariant sets under permutations
inferred← citeshttps://doi.org/10.1016/j.jcta.2003.08.004openalex-snapshot
K5(7,3)⩽100
inferred← citeshttps://doi.org/10.1016/j.jcta.2008.06.008openalex-snapshot
Lower bounds on covering codes via partition matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2013.11.034openalex-snapshot
Invariant sets under linear operator and covering codes over modules
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.1023/a:1008228721072openalex-snapshot
A New Table of Binary/Ternary Mixed Covering Codes
inferred← citeshttps://doi.org/10.1080/00029890.1995.12004624openalex-snapshot
Football Pools--A Game for Mathematicians
inferred← citeshttps://doi.org/10.1109/18.108275openalex-snapshot
Further results on (k, t)-subnormal covering codes
inferred← citeshttps://doi.org/10.1109/18.179360openalex-snapshot
Constructions for perfect mixed codes and other covering codes
inferred← citeshttps://doi.org/10.1109/18.243462openalex-snapshot
Some new lower bounds for binary and ternary covering codes
inferred← citeshttps://doi.org/10.1109/18.476339openalex-snapshot
Constructions and families of covering codes and saturated sets of points in projective geometry
inferred← citeshttps://doi.org/10.1109/18.532916openalex-snapshot
A note on bounds for q-ary covering codes
inferred← citeshttps://doi.org/10.1109/18.623166openalex-snapshot
Constructions of nonlinear covering codes
inferred← citeshttps://doi.org/10.1109/18.661507openalex-snapshot
On a new class of codes for identifying vertices in graphs
inferred← citeshttps://doi.org/10.1109/18.86975openalex-snapshot
On (k, t)-subnormal covering codes
inferred← citeshttps://doi.org/10.1109/itcc.2001.918778openalex-snapshot
Coding theory framework for target location in distributed sensor networks
inferred← citeshttps://doi.org/10.1109/tifs.2021.3101045openalex-snapshot
Memory-Based PUFs are Vulnerable as Well: A Non-Invasive Attack Against SRAM PUFs
inferred← citeshttps://doi.org/10.1186/gb-2010-11-2-r15openalex-snapshot
A scalable, fully automated process for construction of sequence-ready barcoded libraries for 454
inferred← citeshttps://doi.org/10.1556/sscmath.40.2003.1-2.20openalex-snapshot
On the covering radius of small codes
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.3934/amc.2011.5.119openalex-snapshot
Linear nonbinary covering codes and saturating sets in projective spaces
inferred← citeshttps://doi.org/10.48550/arxiv.2003.09537openalex-snapshot
Covering the Relational Join
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.