Optimal ternary constant-composition codes with weight four and distance three
type: Item
instance of: scholarly article
title: Optimal ternary constant-composition codes with weight four and distance three
zbMATH Open document ID: 1405.05020
author: Miao Liang
author: Lijun Ji
published in: Discrete Mathematics
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 05B07
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 94B99
zbMATH DE Number: 7027168
zbMATH Keywords: constant-composition code
zbMATH Keywords: overlarge set of packing triple system
zbMATH Keywords: one-factorization
zbMATH Keywords: \(k\)-cycle free
MaRDI profile type: Publication
full work available at URL: j.disc.2018.12.021
OpenAlex ID: W2910778023
cites work: The completion determination of optimal \((3,4)\)-packings
cites work: Enumeration of optimal ternary constant-composition codes
cites work: A new table of constant weight codes
cites work: Large sets of disjoint packings on \(6k+5\) points
cites work: A completion of \(LS(2^n4^1)\)
cites work: Large sets of Kirkman triple systems and related designs
cites work: Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
cites work: Improved Lower Bounds for Constant GC-Content DNA Codes
cites work: Further results on large sets of disjoint group-divisible designs
cites work: Q4014422
cites work: Q4201562
cites work: On constant composition codes
cites work: Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
cites work: Algebraic Constructions of Constant Composition Codes
cites work: Combinatorial Constructions of Optimal Constant-Composition Codes
cites work: Optimal partitions for triples
cites work: Partitions of triples into optimal packings
cites work: Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five
cites work: On Quadruple Systems
cites work: The fundamental construction for 3-designs
cites work: Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\)
cites work: Existence of Steiner quadruple systems with a spanning block design
cites work: A complete solution to existence of H designs
cites work: Q4222140
cites work: On large sets of disjoint Steiner triple systems. I
cites work: On large sets of disjoint Steiner triple systems. IV
cites work: \(k\)-cycle free one-factorizations of complete graphs
cites work: Coding and Cryptography
cites work: Q5284089
cites work: The existence of simple \(S_ 3(3,4,\nu)\)
cites work: Q3829472
cites work: Q4000777
cites work: Maximal consistent families of triples
cites work: Constructions of ternary constant-composition codes with weight three
cites work: Bounds and constructions for ternary constant-composition codes
cites work: A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
cites work: Some new 2-resolvable Steiner quadruple systems
cites work: New lower bounds for constant weight codes
cites work: Optimal ternary constant-composition codes with weight four and distance six
cites work: Quaternary Constant-Composition Codes With Weight 4 and Distances 5 or 6
Wikidata QID: Q128585103
DOI: 10.1016/J.DISC.2018.12.021
description: scientific article; zbMATH DE number 7027168