On the public citation graph

Lower bounds for binary covering codes

0 signed · 46 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-51083-4_44openalex-snapshot
Recent results on covering problems
inferredcites →https://doi.org/10.1007/bf01817441openalex-snapshot
Covering Problems for Dichotomized Matching
inferredcites →https://doi.org/10.1016/0097-3165(78)90028-6openalex-snapshot
Balancing families of sets
inferredcites →https://doi.org/10.1016/0097-3165(87)90059-8openalex-snapshot
Coverings of Pairs by Quintuples
inferredcites →https://doi.org/10.1016/0166-218x(81)90022-6openalex-snapshot
“Integer-making” theorems
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.42181openalex-snapshot
Short codes with a given covering radius
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/0117123openalex-snapshot
Intersection Inequalities for the Covering Problem
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-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/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/s002000050061openalex-snapshot
Covering Radius 1985-1994
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(94)90164-3openalex-snapshot
On the normality of multiple covering 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)90024-bopenalex-snapshot
Upper bounds for football pool problems and mixed covering codes
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/j.disc.2012.10.002openalex-snapshot
Covering codes and extremal problems from invariant sets under permutations
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)81825-0openalex-snapshot
New upper bounds for binary covering codes
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:1008364924033openalex-snapshot
On Lower Bounds For Covering Codes
inferred← citeshttps://doi.org/10.1080/09720529.2012.10698392openalex-snapshot
Construction of new codes and its related parameters
inferred← citeshttps://doi.org/10.1109/18.108275openalex-snapshot
Further results on (k, t)-subnormal 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.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.532916openalex-snapshot
A note on bounds for q-ary 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.661507openalex-snapshot
On a new class of codes for identifying vertices in graphs
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.75256openalex-snapshot
Bounds for abnormal binary codes with covering radius one
inferred← citeshttps://doi.org/10.1109/18.79926openalex-snapshot
Upper bounds for q-ary covering codes
inferred← citeshttps://doi.org/10.1109/18.86975openalex-snapshot
On (k, t)-subnormal covering codes
inferred← citeshttps://doi.org/10.1109/isit.1994.394922openalex-snapshot
Long binary narrow-sense BCH codes are normal
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.