Optimal ternary constant-composition codes with weight four and distance three

DOI10.1016/j.disc.2018.12.021zbMath1405.05020OpenAlexW2910778023WikidataQ128585103 ScholiaQ128585103MaRDI QIDQ1727782

Lijun Ji, Miao Liang

Publication date: 20 February 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.12.021

zbMATH Keywords

one-factorizationconstant-composition code\(k\)-cycle freeoverlarge set of packing triple system

Mathematics Subject Classification ID

Paths and cycles (05C38) Triple systems (05B07) Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal ternary constant-composition codes with weight four and distance six
• The completion determination of optimal \((3,4)\)-packings
• A completion of \(LS(2^n4^1)\)
• Large sets of disjoint packings on \(6k+5\) points
• Existence of Steiner quadruple systems with a spanning block design
• On large sets of disjoint Steiner triple systems. IV
• \(k\)-cycle free one-factorizations of complete graphs
• On large sets of disjoint Steiner triple systems. I
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Optimal partitions for triples
• Partitions of triples into optimal packings
• Further results on large sets of disjoint group-divisible designs
• The fundamental construction for 3-designs
• Some new 2-resolvable Steiner quadruple systems
• The existence of simple \(S_ 3(3,4,\nu)\)
• Large sets of Kirkman triple systems and related designs
• Enumeration of optimal ternary constant-composition codes
• On constant composition codes
• Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\)
• Constructions of ternary constant-composition codes with weight three
• Quaternary Constant-Composition Codes With Weight 4 and Distances 5 or 6
• A new table of constant weight codes
• On Quadruple Systems
• New lower bounds for constant weight codes
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Algebraic Constructions of Constant Composition Codes
• Combinatorial Constructions of Optimal Constant-Composition Codes
• Improved Lower Bounds for Constant GC-Content DNA Codes
• Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
• Bounds and constructions for ternary constant-composition codes
• A complete solution to existence of H designs
• Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five
• Maximal consistent families of triples
• Coding and Cryptography

This page was built for publication: Optimal ternary constant-composition codes with weight four and distance three