On the public citation graph
New lower bounds for constant weight codes
0 signed · 52 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.1002/jgt.3190090104openalex-snapshot
One‐factorizations of the complete graph—A survey
inferredcites →https://doi.org/10.1016/0012-365x(73)90101-5openalex-snapshot
On the maximum number of disjoint Steiner triple systems
inferredcites →https://doi.org/10.1016/0012-365x(74)90003-xopenalex-snapshot
Some packings with Steiner triple systems
inferredcites →https://doi.org/10.1016/0097-3165(73)90082-4openalex-snapshot
Covering all triples on n marks by disjoint Steiner systems
inferredcites →https://doi.org/10.1016/0166-218x(87)90046-1openalex-snapshot
Some lower bounds for constant weight codes
inferredcites →https://doi.org/10.1016/s0019-9958(81)90645-8openalex-snapshot
Spectral enumerators for certain additive-error-correcting codes over integer alphabets
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.1980.1056141openalex-snapshot
Lower bounds for constant weight codes
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.1056318openalex-snapshot
A lower bound forA(n,4,w)(Corresp.)
inferredcites →https://doi.org/10.6100/ir256674openalex-snapshot
Some distance problems in coding theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.20019openalex-snapshot
Upper bounds on the general covering number Cλ(v, k, t, m)
inferred← citeshttps://doi.org/10.1002/jcd.20160openalex-snapshot
Optimal doubly constant weight codes
inferred← citeshttps://doi.org/10.1002/jcd.21401openalex-snapshot
Asymptotic Bounds for General Covering Designs
inferred← citeshttps://doi.org/10.1007/978-0-387-98096-6_12openalex-snapshot
Estimating the size of correcting codes using extremal graph problems
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_2openalex-snapshot
Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs
inferred← citeshttps://doi.org/10.1007/bf01388385openalex-snapshot
Bounds on the sizes of constant weight covering codes
inferred← citeshttps://doi.org/10.1007/bf01418528openalex-snapshot
The last packing number of quadruples, and cyclic SQS
inferred← citeshttps://doi.org/10.1007/s00373-005-0632-1openalex-snapshot
Partition of Triples of Order 6k+5 into 6k+3 Optimal Packings and One Packing of Size 8k+4
inferred← citeshttps://doi.org/10.1007/s10801-009-0191-2openalex-snapshot
Bounds on permutation codes of distance four
inferred← citeshttps://doi.org/10.1016/0097-3165(92)90062-yopenalex-snapshot
Optimal partitions for triples
inferred← citeshttps://doi.org/10.1016/0097-3165(92)90069-7openalex-snapshot
Partitions of triples into optimal packings
inferred← citeshttps://doi.org/10.1016/0166-218x(96)00104-7openalex-snapshot
On the chromatic number, colorings, and codes of the Johnson graph
inferred← citeshttps://doi.org/10.1016/j.disc.2018.12.021openalex-snapshot
Optimal ternary constant-composition codes with weight four and distance three
inferred← citeshttps://doi.org/10.1023/a:1015579729144openalex-snapshot
New Lower Bounds of the Size of Error-Correcting Codes for the Z-Channel
inferred← citeshttps://doi.org/10.1093/comjnl/bxac103openalex-snapshot
On The Maximum Cliques Of The Subgraphs Induced By Binary Constant Weight Codes In Powers Of Hypercubes
inferred← citeshttps://doi.org/10.1108/17427370910991820openalex-snapshot
A non‐constant weight code approach for fast link assessment in multihop wireless mesh networks
inferred← citeshttps://doi.org/10.1109/18.104336openalex-snapshot
New lower bounds for asymmetric and unidirectional codes
inferred← citeshttps://doi.org/10.1109/18.53755openalex-snapshot
Constructions of error-correcting DC-free block codes
inferred← citeshttps://doi.org/10.1109/18.59932openalex-snapshot
A new table of constant weight codes
inferred← citeshttps://doi.org/10.1109/18.623162openalex-snapshot
New single asymmetric error-correcting codes
inferred← citeshttps://doi.org/10.1109/18.623163openalex-snapshot
New constant weight codes from linear permutation groups
inferred← citeshttps://doi.org/10.1109/18.641551openalex-snapshot
Systematic proximity-detecting codes
inferred← citeshttps://doi.org/10.1109/18.651069openalex-snapshot
Greedy and heuristic algorithms for codes and colorings
inferred← citeshttps://doi.org/10.1109/allerton.2013.6736585openalex-snapshot
Improved bounds and constructions for granular media coding
inferred← citeshttps://doi.org/10.1109/isit.1991.695316openalex-snapshot
Trellis Constrained Dc-free Block Codes
inferred← citeshttps://doi.org/10.1109/tit.2003.819339openalex-snapshot
On constant-composition codes over Z/sub q/
inferred← citeshttps://doi.org/10.1109/tit.2015.2445758openalex-snapshot
New Bounds and Constructions for Granular Media Coding
inferred← citeshttps://doi.org/10.1109/tit.2020.2977871openalex-snapshot
Low-Power Cooling Codes With Efficient Encoding and Decoding
inferred← citeshttps://doi.org/10.1142/s0219265923500366openalex-snapshot
On the Maximum Cliques in Powers of Hypercubes
inferred← citeshttps://doi.org/10.12677/aam.2022.113126openalex-snapshot
A Class of Independent Sets of Subgraphs Derived from Constant Focus Sets in Hypercube Power Graphs
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
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.3934/amc.2012.6.165openalex-snapshot
Combinatorial batch codes: A lower bound and optimal constructions
inferred← citeshttps://doi.org/10.46289/sp44pt99openalex-snapshot
Joint Mobilisation and Home-based Rehabilitation for the Treatment of Chronic Ankle Instability: Clinical Investigation and Practitioner Development.
inferred← citeshttps://doi.org/10.48550/arxiv.1004.1503openalex-snapshot
A New Construction for Constant Weight Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1808.09535openalex-snapshot
Low-Power Cooling Codes with Efficient Encoding and Decoding
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.