On the public citation graph
Bounds and constructions for ternary constant-composition codes
0 signed · 71 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/0166-218x(93)90141-aopenalex-snapshot
Genetic algorithms in coding theory — a table for A3(n,d)
inferredcites →https://doi.org/10.1016/0167-6377(93)90023-aopenalex-snapshot
The noising method: a new method for combinatorial optimization
inferredcites →https://doi.org/10.1016/0378-3758(84)90062-4openalex-snapshot
On the non-existence of generalised Hadamard matrices
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.1016/s1571-0653(05)80045-9openalex-snapshot
A New Algorithm for the Maximum-Weight Clique Problem
inferredcites →https://doi.org/10.1109/18.59932openalex-snapshot
A new table of 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.887875openalex-snapshot
Constructions of ternary constant-composition codes with weight three
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.1986.1057187openalex-snapshot
Lexicographic codes: Error-correcting codes from game theory
inferredcites →https://doi.org/10.5555/766502.766504openalex-snapshot
A new algorithm for 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/jcd.21304openalex-snapshot
4‐*GDD(6n)s and Related Optimal Quaternary Constant‐Weight Codes
inferred← citeshttps://doi.org/10.1007/11779360_9openalex-snapshot
On the Design of Codes for DNA Computing
inferred← citeshttps://doi.org/10.1007/s10623-006-0004-8openalex-snapshot
A Construction of Optimal Constant Composition Codes
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-012-9746-7openalex-snapshot
Room squares with super-simple property
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-026-01838-6openalex-snapshot
Constructions of quintuple constant-composition codes with weight four and distance three
inferred← citeshttps://doi.org/10.1007/s11425-008-0036-9openalex-snapshot
A new combinatorial approach to the construction of constant composition codes
inferred← citeshttps://doi.org/10.1007/s11432-009-0110-0openalex-snapshot
On the constructions of constant-composition codes from perfect nonlinear functions
inferred← citeshttps://doi.org/10.1016/j.dam.2005.09.009openalex-snapshot
On constant composition codes
inferred← citeshttps://doi.org/10.1016/j.dam.2007.10.028openalex-snapshot
Constructions of optimal GDRP (n,λ;v) ’s of type λ1μm−1
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.2014.10.015openalex-snapshot
Optimal ternary constant-composition codes with weight four and distance six
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.1016/j.jcta.2024.105955openalex-snapshot
Approximate generalized Steiner systems and near-optimal constant weight codes
inferred← citeshttps://doi.org/10.1023/b:desi.0000029212.52214.71openalex-snapshot
Constructions for Permutation Codes in Powerline Communications
inferred← citeshttps://doi.org/10.1023/b:prit.0000011273.98799.a8openalex-snapshot
Enumeration of Optimal Ternary Constant-Composition Codes
inferred← citeshttps://doi.org/10.1080/00207161003611887openalex-snapshot
QPlus: computer package for coding theory research and education
inferred← citeshttps://doi.org/10.1109/cisp.2009.5300948openalex-snapshot
Bounds and Constructions on Optimal Constant Composition Codes
inferred← citeshttps://doi.org/10.1109/ewdts.2019.8884414openalex-snapshot
Ternary Parity Codes: Features
inferred← citeshttps://doi.org/10.1109/ewdts50664.2020.9224826openalex-snapshot
Classification of Errors in Ternary Code Vectors from the Standpoint of Their Use in the Synthesis of Self-Checking Digital Systems
inferred← citeshttps://doi.org/10.1109/isit.2002.1023757openalex-snapshot
Bounds and constructions for q-ary constant composition codes
inferred← citeshttps://doi.org/10.1109/isit.2014.6875070openalex-snapshot
Decompositions of edge-colored digraphs: A new technique in the construction of constant-weight codes and related families
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/iwsda.2009.5346413openalex-snapshot
A new class of constant composition 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.2005.844087openalex-snapshot
Algebraic Constructions of Constant Composition Codes
inferred← citeshttps://doi.org/10.1109/tit.2005.855609openalex-snapshot
A Family of Optimal Constant-Composition Codes
inferred← citeshttps://doi.org/10.1109/tit.2005.855612openalex-snapshot
Combinatorial Constructions of Optimal Constant-Composition Codes
inferred← citeshttps://doi.org/10.1109/tit.2007.901156openalex-snapshot
Ternary Schedules for Energy-Limited Sensor Networks
inferred← citeshttps://doi.org/10.1109/tit.2007.901175openalex-snapshot
The PBD-Closure of Constant-Composition Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.2006420openalex-snapshot
Optimal Constant Composition Codes From Zero-Difference Balanced Functions
inferred← citeshttps://doi.org/10.1109/tit.2008.926349openalex-snapshot
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
inferred← citeshttps://doi.org/10.1109/tit.2008.926380openalex-snapshot
A Construction for Constant-Composition Codes
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.2137370openalex-snapshot
Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five
inferred← citeshttps://doi.org/10.1109/tit.2011.2161631openalex-snapshot
Constant Composition Codes as Subcodes of Cyclic Codes
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.2201692openalex-snapshot
Quaternary Constant-Composition Codes With Weight 4 and Distances 5 or 6
inferred← citeshttps://doi.org/10.1109/tit.2017.2689026openalex-snapshot
Linear Size Constant-Composition Codes Meeting the Johnson Bound
inferred← citeshttps://doi.org/10.1109/tit.2021.3120233openalex-snapshot
A New Construction for Constant-Composition Codes
inferred← citeshttps://doi.org/10.1134/s0032946007040023openalex-snapshot
On the construction of q-ary equidistant codes
inferred← citeshttps://doi.org/10.1137/17m1136171openalex-snapshot
Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families
inferred← citeshttps://doi.org/10.1142/s1793830910000498openalex-snapshot
NEW TERNARY AND QUATERNARY CONSTANT-WEIGHT EQUIDISTANT CODES
inferred← citeshttps://doi.org/10.1360/03ye0371openalex-snapshot
Some new optimal quaternary constant weight codes
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.2183openalex-snapshot
Two Classes of Optimal Constant Composition Codes from Zero Difference Balanced Functions
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.839openalex-snapshot
Two Classes of New Zero Difference Balanced Functions from Difference Balanced Functions and Perfect Ternary Sequences
inferred← citeshttps://doi.org/10.17586/0021-3454-2020-63-5-391-404openalex-snapshot
Errors in ternary code vectors, their classification and detection using noise-resistant coding
inferred← citeshttps://doi.org/10.17586/0021-3454-2021-64-6-433-443openalex-snapshot
Ternary code with summation in an asymmetric number system for the synthesis of controllable and self-checking digital systems
inferred← citeshttps://doi.org/10.31114/2078-7707-2020-1-119-125openalex-snapshot
Ternary sum codes and their modifications
inferred← citeshttps://doi.org/10.37236/1726openalex-snapshot
Bounds for DNA Codes with Constant GC-Content
inferred← citeshttps://doi.org/10.4236/iim.2012.23021openalex-snapshot
Lexicographic Constant-Weight Equidistant Codes over the Alphabet of Three, Four and Five Elements
inferred← citeshttps://doi.org/10.48550/arxiv.1401.3925openalex-snapshot
Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families
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.