Article ID Journal Published Year Pages File Type
420759 Discrete Applied Mathematics 2008 13 Pages PDF
Abstract

Generalized doubly resolvable packings (GDRPs) represent a combinatorial characterization of constant composition codes (CCCs). In this paper, we develop a number of general constructions of GDRPs of type λ1μm−1λ1μm−1. As a consequence, a new series of optimal CCCs is obtained.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Constructions of optimal GDRP(n,λ;v)(n,λ;v)’s of type λ1μm−1λ1μm−1
Authors
, ,