On the public citation graph
New constant weight codes from linear permutation groups
0 signed · 36 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(76)90030-3openalex-snapshot
t-designs on hypergraphs
inferredcites →https://doi.org/10.1016/0021-9991(90)90201-bopenalex-snapshot
Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
inferredcites →https://doi.org/10.1016/s0019-9958(79)90329-2openalex-snapshot
On the theory of binary asymmetric error correcting codes
inferredcites →https://doi.org/10.1023/a:1008315701179openalex-snapshot
Codes from Affine Permutation Groups
inferredcites →https://doi.org/10.1063/1.3060528openalex-snapshot
Linear Groups with an Exposition of the Galois Field Theory
inferredcites →https://doi.org/10.1109/18.149514openalex-snapshot
New lower bounds for binary codes of asymmetric distance two
inferredcites →https://doi.org/10.1109/18.21262openalex-snapshot
Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6
inferredcites →https://doi.org/10.1109/18.45293openalex-snapshot
New lower bounds for constant weight codes
inferredcites →https://doi.org/10.1109/18.59932openalex-snapshot
A new table of constant weight codes
inferredcites →https://doi.org/10.1109/tit.1959.1057489openalex-snapshot
Single error-correcting codes for asymmetric binary channels
inferredcites →https://doi.org/10.1109/tit.1973.1054954openalex-snapshot
A class of codes for asymmetric channels and a problem from the additive theory of numbers
inferredcites →https://doi.org/10.1109/tit.1978.1055827openalex-snapshot
Bounds for binary codes of length less than 25
inferredcites →https://doi.org/10.1109/tit.1980.1056190openalex-snapshot
Some new constant weight codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1980.1056191openalex-snapshot
A few new constant weight codes
inferredcites →https://doi.org/10.1109/tit.1981.1056290openalex-snapshot
Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057277openalex-snapshot
Using simulated annealing to design good codes
inferredcites →https://doi.org/10.1287/moor.12.3.522openalex-snapshot
On the Maximum Weight Clique Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6610(1999)7:3<217::aid-jcd5>3.0.co;2-wopenalex-snapshot
New coverings oft-sets with (t + 1)-sets
inferred← citeshttps://doi.org/10.1007/s11128-024-04573-wopenalex-snapshot
Quantum search algorithm for binary constant weight codes
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00439-0openalex-snapshot
Several classes of (2m−1,w,2) optical orthogonal codes
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00159-3openalex-snapshot
Several Classes of (2m − 1, w, 2) Optical Orthogonal Codes
inferred← citeshttps://doi.org/10.1023/a:1008315701179openalex-snapshot
Codes from Affine Permutation Groups
inferred← citeshttps://doi.org/10.1023/a:1008375603014openalex-snapshot
Automorphisms of Constant Weight Codes and of Divisible Designs
inferred← citeshttps://doi.org/10.1109/18.651061openalex-snapshot
Maximum disjoint bases and constant-weight codes
inferred← citeshttps://doi.org/10.1109/18.651069openalex-snapshot
Greedy and heuristic algorithms for codes and colorings
inferred← citeshttps://doi.org/10.1109/icccnt51525.2021.9579935openalex-snapshot
Heuristics for the Generalized Graph Coloring Problem
inferred← citeshttps://doi.org/10.1109/tcomm.2003.822724openalex-snapshot
Cyclotomic Optical Orthogonal Codes of Composite Lengths
inferred← citeshttps://doi.org/10.1137/1.9781611976472.10openalex-snapshot
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
inferred← citeshttps://doi.org/10.1155/2023/9431476openalex-snapshot
A Bit-Parallel Tabu Search Algorithm for Finding Es2 -Optimal and Minimax-Optimal Supersaturated Designs
inferred← citeshttps://doi.org/10.3390/math10244703openalex-snapshot
Latin Matchings and Ordered Designs OD(n−1, n, 2n−1)
inferred← citeshttps://doi.org/10.3934/amc.2011.5.417openalex-snapshot
Some new distance-4 constant weight codes
inferred← citeshttps://doi.org/10.5555/766502.766504openalex-snapshot
A new algorithm for the maximum-weight clique problem
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.