On the public citation graph

Weighted coverings and packings

0 signed · 45 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/j.1538-7305.1957.tb02410.xopenalex-snapshot
Binary Block Coding
inferredcites →https://doi.org/10.1007/3-540-51083-4_44openalex-snapshot
Recent results on covering problems
inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_4openalex-snapshot
Binary Perfect Weighted Coverings (PWC)
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/bf01388486openalex-snapshot
Bounds for binary multiple covering codes
inferredcites →https://doi.org/10.1007/bfb0034338openalex-snapshot
On perfect weighted coverings with small radius
inferredcites →https://doi.org/10.1016/0012-365x(72)90025-8openalex-snapshot
Nearly perfect binary codes
inferredcites →https://doi.org/10.1016/0012-365x(80)90138-7openalex-snapshot
On tilings of the binary vector space
inferredcites →https://doi.org/10.1016/0012-365x(92)90528-nopenalex-snapshot
List decoding
inferredcites →https://doi.org/10.1016/0012-365x(94)90164-3openalex-snapshot
On the normality of multiple covering codes
inferredcites →https://doi.org/10.1016/0022-247x(86)90049-1openalex-snapshot
Partitions and fuzziness
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(91)90024-bopenalex-snapshot
Upper bounds for football pool problems and mixed covering codes
inferredcites →https://doi.org/10.1016/0097-3165(94)90010-8openalex-snapshot
New upper bounds for the football pool problem for 11 and 12 matches
inferredcites →https://doi.org/10.1016/s0019-9958(63)80010-8openalex-snapshot
Error-correcting codes: An axiomatic approach
inferredcites →https://doi.org/10.1016/s0019-9958(73)80007-5openalex-snapshot
Four fundamental parameters of a code and their combinatorial significance
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1080/00029890.1995.12004624openalex-snapshot
Football Pools--A Game for Mathematicians
inferredcites →https://doi.org/10.1090/s0002-9939-1959-0109137-4openalex-snapshot
The diophantine equation 2ⁿ⁺²-7=𝑥² and related problems
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.179360openalex-snapshot
Constructions for perfect mixed codes and other 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.61123openalex-snapshot
Error-correcting codes for list decoding
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.79931openalex-snapshot
A note on perfect multiple coverings of the Hamming space
inferredcites →https://doi.org/10.1109/tit.1954.1057463openalex-snapshot
Binary coding
inferredcites →https://doi.org/10.1109/tit.1981.1056379openalex-snapshot
Weight distribution of translates, covering radius, and perfect codes correcting errors of given weights
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/0406001openalex-snapshot
On Error-Correcting Codes and Invariant Linear Forms
inferredcites →https://doi.org/10.1137/s0895480193252100openalex-snapshot
Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
inferredcites →https://doi.org/10.6100/ir162111openalex-snapshot
Uniformly packed codes

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aama.2001.0743openalex-snapshot
Integer Zeros ofq-Krawtchouk Polynomials in Classical Combinatorics
inferred← citeshttps://doi.org/10.1006/jcta.1996.0038openalex-snapshot
On Integral Zeros of Krawtchouk Polynomials
inferred← citeshttps://doi.org/10.1007/978-1-4613-0283-4_13openalex-snapshot
The Packing Problem in Statistics, Coding Theory and Finite Projective Spaces: Update 2001
inferred← citeshttps://doi.org/10.1007/s002000050061openalex-snapshot
Covering Radius 1985-1994
inferred← citeshttps://doi.org/10.1007/s10623-009-9277-zopenalex-snapshot
Weighted codes in Lee metrics
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.032openalex-snapshot
(a,b) -codes in Z/nZ
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.079openalex-snapshot
Weighted perfect codes in Lee metric
inferred← citeshttps://doi.org/10.1016/s0378-3758(98)00043-3openalex-snapshot
The packing problem in statistics, coding theory and finite projective spaces
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.70675/53d2ebd3z2b52z44d0zaffcz8cb38c0d6d3fopenalex-snapshot
Contributions to combinatorics on words in an abelian context and covering problems in graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1973openalex-snapshot
Constant 2-labellings and an application to (r,a,b)-covering codes
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.