On the public citation graph

Nonexistence of completely transitive codes with error-correcting capability e<3

0 signed · 27 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.1006/eujc.1999.0313openalex-snapshot
Completely Transitive Codes in Hamming Graphs
inferredcites →https://doi.org/10.1007/bf01112361openalex-snapshot
Transitivity of finite permutation groups on unordered sets
inferredcites →https://doi.org/10.1007/bf01113919openalex-snapshot
k-Homogeneous groups
inferredcites →https://doi.org/10.1016/0012-365x(90)90152-8openalex-snapshot
Completely regular codes and completely transitive codes
inferredcites →https://doi.org/10.1016/0012-365x(92)90565-wopenalex-snapshot
Completely regular codes
inferredcites →https://doi.org/10.1109/18.817528openalex-snapshot
On the nonexistence of completely transitive codes
inferredcites →https://doi.org/10.1112/blms/13.1.1openalex-snapshot
Finite Permutation Groups and Finite Simple Groups
inferredcites →https://doi.org/10.1137/0124010openalex-snapshot
On the Nonexistence of Perfect Codes over Finite Fields
inferredcites →https://doi.org/10.1147/rd.45.0532openalex-snapshot
A Bound for Error-Correcting Codes
inferredcites →https://doi.org/10.1201/9781420049954openalex-snapshot
CRC Handbook of Combinatorial Designs
inferredcites →https://doi.org/10.18910/7296openalex-snapshot
On $t$-designs
inferredcites →https://doi.org/10.4000/msh.2869openalex-snapshot
R. L. Graham, M. Grötschel, L. Lovasz (sous la direction de), "Handbook of combinatorics", Amsterdam, North-Holland, 1995 (2 volumes)
inferredcites →https://doi.org/10.6100/ir162111openalex-snapshot
Uniformly packed 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/s10623-012-9614-5openalex-snapshot
Neighbour transitivity on codes in Hamming graphs
inferred← citeshttps://doi.org/10.1007/s10623-015-0069-3openalex-snapshot
Entry-faithful 2-neighbour transitive codes
inferred← citeshttps://doi.org/10.1007/s10623-019-00609-wopenalex-snapshot
A new distance-regular graph of diameter 3 on 1024 vertices
inferred← citeshttps://doi.org/10.1007/s10623-022-01053-zopenalex-snapshot
Neighbour-transitive codes and partial spreads in generalised quadrangles
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.008openalex-snapshot
On non-antipodal binary completely regular codes
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.004openalex-snapshot
On a class of binary linear completely transitive codes with arbitrary covering radius
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103604openalex-snapshot
On the classification of binary completely transitive codes with almost-simple top-group
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.105173openalex-snapshot
Minimal binary 2-neighbour-transitive codes
inferred← citeshttps://doi.org/10.1016/j.jcta.2023.105850openalex-snapshot
Neighbour-transitive codes in Kneser graphs
inferred← citeshttps://doi.org/10.1109/tit.2009.2034812openalex-snapshot
New Completely Regular $q$-ary Codes Based on Kronecker Products
inferred← citeshttps://doi.org/10.1134/s0032946019010010openalex-snapshot
On Completely Regular Codes
inferred← citeshttps://doi.org/10.37236/4925openalex-snapshot
Distance-Regular Graphs
inferred← citeshttps://doi.org/10.3934/amc.2010.4.567openalex-snapshot
On $q$-ary linear completely regular codes with $\rho=2$ and antipodal dual
inferred← citeshttps://doi.org/10.48550/arxiv.1208.0393openalex-snapshot
Classification of a family of completely transitive 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.