Three classes of partitioned difference families and their optimal constant composition codes
نویسندگان
چکیده
منابع مشابه
A Construction of Optimal Constant Composition Codes
In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].
متن کاملConstructions of partitioned difference families
Partitioned difference families (PDFs) arise from constructions of optimum constant composition codes. In this paper, a number of infinite classes of PDFs are constructed, based on known cyclotomic difference families in GF(q). A general approach which obtains PDFs from difference packings and coverings in abelian group is also presented. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملConstructions for optimal constant weight cyclically permutable codes and difference families
A cyclically permutable code is a binary code whose codewords are cyclically distinct and have full cyclic order. An important class of these codes are the constant weight cyclically permutable codes. In a code of this class all codewords have the same weight w. These codes have many applications, including in optical code-division multiple-access communication systems and in constructing proto...
متن کاملOptimal linear codes, constant-weight codes and constant-composition codes over $\Bbb F_{q}$
Optimal linear codes and constant-weight codes play very important roles in coding theory and have attached a lot of attention. In this paper, we mainly present some optimal linear codes and some optimal constant-weight codes derived from the linear codes. Firstly, we give a construction of linear codes from trace and norm functions. In some cases, its weight distribution is completely determin...
متن کاملLinear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
An optimal constant-composition or constant-weight code of weight has linear size if and only if its distance is at least . When , the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances. This paper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2020
ISSN: 1930-5338
DOI: 10.3934/amc.2020120