Name
Abstract | ||
|---|---|---|
As a common generalization of constant weight binary codes and permutation codes, constant composition codes (CCCs) have attracted recent interest due to their numerous applications. In this paper, a class of new CCCs are constructed using design-theoretic techniques. The obtained codes are optimal in the sense of their sizes. This result is established, for the most part, by means of a result on generalized doubly resolvable packings which is of combinatorial interest in its own right. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s10623-008-9214-6 | Des. Codes Cryptography |
Keywords | Field | DocType |
Constant composition codes,Generalized doubly resolvable packings,Optimal,Constructions,05B05,94B25 | Discrete mathematics,Combinatorics,Block code,Permutation,Binary code,Expander code,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
50 | 1 | 0925-1022 |
Citations | PageRank | References |
11 | 0.67 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jie Yan | 1 | 28 | 3.42 |
| Jianxing Yin | 2 | 373 | 30.16 |