On the public citation graph

The minimal covering radius t(15,6) of a six-dimensional binary linear code of length 15 is equal to 4

0 signed · 17 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.1109/tit.1985.1057039openalex-snapshot
On the covering radius of codes
inferredcites →https://doi.org/10.1109/tit.1987.1057263openalex-snapshot
Binary even [25,15,6] codes do not exist (Corresp.)

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-51083-4_44openalex-snapshot
Recent results on covering problems
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_73openalex-snapshot
Covering radius: Improving on the sphere-covering bound
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.1016/0012-365x(92)90536-oopenalex-snapshot
Covering machines
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:1008397405457openalex-snapshot
Some Upper Bounds on the Covering Radii of Linear Codes Over Fq and Their Applications
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.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.53754openalex-snapshot
New lower bounds for covering codes
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/isit.1993.748685openalex-snapshot
Constructive Non-Existence Proofs for Linear 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.