On the public citation graph

Ternary Constant Weight Codes

0 signed · 53 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.1002/(sici)1520-6610(1999)7:6<441::aid-jcd5>3.0.co;2-wopenalex-snapshot
Generalized steiner triple systems with group size five
inferredcites →https://doi.org/10.1007/3-540-46796-3_45openalex-snapshot
On Binary/Ternary Error-Correcting Codes with Minimum Distance 4
inferredcites →https://doi.org/10.1007/bf02876026openalex-snapshot
Maximum distance holey packings and related codes
inferredcites →https://doi.org/10.1016/0012-365x(95)00333-ropenalex-snapshot
Optimal constant weight codes over Zk and generalized designs
inferredcites →https://doi.org/10.1016/0166-218x(93)90141-aopenalex-snapshot
Genetic algorithms in coding theory — a table for A3(n,d)
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1016/s1571-0653(05)00757-2openalex-snapshot
A New Algorithm for the Maximum-Weight Clique Problem
inferredcites →https://doi.org/10.1023/a:1008314009092openalex-snapshot
On Perfect Ternary Constant Weight Codes
inferredcites →https://doi.org/10.1023/a:1008361925021openalex-snapshot
A Class of Perfect Ternary Constant-Weight Codes
inferredcites →https://doi.org/10.1023/b:prit.0000043927.19508.8bopenalex-snapshot
The Nonexistence of Ternary [284, 6, 188] Codes
inferredcites →https://doi.org/10.1109/18.59932openalex-snapshot
A new table of constant weight codes
inferredcites →https://doi.org/10.1109/18.623164openalex-snapshot
A lower bound for ternary constant weight codes
inferredcites →https://doi.org/10.1109/18.651001openalex-snapshot
Bounds on mixed binary/ternary codes
inferredcites →https://doi.org/10.1109/18.651060openalex-snapshot
On the constructions of constant-weight codes
inferredcites →https://doi.org/10.1109/18.887851openalex-snapshot
Upper bounds for constant-weight codes
inferredcites →https://doi.org/10.1109/18.959279openalex-snapshot
A table of upper bounds for binary codes
inferredcites →https://doi.org/10.1109/18.971741openalex-snapshot
Bounds and constructions for ternary constant-composition codes
inferredcites →https://doi.org/10.1109/isit.2000.866434openalex-snapshot
Error-correcting codes over an alphabet of four elements
inferredcites →https://doi.org/10.1109/tit.1962.1057714openalex-snapshot
A new upper bound for error-correcting codes
inferredcites →https://doi.org/10.1112/s1461157000000115openalex-snapshot
On Transitive Permutation Groups

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.21304openalex-snapshot
4‐*GDD(6n)s and Related Optimal Quaternary Constant‐Weight Codes
inferred← citeshttps://doi.org/10.1002/jcd.21568openalex-snapshot
Optimal cyclic quaternary constant‐weight codes of weight three
inferred← citeshttps://doi.org/10.1007/978-0-8176-8092-3_5openalex-snapshot
Large Monochromatic Components in Edge Colorings of Graphs: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1_14openalex-snapshot
On a Class of Optimal Constant Weight Codes
inferred← citeshttps://doi.org/10.1007/s00373-022-02481-3openalex-snapshot
Improved Monochromatic Double Stars in Edge Colorings
inferred← citeshttps://doi.org/10.1007/s10623-010-9411-yopenalex-snapshot
Completely reducible super-simple designs with block size four and related super-simple packings
inferred← citeshttps://doi.org/10.1007/s10623-014-9919-7openalex-snapshot
Hanani triple packings and optimal $$q$$ q -ary codes of constant weight three
inferred← citeshttps://doi.org/10.1007/s10623-014-9924-xopenalex-snapshot
New inequalities for $$q$$ q -ary constant-weight codes
inferred← citeshttps://doi.org/10.1007/s10623-014-9979-8openalex-snapshot
Completely reducible super-simple designs with block size five and index two
inferred← citeshttps://doi.org/10.1007/s10623-022-01006-6openalex-snapshot
The completion of optimal cyclic quaternary codes of weight 3 and distance 3
inferred← citeshttps://doi.org/10.1007/s10623-022-01096-2openalex-snapshot
On a class of optimal constant weight ternary codes
inferred← citeshttps://doi.org/10.1016/j.disc.2006.06.034openalex-snapshot
Construction of optimal ternary constant weight codes via Bhaskar Rao designs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.037openalex-snapshot
On diameter perfect constant-weight ternary codes
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.019openalex-snapshot
Two-weight codes: Upper bounds and new optimal constructions
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.031openalex-snapshot
Maximal Binary Cliques
inferred← citeshttps://doi.org/10.1016/j.jcta.2023.105790openalex-snapshot
A family of diameter perfect constant-weight codes from Steiner systems
inferred← citeshttps://doi.org/10.1016/j.jcta.2024.105955openalex-snapshot
Approximate generalized Steiner systems and near-optimal constant weight codes
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619681openalex-snapshot
Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound
inferred← citeshttps://doi.org/10.1109/tit.2006.887499openalex-snapshot
Constructions for $q$-Ary Constant-Weight Codes
inferred← citeshttps://doi.org/10.1109/tit.2007.915885openalex-snapshot
The Sizes of Optimal $q$-Ary Codes of Weight Three and Distance Four: A Complete Solution
inferred← citeshttps://doi.org/10.1109/tit.2009.2021366openalex-snapshot
Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
inferred← citeshttps://doi.org/10.1109/tit.2009.2034814openalex-snapshot
Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2043870openalex-snapshot
Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six
inferred← citeshttps://doi.org/10.1109/tit.2011.2179412openalex-snapshot
Optimal Ternary Constant-Weight Codes With Weight 4 and Distance 5
inferred← citeshttps://doi.org/10.1109/tit.2012.2227681openalex-snapshot
Optimal Quaternary Constant-Weight Codes With Weight Four and Distance Five
inferred← citeshttps://doi.org/10.1109/tit.2016.2613120openalex-snapshot
Cyclic Constant-Weight Codes: Upper Bounds and New Optimal Constructions
inferred← citeshttps://doi.org/10.1109/tit.2021.3125277openalex-snapshot
Non-Binary Diameter Perfect Constant-Weight Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3563973openalex-snapshot
On Low-Power Error-Correcting Cooling Codes With Large Distances
inferred← citeshttps://doi.org/10.1360/03ye0371openalex-snapshot
Some new optimal quaternary constant weight codes
inferred← citeshttps://doi.org/10.25439/rmt.27582606openalex-snapshot
Properties of trace maps and their applications to coding theory
inferred← citeshttps://doi.org/10.3390/math10050740openalex-snapshot
Enumeration of Optimal Equidistant Codes
inferred← citeshttps://doi.org/10.37236/1726openalex-snapshot
Bounds for DNA Codes with Constant GC-Content
inferred← citeshttps://doi.org/10.48550/arxiv.1709.03424openalex-snapshot
Constant-Weight Array 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.