2000 character limit reached
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
Published 17 Jul 2008 in cs.IT, cs.DM, math.CO, and math.IT | (0807.2680v1)
Abstract: The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and constant-composition codes. Large classes of group divisible codes are constructed which enabled the determination of the sizes of optimal constant-composition codes of weight three (and specified distance), leaving only four cases undetermined. Previously, the sizes of constant-composition codes of weight three were known only for those of sufficiently large length.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.