On the public citation graph
Modified bounds for covering codes
0 signed · 95 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/3-540-51082-6_80openalex-snapshot
Non linear covering codes : A few results and conjectures
inferredcites →https://doi.org/10.1007/978-1-4613-8994-1_2openalex-snapshot
On the Length of Codes with a Given Covering Radius
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/0012-365x(73)90098-8openalex-snapshot
Families of k-independent sets
inferredcites →https://doi.org/10.1016/0012-365x(90)90009-7openalex-snapshot
Applications of coding theory to communication combinatorial problems
inferredcites →https://doi.org/10.1016/0012-365x(91)90028-zopenalex-snapshot
All binary codes with covering radius one are subnormal
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(73)90086-1openalex-snapshot
Sperner systems consisting of pairs of complementary subsets
inferredcites →https://doi.org/10.1016/0097-3165(86)90007-5openalex-snapshot
A new approach to the covering radius of codes
inferredcites →https://doi.org/10.1016/0097-3165(87)90059-8openalex-snapshot
Coverings of Pairs by Quintuples
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)90015-9openalex-snapshot
On λ-covers of pairs by quintuples: ν odd
inferredcites →https://doi.org/10.1016/s0097-3165(73)80003-2openalex-snapshot
On the covering of pairs by quadruples. II
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1093/qmath/18.1.369openalex-snapshot
SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
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/18.2644openalex-snapshot
Lower bounds for binary covering codes
inferredcites →https://doi.org/10.1109/18.42181openalex-snapshot
Short codes with a given covering radius
inferredcites →https://doi.org/10.1109/18.54887openalex-snapshot
Lower bounds for q-ary covering codes
inferredcites →https://doi.org/10.1109/18.59947openalex-snapshot
More binary covering codes are normal
inferredcites →https://doi.org/10.1109/18.75256openalex-snapshot
Bounds for abnormal binary codes with covering radius one
inferredcites →https://doi.org/10.1109/tit.1978.1055827openalex-snapshot
Bounds for binary codes of length less than 25
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/0608049openalex-snapshot
On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
inferredcites →https://doi.org/10.1137/0608050openalex-snapshot
On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
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
inferredcites →https://doi.org/10.5486/pmd.1963.10.1-4.02openalex-snapshot
On a limit theorem in combinatorical analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.3180010106openalex-snapshot
Covering arrays and intersecting codes
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/978-1-4613-8994-1_2openalex-snapshot
On the Length of Codes with a Given Covering Radius
inferred← citeshttps://doi.org/10.1007/bf01388385openalex-snapshot
Bounds on the sizes of constant weight covering codes
inferred← citeshttps://doi.org/10.1007/bf01388486openalex-snapshot
Bounds for binary multiple covering codes
inferred← citeshttps://doi.org/10.1007/s002000050052openalex-snapshot
Long binary narrow-sense BCH codes are normal
inferred← citeshttps://doi.org/10.1007/s10623-004-3804-8openalex-snapshot
Bounds for Covering Codes over Large Alphabets
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/s40314-019-0828-2openalex-snapshot
Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom–Tsfasman space
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(94)90164-3openalex-snapshot
On the normality of multiple 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(92)90041-ropenalex-snapshot
Covering bounds for 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/0166-218x(94)90141-4openalex-snapshot
On (q, 1)-subnormal q-ary covering codes
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00149-2openalex-snapshot
Frequency computation and bounded queries
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.jnt.2020.10.009openalex-snapshot
Inverse problems for minimal complements and maximal supplements
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/s0012-365x(97)81825-0openalex-snapshot
New upper bounds for binary covering codes
inferred← citeshttps://doi.org/10.1017/cbo9780511565670.006openalex-snapshot
A Techniques Oriented Survey of Bounded Queries
inferred← citeshttps://doi.org/10.1023/a:1008364924033openalex-snapshot
On Lower Bounds For Covering Codes
inferred← citeshttps://doi.org/10.1023/a:1022490600755openalex-snapshot
A Graham-Sloane Type Construction for s-Surjective Matrices
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.108275openalex-snapshot
Further results on (k, t)-subnormal covering codes
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.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.476339openalex-snapshot
Constructions and families of covering codes and saturated sets of points in projective geometry
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.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.75256openalex-snapshot
Bounds for abnormal binary codes with covering radius one
inferred← citeshttps://doi.org/10.1109/18.79914openalex-snapshot
Linear inequalities for covering codes. I. Pair covering inequalities
inferred← citeshttps://doi.org/10.1109/18.79926openalex-snapshot
Upper bounds for q-ary covering codes
inferred← citeshttps://doi.org/10.1109/isit.1994.394922openalex-snapshot
Long binary narrow-sense BCH codes are normal
inferred← citeshttps://doi.org/10.1109/isit.2000.866691openalex-snapshot
Multicovering bounds from relative covering radii
inferred← citeshttps://doi.org/10.1109/sct.1995.514852openalex-snapshot
Frequency computation and bounded queries
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492461openalex-snapshot
Private information retrieval
inferred← citeshttps://doi.org/10.1137/s089548010037935xopenalex-snapshot
Multicovering Bounds from Relative Covering Radii
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.1556/sscmath.48.2011.1.1140openalex-snapshot
On generalized surjective codes
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
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.