On the public citation graph

Lower bounds for q-ary covering codes

0 signed · 36 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.1016/0097-3165(91)90010-eopenalex-snapshot
Bounds on packings and coverings by spheres inq-ary and mixed Hamming spaces
inferredcites →https://doi.org/10.1016/0097-3165(91)90011-5openalex-snapshot
Generalized bounds on binary/ternary mixed packing and covering codes
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.45285openalex-snapshot
On normal and subnormal q-ary codes
inferredcites →https://doi.org/10.1109/18.75253openalex-snapshot
Modified bounds for covering codes
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-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.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.1007/3-540-46796-3_33openalex-snapshot
Lower Bounds for Group Covering Designs
inferred← citeshttps://doi.org/10.1007/s002000050061openalex-snapshot
Covering Radius 1985-1994
inferred← citeshttps://doi.org/10.1007/s10623-004-3804-8openalex-snapshot
Bounds for Covering Codes over Large Alphabets
inferred← citeshttps://doi.org/10.1007/s12190-024-02288-wopenalex-snapshot
On the number of ideals of the Niederreiter–Rosenbloom–Tsfasman poset and lower bounds on covering codes
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/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/0097-3165(94)90013-2openalex-snapshot
Lower bounds for q-ary coverings by spheres of radius one
inferred← citeshttps://doi.org/10.1016/j.laa.2013.11.034openalex-snapshot
Invariant sets under linear operator and covering codes over modules
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.1023/a:1008228721072openalex-snapshot
A New Table of Binary/Ternary Mixed 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.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.532916openalex-snapshot
A note on bounds for q-ary covering codes
inferred← citeshttps://doi.org/10.1109/18.75253openalex-snapshot
Modified bounds for covering codes
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.37236/1281openalex-snapshot
Ternary Covering Codes
inferred← citeshttps://doi.org/10.37236/222openalex-snapshot
Lower Bounds for $q$-ary Codes with Large Covering Radius
inferred← citeshttps://doi.org/10.37236/4974openalex-snapshot
The Covering Problem in Rosenbloom-Tsfasman Spaces
inferred← citeshttps://doi.org/10.48550/arxiv.2003.09537openalex-snapshot
Covering the Relational Join
inferred← citeshttps://doi.org/10.5802/jtnb.183openalex-snapshot
A new lower bound for the football pool problem for 7 matches
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.