On the public citation graph

Constructions of codes with covering radius 2

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/18.42181openalex-snapshot
Short codes with a given covering radius
inferredcites →https://doi.org/10.1109/18.61146openalex-snapshot
Linear codes with covering radius 2 and other new covering codes
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

What points at this work

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

inferred← citeshttps://doi.org/10.1006/ffta.1999.0271openalex-snapshot
New Quaternary Linear Codes with Covering Radius 2
inferred← citeshttps://doi.org/10.1007/s00200-003-0128-2openalex-snapshot
Binary Two-Error-Correcting Codes are Better than Quaternary
inferred← citeshttps://doi.org/10.1007/s002000050061openalex-snapshot
Covering Radius 1985-1994
inferred← citeshttps://doi.org/10.1007/s10623-019-00649-2openalex-snapshot
New covering codes of radius R, codimension tR and $$tR+\frac{R}{2}$$, and saturating sets in projective spaces
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:1008302507816openalex-snapshot
New Constructions of 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.623166openalex-snapshot
Constructions of nonlinear covering codes
inferred← citeshttps://doi.org/10.1109/18.771244openalex-snapshot
Constructions and families of nonbinary linear codes with covering radius 2
inferred← citeshttps://doi.org/10.1109/tit.2026.3716379openalex-snapshot
New Upper Bounds for Binary Linear Covering Codes
inferred← citeshttps://doi.org/10.3934/amc.2011.5.119openalex-snapshot
Linear nonbinary covering codes and saturating sets in projective spaces
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.