On the public citation graph

Bounds on the sizes of constant weight covering codes

0 signed · 42 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/(sici)1520-6610(1996)4:1<5::aid-jcd2>3.0.co;2-jopenalex-snapshot
On the lottery problem
inferredcites →https://doi.org/10.1002/jcd.3180020509openalex-snapshot
Large sets of coverings
inferredcites →https://doi.org/10.1007/bfb0088898openalex-snapshot
A computer search for B-coverings
inferredcites →https://doi.org/10.1016/0012-365x(91)90267-6openalex-snapshot
On the covering of t-sets with (t + 1)-sets:C(9, 5, 4) and C(10, 6, 5)
inferredcites →https://doi.org/10.1016/0095-8956(83)90045-xopenalex-snapshot
A note on the probabilistic approach to Turán's problem
inferredcites →https://doi.org/10.1016/0097-3165(83)90052-3openalex-snapshot
On large sets of disjoint steiner triple systems I
inferredcites →https://doi.org/10.1016/0097-3165(84)90066-9openalex-snapshot
On large sets of disjoint steiner triple systems, IV
inferredcites →https://doi.org/10.1016/0097-3165(86)90119-6openalex-snapshot
Covering triples by quadruples: An asymptotic solution
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/0097-3165(91)90053-jopenalex-snapshot
A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
inferredcites →https://doi.org/10.1016/s0195-6698(85)80023-8openalex-snapshot
On a Packing and Covering Problem
inferredcites →https://doi.org/10.1109/18.45293openalex-snapshot
New lower bounds for constant weight codes
inferredcites →https://doi.org/10.1109/18.59932openalex-snapshot
A new table of constant weight codes
inferredcites →https://doi.org/10.1109/18.75253openalex-snapshot
Modified bounds for covering codes
inferredcites →https://doi.org/10.1109/tit.1974.1055248openalex-snapshot
Source coding theorems without the ergodic assumption
inferredcites →https://doi.org/10.1109/tit.1980.1056141openalex-snapshot
Lower bounds for constant weight codes
inferredcites →https://doi.org/10.1109/tit.1985.1057043openalex-snapshot
Covering radius---Survey and recent results
inferredcites →https://doi.org/10.2140/pjm.1958.8.709openalex-snapshot
Minimal coverings of pairs by triples
inferredcites →https://doi.org/10.2140/pjm.1964.14.1405openalex-snapshot
On coverings
inferredcites →https://doi.org/10.4064/cm-3-1-19-30openalex-snapshot
On the theory of graphs
inferredcites →https://doi.org/10.4153/cjm-1975-031-3openalex-snapshot
Construction of Large Sets of Almost Disjoint Steiner Triple Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1520-6610(1999)7:3<217::aid-jcd5>3.0.co;2-wopenalex-snapshot
New coverings oft-sets with (t + 1)-sets
inferred← citeshttps://doi.org/10.1002/jcd.20019openalex-snapshot
Upper bounds on the general covering number Cλ(v, k, t, m)
inferred← citeshttps://doi.org/10.1002/jcd.21401openalex-snapshot
Asymptotic Bounds for General Covering Designs
inferred← citeshttps://doi.org/10.1006/jcta.1998.2927openalex-snapshot
General Upper Bounds on the Minimum Size of Covering Designs
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_24openalex-snapshot
Pruning by Isomorphism in Branch-and-Cut
inferred← citeshttps://doi.org/10.1007/s002000050061openalex-snapshot
Covering Radius 1985-1994
inferred← citeshttps://doi.org/10.1007/s10107-003-0394-6openalex-snapshot
Exploiting orbits in symmetric ILP
inferred← citeshttps://doi.org/10.1007/s10623-011-9499-8openalex-snapshot
Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
inferred← citeshttps://doi.org/10.1007/s10732-010-9150-2openalex-snapshot
A tabu search algorithm for the covering design problem
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:1024703225079openalex-snapshot
Exact Bounds on the Sizes of Covering Codes
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483478openalex-snapshot
Covering arbitrary point patterns
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195624openalex-snapshot
Sequence Reconstruction Over Coloring Channels for Protein Identification
inferred← citeshttps://doi.org/10.1109/tit.2020.2977871openalex-snapshot
Low-Power Cooling Codes With Efficient Encoding and Decoding
inferred← citeshttps://doi.org/10.1109/tit.2021.3102177openalex-snapshot
Private Proximity Retrieval Codes
inferred← citeshttps://doi.org/10.1145/3586042openalex-snapshot
Deep Learning Robustness Verification for Few-Pixel Attacks
inferred← citeshttps://doi.org/10.1145/3626792openalex-snapshot
Invertible Bloom Lookup Tables with Listing Guarantees
inferred← citeshttps://doi.org/10.37236/2606openalex-snapshot
Some Constructions of General Covering Designs
inferred← citeshttps://doi.org/10.48550/arxiv.1205.4994openalex-snapshot
Constructions of General Covering Designs
inferred← citeshttps://doi.org/10.48550/arxiv.1808.09535openalex-snapshot
Low-Power Cooling Codes with Efficient Encoding and Decoding
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.