On the public citation graph
An upper bound on the covering radius as a function of the dual distance
0 signed · 51 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.1007/978-3-662-07998-0openalex-snapshot
Introduction to coding theory
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.59948openalex-snapshot
Asymptotic bounds on the covering radius of binary codes
inferredcites →https://doi.org/10.1109/18.61138openalex-snapshot
Generalization of the Norse bounds to codes of higher strength
inferredcites →https://doi.org/10.1109/tit.1977.1055688openalex-snapshot
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
inferredcites →https://doi.org/10.1109/tit.1978.1055928openalex-snapshot
On the covering radius of binary codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1985.1057033openalex-snapshot
The covering radius of cyclic codes of length up to 31 (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1985.1057043openalex-snapshot
Covering radius---Survey and recent results
inferredcites →https://doi.org/10.1215/s0012-7094-57-02406-7openalex-snapshot
Bounds for exponential sums
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-56686-4_31openalex-snapshot
Bounds for codes as solutions of extremum problems for systems of orthogonal polynomials
inferred← citeshttps://doi.org/10.1007/3-540-60114-7_3openalex-snapshot
On algebraic methods in covering radius problems
inferred← citeshttps://doi.org/10.1007/bfb0034343openalex-snapshot
Saddle point techniques in asymptotic coding theory
inferred← citeshttps://doi.org/10.1007/s00454-008-9128-0openalex-snapshot
Linear Programming Bounds for Codes via a Covering Argument
inferred← citeshttps://doi.org/10.1007/s10801-026-01578-9openalex-snapshot
New bounds on the covering radius of orthogonal arrays of even strength
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90154-8openalex-snapshot
An optimal polynomial for a covering radius problem
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90093-4openalex-snapshot
On upper bounds for code distance and covering radius of designs in polynomial metric spaces
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00134-0openalex-snapshot
On the covering radius of an unrestricted code as a function of the rate and dual distance
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80018-2openalex-snapshot
The Covering Radius of Spherical Designs
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80076-5openalex-snapshot
Diameter, Covering Index, Covering Radius and Eigenvalues
inferred← citeshttps://doi.org/10.1023/a:1008206125050openalex-snapshot
Bounds on Spectra of Codes with Known Dual Distance
inferred← citeshttps://doi.org/10.1023/a:1008260505585openalex-snapshot
On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes
inferred← citeshttps://doi.org/10.1023/a:1009772219312openalex-snapshot
Sato-Tate Conjectures and Chebyshev Polynomials
inferred← citeshttps://doi.org/10.1023/a:1019995105405openalex-snapshot
Bounds on the Covering Radius of Linear 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.243438openalex-snapshot
Covering radius, codimension, and dual-distance width
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.476339openalex-snapshot
Constructions and families of covering codes and saturated sets of points in projective geometry
inferred← citeshttps://doi.org/10.1109/18.568707openalex-snapshot
Estimates for the range of binomiality in codes' spectra
inferred← citeshttps://doi.org/10.1109/18.61138openalex-snapshot
Generalization of the Norse bounds to codes of higher strength
inferred← citeshttps://doi.org/10.1109/18.720545openalex-snapshot
Association schemes and coding theory
inferred← citeshttps://doi.org/10.1109/18.782101openalex-snapshot
On relations between covering radius and dual distance
inferred← citeshttps://doi.org/10.1109/acct51235.2020.9383398openalex-snapshot
On Covering Radius of Orthogonal Arrays
inferred← citeshttps://doi.org/10.1109/isit.1994.394714openalex-snapshot
New upper bounds on the covering radius of codes with known dual distance
inferred← citeshttps://doi.org/10.1109/isit.2006.261650openalex-snapshot
On the PMEPR of Phase-Shifted Binary Codes
inferred← citeshttps://doi.org/10.1109/isit.2015.7282791openalex-snapshot
Weight Distribution of Cosets of Small Codes With Good Dual Properties
inferred← citeshttps://doi.org/10.1109/itw.1998.706420openalex-snapshot
On covering radius and dual distance
inferred← citeshttps://doi.org/10.1109/iwsda50346.2022.9870612openalex-snapshot
Bounds for the Minimum Distance and Covering Radius of Orthogonal Arrays Via Their Distance Distributions
inferred← citeshttps://doi.org/10.1109/lcomm.2010.100410.101341openalex-snapshot
Bounds on the PMEPR of Translates of Binary Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2008.060652openalex-snapshot
On the peak-to-mean envelope power ratio of phase-shifted binary codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2857495openalex-snapshot
On the Covering Radius of Small Codes Versus Dual Distance
inferred← citeshttps://doi.org/10.1137/s0895480100379993openalex-snapshot
Asymptotic Minimum Covering Radius of Block Codes
inferred← citeshttps://doi.org/10.1137/s0895480197331703openalex-snapshot
New Bounds On Covering Radius as a Function of Dual Distance
inferred← citeshttps://doi.org/10.48550/arxiv.2109.02818openalex-snapshot
List-decodable Codes and Covering Codes
inferred← citeshttps://doi.org/10.5555/1455946.1455959openalex-snapshot
The dual distance of a CRC and bounds on the probability of undetected error, the weight distribution, and the covering radius
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.