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

DOI10.1016/J.DISC.2014.10.015MaRDI QIDQ482203zbMATH OpenOpenAlexFDO

Authors Hengjia Wei, Hui Zhang, Mingzhi Zhu, Gennian Ge

Publication date 19 December 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.6092

zbMATH Keywords

constant-composition codesgroup divisible codesternary codes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Combinatorial codes (94B25)

Abstract: The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of lengths undetermined. The previously known results are those with code length no greater than 10.

Recommendations

• scientific article; zbMATH DE number 1522575
• Ternary constant weight codes
• Constructions of ternary constant-composition codes with weight three
• Optimal ternary constant-composition codes with weight four and distance three
• Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three

Cites work

• scientific article; zbMATH DE number 5130671 (Why is no real title available?)
• scientific article; zbMATH DE number 3902553 (Why is no real title available?)
• scientific article; zbMATH DE number 140078 (Why is no real title available?)
• scientific article; zbMATH DE number 1109415 (Why is no real title available?)
• scientific article; zbMATH DE number 1498789 (Why is no real title available?)
• scientific article; zbMATH DE number 1522575 (Why is no real title available?)
• A Construction for Constant-Composition Codes
• A Family of Optimal Constant-Composition Codes
• A class of optimal constant composition codes from GDRPs
• A construction of optimal constant composition codes
• A new combinatorial approach to the construction of constant composition codes
• Algebraic Constructions of Constant Composition Codes
• Bounds and constructions for ternary constant-composition codes
• Bounds for DNA codes with constant GC-content
• Coding and Cryptography
• Combinatorial Constructions of Optimal Constant-Composition Codes
• Constructions for permutation codes in powerline communications
• Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
• Constructions of ternary constant-composition codes with weight three
• Enumeration of optimal ternary constant-composition codes
• Equidistant frequency permutation arrays and related constant composition codes
• Frequency permutation arrays
• Generalized balanced tournament designs and related codes
• Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
• Improved Lower Bounds for Constant GC-Content DNA Codes
• Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes
• Mols with holes
• On (\(g\), 4; 1)-difference matrices
• On constant composition codes
• On constant-composition codes over Z/sub q/
• On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
• On the existence of partitionable skew Room frames
• Optimal Constant Composition Codes From Zero-Difference Balanced Functions
• Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five
• Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six
• Optimal grid holey packings with block size 3 and 4
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Resolvable modified group divisible designs with block size three
• Spherical codes generated by binary partitions of symmetric pointsets
• The PBD-Closure of Constant-Composition Codes

Cited in

(11)

• Optimal ternary constant-composition codes with weight four and distance three
• Hanani triple packings and optimal \(q\)-ary codes of constant weight three
• Enumeration of optimal ternary constant-composition codes
• Constructions of ternary constant-composition codes with weight three
• New ternary and quaternary constant-weight equidistant codes
• The PBD-Closure of Constant-Composition Codes
• Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
• scientific article; zbMATH DE number 1522575 (Why is no real title available?)
• Approximate generalized Steiner systems and near-optimal constant weight codes
• Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six
• Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482203)