On the public citation graph
Linear inequalities for covering codes. I. Pair covering inequalities
0 signed · 61 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01817441openalex-snapshot
Covering Problems for Dichotomized Matching
inferredcites →https://doi.org/10.1007/bf01817562openalex-snapshot
Covering problems for dichotomized matchings
inferredcites →https://doi.org/10.1007/bf02390819openalex-snapshot
On a covering problem related to the centered Hardy-Littlewood maximal inequality
inferredcites →https://doi.org/10.1016/0097-3165(71)90051-3openalex-snapshot
On covering sets and error-correcting codes
inferredcites →https://doi.org/10.1016/0097-3165(72)90008-8openalex-snapshot
On the covering of pairs by quadruples I
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(83)90033-xopenalex-snapshot
The football pool problem for 7 and 8 matches
inferredcites →https://doi.org/10.1016/s0021-9800(67)80102-9openalex-snapshot
The football pool problem for 5 matches
inferredcites →https://doi.org/10.1016/s0021-9800(69)80122-5openalex-snapshot
Note on a theorem of Zaremba
inferredcites →https://doi.org/10.1016/s0195-6698(89)80048-4openalex-snapshot
A Lloyd Theorem in Weakly Metric Association Schemes
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.108272openalex-snapshot
Lower bounds on t(n, k) from linear inequalities
inferredcites →https://doi.org/10.1109/18.21265openalex-snapshot
A new construction for covering codes
inferredcites →https://doi.org/10.1109/18.21266openalex-snapshot
The minimal covering radius t(15,6) of a six-dimensional binary linear code of length 15 is equal to 4
inferredcites →https://doi.org/10.1109/18.2632openalex-snapshot
Improved sphere bounds on the covering radius of 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.1111/j.1749-6632.1970.tb45155.xopenalex-snapshot
COVERINGS OF PAIRS BY k-SETS
inferredcites →https://doi.org/10.1112/jlms/s1-26.1.71openalex-snapshot
A Covering Theorem for Abelian Groups
inferredcites →https://doi.org/10.1112/jlms/s1-27.2.242openalex-snapshot
Covering Problems Concerning Abelian Groups
inferredcites →https://doi.org/10.1112/jlms/s1-44.1.60openalex-snapshot
A Combinatorial Problem in Matching
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.1112/jlms/s2-3.2.222openalex-snapshot
On a Covering Problem Concerning Abelian Groups
inferredcites →https://doi.org/10.2140/pjm.1958.8.709openalex-snapshot
Minimal coverings of pairs by triples
inferredcites →https://doi.org/10.2140/pjm.1968.26.131openalex-snapshot
Maximal and minimal coverings of (k− 1)-tuples byk-tuples
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_33openalex-snapshot
Lower Bounds for Group Covering Designs
inferred← citeshttps://doi.org/10.1007/3-540-57843-9_5openalex-snapshot
A lower bound on binary codes with covering radius one
inferred← citeshttps://doi.org/10.1007/3-540-57843-9_7openalex-snapshot
The length function: A revised table
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.1016/j.disopt.2026.100946openalex-snapshot
An initial polyhedral study of the football pool problem
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00461-1openalex-snapshot
Binary and ternary codes of covering radius one: some new lower bounds
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00290-7openalex-snapshot
Binary codes with covering radius one: Some new lower bounds
inferred← citeshttps://doi.org/10.1016/s0893-6080(03)00006-6openalex-snapshot
Bounds on the number of hidden neurons in three-layer binary neural networks
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00154-4openalex-snapshot
Multicovering Bounds from Linear Inequalities (Extended Abstract)
inferred← citeshttps://doi.org/10.1023/a:1008364924033openalex-snapshot
On Lower Bounds For 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.108272openalex-snapshot
Lower bounds on t(n, k) from linear inequalities
inferred← citeshttps://doi.org/10.1109/18.165440openalex-snapshot
Linear inequalities for covering codes. II. Triple covering inequalities
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.333857openalex-snapshot
On the structure of linear codes with covering radius two and three
inferred← citeshttps://doi.org/10.1109/18.335936openalex-snapshot
An improvement of the Van Wee bound for binary linear covering codes
inferred← citeshttps://doi.org/10.1109/18.335963openalex-snapshot
New lower bounds for binary covering codes
inferred← citeshttps://doi.org/10.1109/18.481808openalex-snapshot
New binary covering codes obtained by simulated annealing
inferred← citeshttps://doi.org/10.1109/18.705582openalex-snapshot
Several new lower bounds on the size of codes with covering radius one
inferred← citeshttps://doi.org/10.1109/isit.2001.936066openalex-snapshot
Multicovering bounds from supercodes
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.1109/tit.2004.825504openalex-snapshot
Improved Multicovering Bounds From Linear Inequalities and Supercodes
inferred← citeshttps://doi.org/10.1109/tit.2026.3706793openalex-snapshot
Semidefinite Lower Bounds for Covering Codes
inferred← citeshttps://doi.org/10.1137/s0895480193252100openalex-snapshot
Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
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.