On the public citation graph
Short codes with a given covering radius
0 signed · 75 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.1016/0012-365x(81)90166-7openalex-snapshot
The smallest length of binary 7–dimensional linear codes with prescribed minimum distance
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/tit.1962.1057714openalex-snapshot
A new upper bound for error-correcting 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
inferredcites →https://doi.org/10.1112/s0024609399346154openalex-snapshot
PROJECTIVE GEOMETRIES OVER FINITE FIELDS
inferredcites →https://doi.org/10.1147/rd.45.0532openalex-snapshot
A Bound for Error-Correcting 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/eujc.1999.0373openalex-snapshot
On Saturating Sets in Small Projective Geometries
inferred← citeshttps://doi.org/10.1006/ffta.1999.0271openalex-snapshot
New Quaternary Linear Codes with Covering Radius 2
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/3-540-57843-9_7openalex-snapshot
The length function: A revised table
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/bfb0034337openalex-snapshot
Constructions of codes with covering radius 2
inferred← citeshttps://doi.org/10.1007/s00022-016-0335-1openalex-snapshot
A construction of small complete caps in projective spaces
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/s10623-009-9322-yopenalex-snapshot
Linear codes with covering radius 3
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.1007/s10623-021-00850-2openalex-snapshot
On the Resilience of Even-Mansour to Invariant Permutations
inferred← citeshttps://doi.org/10.1007/s10623-022-01126-zopenalex-snapshot
Guest editorial: On coding theory and combinatorics—in memory of Vera Pless
inferred← citeshttps://doi.org/10.1007/s10623-025-01628-6openalex-snapshot
The geometry of covering codes in the sum–rank metric
inferred← citeshttps://doi.org/10.1007/s10623-025-01704-xopenalex-snapshot
On maximal orthogonal partial Latin squares and minimal codes with specified length, minimum distance and covering radius
inferred← citeshttps://doi.org/10.1007/s10801-023-01269-9openalex-snapshot
Saturating systems and the rank-metric covering radius
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90004-zopenalex-snapshot
Spanning sets and scattering sets in Steiner triple systems
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102535openalex-snapshot
Linear codes from planar functions and related covering codes
inferred← citeshttps://doi.org/10.1016/j.jcta.2005.06.003openalex-snapshot
Minimal 1-saturating sets and complete caps in binary projective spaces
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80125-4openalex-snapshot
Some Optimal Codes from Algebraic Geometry and Their Covering Radii
inferred← citeshttps://doi.org/10.1017/cbo9781139506748.003openalex-snapshot
The geometry of covering codes: small complete caps and saturating sets in Galois spaces
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.1090/s0025-5718-1991-1079013-8openalex-snapshot
Covering Radius Computations for Binary Cyclic Codes
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.179360openalex-snapshot
Constructions for perfect mixed codes and other covering codes
inferred← citeshttps://doi.org/10.1109/18.2644openalex-snapshot
Lower bounds for binary 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.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.623166openalex-snapshot
Constructions of nonlinear covering codes
inferred← citeshttps://doi.org/10.1109/18.75252openalex-snapshot
Binary (18,11)2 codes do not exist-Nor do (64,53)2 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/18.904551openalex-snapshot
Linear codes with covering radius R=2, 3 and codimension tR
inferred← citeshttps://doi.org/10.1109/71.494628openalex-snapshot
Resource allocation in cube network systems based on the covering radius
inferred← citeshttps://doi.org/10.1109/africon51333.2021.9570857openalex-snapshot
A quantum algorithm for single parity check code
inferred← citeshttps://doi.org/10.1109/icpp.1993.125openalex-snapshot
On Resources Allocation in Binary n-Cube Network Systems
inferred← citeshttps://doi.org/10.1109/isit.1993.748685openalex-snapshot
Constructive Non-Existence Proofs for Linear Covering Codes
inferred← citeshttps://doi.org/10.1109/isit.2004.1365490openalex-snapshot
Quasi-perfect codes with small distance
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174459openalex-snapshot
Array Codes for Functional PIR and Batch Codes
inferred← citeshttps://doi.org/10.1109/red.2016.7779320openalex-snapshot
New upper bounds on the smallest size of a saturating set in a projective plane
inferred← citeshttps://doi.org/10.1109/tcsi.2025.3586477openalex-snapshot
Modular, Low-Cost Bus and ECC Encoders for Memory Macros Under Maximal Power Constraints
inferred← citeshttps://doi.org/10.1109/tit.2004.825503openalex-snapshot
Linear Codes With Covering Radius $2$ , $3$ and Saturating Sets in Projective Geometry
inferred← citeshttps://doi.org/10.1109/tit.2005.856944openalex-snapshot
Quasi-Perfect Codes With Small Distance
inferred← citeshttps://doi.org/10.1109/tit.2005.859297openalex-snapshot
Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
inferred← citeshttps://doi.org/10.1109/tit.2007.894688openalex-snapshot
Quasi-Perfect Linear Codes With Minimum Distance $4$
inferred← citeshttps://doi.org/10.1109/tit.2014.2385084openalex-snapshot
On the Covering Radius of MDS Codes
inferred← citeshttps://doi.org/10.1109/tit.2026.3697241openalex-snapshot
Double Error Correcting Codes for Memory Macros Under Strict Instantaneous Power Constraints
inferred← citeshttps://doi.org/10.1109/tit.2026.3716379openalex-snapshot
New Upper Bounds for Binary Linear Covering Codes
inferred← citeshttps://doi.org/10.23919/date64628.2025.10993067openalex-snapshot
PESEC – A Simple Power-Efficient Single Error Correcting Coding Scheme for RRAM
inferred← citeshttps://doi.org/10.3233/978-1-60750-663-8-38openalex-snapshot
Applications of finite geometry in coding theory and cryptography
inferred← citeshttps://doi.org/10.3934/amc.2011.5.119openalex-snapshot
Linear nonbinary covering codes and saturating sets in projective spaces
inferred← citeshttps://doi.org/10.3934/amc.2015.9.63openalex-snapshot
Multiple coverings of the farthest-off points with small density from projective geometry
inferred← citeshttps://doi.org/10.3934/amc.2026.101086openalex-snapshot
On twisted Gabidulin codes with $ \ell $ twists
inferred← citeshttps://doi.org/10.48550/arxiv.1406.5060openalex-snapshot
A probabilistic construction of small complete caps in projective spaces
inferred← citeshttps://doi.org/10.48550/arxiv.1505.01426openalex-snapshot
On upper bounds on the smallest size of a saturating set in a projective plane
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07939openalex-snapshot
Upper bounds on the smallest size of a saturating set in projective planes and spaces of even dimension
inferred← citeshttps://doi.org/10.48550/arxiv.1802.04214openalex-snapshot
Classification of minimal 1-saturating sets in PG(v, 2), 2 <= v <= 6
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.