On the public citation graph
On normal and subnormal q-ary codes
0 signed · 47 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/3-540-16767-6_52openalex-snapshot
On a conjecture concerning coverings of Hamming space
inferredcites →https://doi.org/10.1007/bf01817441openalex-snapshot
Covering Problems for Dichotomized Matching
inferredcites →https://doi.org/10.1007/bf01817562openalex-snapshot
Covering problems for dichotomized matchings
inferredcites →https://doi.org/10.1016/0097-3165(84)90010-4openalex-snapshot
More coverings by rook domains
inferredcites →https://doi.org/10.1016/0097-3165(89)90036-8openalex-snapshot
New upper bounds for the football pool problem for 6, 7, and 8 matches
inferredcites →https://doi.org/10.1016/0097-3165(91)90024-bopenalex-snapshot
Upper bounds for football pool problems and mixed covering codes
inferredcites →https://doi.org/10.1016/s0021-9800(67)80102-9openalex-snapshot
The football pool problem for 5 matches
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.21265openalex-snapshot
A new construction for 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/tit.1985.1057039openalex-snapshot
On the covering radius of 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.1137/0117123openalex-snapshot
Intersection Inequalities for the Covering Problem
inferredcites →https://doi.org/10.1137/0608050openalex-snapshot
On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01388486openalex-snapshot
Bounds for binary multiple covering codes
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90028-zopenalex-snapshot
All binary codes with covering radius one are subnormal
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90556-uopenalex-snapshot
On lengthening of covering codes
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90164-3openalex-snapshot
On the normality of multiple covering codes
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)90011-5openalex-snapshot
Generalized bounds on binary/ternary mixed packing and covering codes
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/0166-218x(94)90141-4openalex-snapshot
On (q, 1)-subnormal q-ary covering codes
inferred← citeshttps://doi.org/10.1080/09720529.2012.10698392openalex-snapshot
Construction of new codes and its related parameters
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.476339openalex-snapshot
Constructions and families of covering codes and saturated sets of points in projective geometry
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.54887openalex-snapshot
Lower bounds for q-ary covering codes
inferred← citeshttps://doi.org/10.1109/18.59947openalex-snapshot
More binary covering codes are normal
inferred← citeshttps://doi.org/10.1109/18.75256openalex-snapshot
Bounds for abnormal binary codes with covering radius one
inferred← citeshttps://doi.org/10.1109/18.79926openalex-snapshot
Upper bounds for q-ary covering codes
inferred← citeshttps://doi.org/10.1109/18.79931openalex-snapshot
A note on perfect multiple coverings of the Hamming space
inferred← citeshttps://doi.org/10.1109/icacci.2013.6637378openalex-snapshot
Normality of binary codes in Rosenbloom-Tsfasman Metric
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206571openalex-snapshot
Access-Redundancy Tradeoffs in Quantized Linear Computations
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619536openalex-snapshot
Non-Binary Covering Codes for Low-Access Computations
inferred← citeshttps://doi.org/10.1109/tit.2024.3425808openalex-snapshot
Access-Redundancy Tradeoffs in Quantized Linear Computations
inferred← citeshttps://doi.org/10.1155/2014/237915openalex-snapshot
On Normal q -Ary Codes in Rosenbloom-Tsfasman Metric
inferred← citeshttps://doi.org/10.1556/sscmath.40.2003.1-2.20openalex-snapshot
On the covering radius of small codes
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
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.