Optimal ternary constant-composition codes with weight four and distance six
From MaRDI portal
Publication:482203
DOI10.1016/J.DISC.2014.10.015zbMATH Open1309.05043arXiv1409.6092OpenAlexW1981599552MaRDI QIDQ482203FDOQ482203
Authors: Hengjia Wei, Hui Zhang, Mingzhi Zhu, Gennian Ge 
Publication date: 19 December 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1409.6092
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
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Combinatorial codes (94B25)
Cites Work
- Optimal Constant Composition Codes From Zero-Difference Balanced Functions
- On constant composition codes
- Mols with holes
- Bounds for DNA codes with constant GC-content
- A class of optimal constant composition codes from GDRPs
- Constructions for permutation codes in powerline communications
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Algebraic Constructions of Constant Composition Codes
- A Family of Optimal Constant-Composition Codes
- On constant-composition codes over Z/sub q/
- A Construction for Constant-Composition Codes
- Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five
- Coding and Cryptography
- A construction of optimal constant composition codes
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- On (\(g\), 4; 1)-difference matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
- Resolvable modified group divisible designs with block size three
- Title not available (Why is that?)
- Generalized balanced tournament designs and related codes
- Frequency permutation arrays
- Optimal grid holey packings with block size 3 and 4
- Enumeration of optimal ternary constant-composition codes
- On the existence of partitionable skew Room frames
- Constructions of ternary constant-composition codes with weight three
- Combinatorial Constructions of Optimal Constant-Composition Codes
- The PBD-Closure of 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds and constructions for ternary constant-composition codes
- Spherical codes generated by binary partitions of symmetric pointsets
- Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes
- Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six
- Equidistant frequency permutation arrays and related constant composition codes
- A new combinatorial approach to the construction 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
- Title not available (Why is that?)
- 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)
