Constructions of optimal GDRP(n,λ;v)'s of type λ1µm-1

Authors:
Jie Yan;Jianxing Yin
Affiliations:
School of Science, Jiangnan University, Wuxi, 214122, China;Department of Mathematics, Suzhou University, Suzhou, 215006, China
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 12
Cited 2

Design theory

Design theory
Frames for Kirkman triple systems

Discrete Mathematics
Constructions for generalized balanced tournament designs

Discrete Mathematics
Constructions for Permutation Codes in Powerline Communications

Designs, Codes and Cryptography
A Construction of Optimal Constant Composition Codes

Designs, Codes and Cryptography
On constant composition codes

Discrete Applied Mathematics
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Bounds and constructions for ternary constant-composition codes

IEEE Transactions on Information Theory
On constant-composition codes over Zq

IEEE Transactions on Information Theory
Permutation arrays for powerline communication and mutually orthogonal latin squares

IEEE Transactions on Information Theory
Algebraic constructions of constant composition codes

IEEE Transactions on Information Theory
Combinatorial constructions of optimal constant-composition codes

IEEE Transactions on Information Theory

Generalized balanced tournament designs and related codes

Designs, Codes and Cryptography
A class of optimal constant composition codes from GDRPs

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.04

Visualization

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 @l^1@m^m^-^1. As a consequence, a new series of optimal CCCs is obtained.