On the public citation graph

Improved sphere bounds on the covering radius of codes

0 signed · 107 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.1007/978-3-662-07998-0openalex-snapshot
Introduction to coding theory
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.1016/0097-3165(71)90051-3openalex-snapshot
On covering sets and error-correcting codes
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/s0019-9958(80)90709-3openalex-snapshot
Bounds for binary codes just outside the plotkin range
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/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1090/psapm/010/0115261openalex-snapshot
Some discrete variable computations
inferredcites →https://doi.org/10.1093/qmath/1.1.284openalex-snapshot
COVERING THEOREMS FOR GROUPS
inferredcites →https://doi.org/10.1109/tit.1980.1056269openalex-snapshot
Binary codes with a minimum distance of four (Corresp.)
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.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.1137/0117123openalex-snapshot
Intersection Inequalities for the Covering Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1520-6610(2000)8:6<391::aid-jcd1>3.0.co;2-ropenalex-snapshot
Classification of binary covering codes
inferred← citeshttps://doi.org/10.1002/jcd.20081openalex-snapshot
Optimal binary covering codes of length 2j
inferred← citeshttps://doi.org/10.1007/3-540-51082-6_80openalex-snapshot
Non linear covering codes : A few results and conjectures
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_44openalex-snapshot
Recent results on covering problems
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_6openalex-snapshot
On some mixed covering codes of small length
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-1-4613-8994-1_2openalex-snapshot
On the Length of Codes with a Given Covering Radius
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_12openalex-snapshot
Saving Probe Bits by Cube Domination
inferred← citeshttps://doi.org/10.1007/978-3-642-19574-7_13openalex-snapshot
Optimal Covering Codes for Finding Near-Collisions
inferred← citeshttps://doi.org/10.1007/bf01388486openalex-snapshot
Bounds for binary multiple covering codes
inferred← citeshttps://doi.org/10.1007/s002000050061openalex-snapshot
Covering Radius 1985-1994
inferred← citeshttps://doi.org/10.1007/s00453-016-0210-3openalex-snapshot
Random and Conditional (t, k)-Diagnosis of Hypercubes
inferred← citeshttps://doi.org/10.1007/s10623-011-9484-2openalex-snapshot
Memoryless near-collisions via coding theory
inferred← citeshttps://doi.org/10.1007/s40314-019-0828-2openalex-snapshot
Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom–Tsfasman space
inferred← citeshttps://doi.org/10.1007/s40840-023-01504-3openalex-snapshot
On Domatic and Total Domatic Numbers of Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90141-6openalex-snapshot
The solution to Berlekamp's switching game
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90028-zopenalex-snapshot
All binary codes with covering radius one are subnormal
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90143-popenalex-snapshot
On the non-existence of certain perfect mixed codes
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90010-eopenalex-snapshot
Bounds on packings and coverings by spheres inq-ary and mixed Hamming spaces
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90011-5openalex-snapshot
Generalized bounds on binary/ternary mixed packing and covering codes
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90024-bopenalex-snapshot
Upper bounds for football pool problems and mixed covering codes
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90013-2openalex-snapshot
Lower bounds for q-ary coverings by spheres of radius one
inferred← citeshttps://doi.org/10.1016/0893-9659(93)90027-kopenalex-snapshot
Independent domination in hypercubes
inferred← citeshttps://doi.org/10.1016/j.disc.2013.07.024openalex-snapshot
On the general excess bound for binary codes with covering radius one
inferred← citeshttps://doi.org/10.1016/j.disc.2017.10.020openalex-snapshot
Switching of covering 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.1016/j.disc.2024.113875openalex-snapshot
Packings in bipartite prisms and hypercubes
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/j.endm.2007.07.052openalex-snapshot
On the general excess bound for binary codes with covering radius one
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.11.004openalex-snapshot
Memoryless near-collisions, revisited
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/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.1017/cbo9780511565670.006openalex-snapshot
A Techniques Oriented Survey of Bounded Queries
inferred← citeshttps://doi.org/10.1023/a:1004834705621openalex-snapshot
ILLUMINATION PROBLEMS AND CODES
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.104338openalex-snapshot
On the covering radius of subcodes of a code
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.21257openalex-snapshot
Inequalities for covering codes
inferred← citeshttps://doi.org/10.1109/18.21265openalex-snapshot
A new construction for 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.2644openalex-snapshot
Lower bounds for binary 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.335937openalex-snapshot
Constructions, families, and tables of 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.45285openalex-snapshot
On normal and subnormal q-ary 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.532916openalex-snapshot
A note on bounds for q-ary covering codes
inferred← citeshttps://doi.org/10.1109/18.53754openalex-snapshot
New lower bounds for covering codes
inferred← citeshttps://doi.org/10.1109/18.54887openalex-snapshot
Lower bounds for q-ary covering codes
inferred← citeshttps://doi.org/10.1109/18.59947openalex-snapshot
More binary covering codes are normal
inferred← citeshttps://doi.org/10.1109/18.59951openalex-snapshot
An improved sphere covering bound for the codes with n=3R+2
inferred← citeshttps://doi.org/10.1109/18.605612openalex-snapshot
The multicovering radii of codes
inferred← citeshttps://doi.org/10.1109/18.61135openalex-snapshot
A new binary code of length 10 and covering radius 1
inferred← citeshttps://doi.org/10.1109/18.61146openalex-snapshot
Linear codes with covering radius 2 and other new covering codes
inferred← citeshttps://doi.org/10.1109/18.61147openalex-snapshot
On 'The optimal linear receiving filter for digital transmission over nonlinear channels'
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/18.75253openalex-snapshot
Modified bounds for covering codes
inferred← citeshttps://doi.org/10.1109/18.79914openalex-snapshot
Linear inequalities for covering codes. I. Pair covering inequalities
inferred← citeshttps://doi.org/10.1109/glocom.2007.278openalex-snapshot
Covering Properties of Rank Metric Codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748685openalex-snapshot
Constructive Non-Existence Proofs for Linear Covering Codes
inferred← citeshttps://doi.org/10.1109/isit.2009.5205850openalex-snapshot
Construction and covering properties of constant-dimension codes
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619609openalex-snapshot
Pair-Covering Codes
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195442openalex-snapshot
On Nearly Perfect Covering Codes
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195455openalex-snapshot
Bounds on Box Codes
inferred← citeshttps://doi.org/10.1109/sct.1995.514852openalex-snapshot
Frequency computation and bounded queries
inferred← citeshttps://doi.org/10.1109/tit.2007.901186openalex-snapshot
Lower Bounds for Binary Codes of Covering Radius One
inferred← citeshttps://doi.org/10.1109/tit.2008.928284openalex-snapshot
Packing and Covering Properties of Rank Metric Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3528303openalex-snapshot
On Nearly Perfect Covering Codes
inferred← citeshttps://doi.org/10.1109/tit.2026.3706793openalex-snapshot
Semidefinite Lower Bounds for Covering Codes
inferred← citeshttps://doi.org/10.14418/wes01.3.66openalex-snapshot
Fractional Chromatic Numbers of Incidence Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.1172.baeopenalex-snapshot
On domination-type invariants of Fibonacci cubes and hypercubes
inferred← citeshttps://doi.org/10.37236/236openalex-snapshot
Multi-Covering Radius for Rank Metric Codes
inferred← citeshttps://doi.org/10.37236/6288openalex-snapshot
(Total) Domination in Prisms
inferred← citeshttps://doi.org/10.46298/dmtcs.322openalex-snapshot
On Locating-Dominating Codes in Binary Hamming Spaces
inferred← citeshttps://doi.org/10.48550/arxiv.1209.4255openalex-snapshot
Memoryless Near-Collisions, Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.2103.10713openalex-snapshot
On Domatic and Total Domatic Numbers of Product Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2109.02818openalex-snapshot
List-decodable Codes and Covering Codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702077openalex-snapshot
Properties of Rank Metric Codes
inferred← citeshttps://doi.org/10.7151/dmgt.1233openalex-snapshot
On the domination number of prisms of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2421openalex-snapshot
Total and paired domination stability in prisms
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.