Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six
From MaRDI portal
Publication:6231328
arXiv1202.6447MaRDI QIDQ6231328FDOQ6231328
Authors: Mingzhi Zhu, Gennian Ge 
Publication date: 29 February 2012
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 quaternary constant-composition codes with Hamming weight four and minimum distances five or six through group divisible codes and Room square approaches. The problem is solved leaving only five lengths undetermined. Previously, the results on the sizes of such quaternary constant-composition codes were scarce.
This page was built for publication: Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6231328)
