Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes
Designs, Codes and Cryptography
Some progress on (v, 4, 1) difference families and optical orthogonal codes
Journal of Combinatorial Theory Series A
Note: Cyclically permutable representations of cyclic codes
Discrete Applied Mathematics
Bounds and constructions of optimal (n, 4, 2, 1) optical orthogonal codes
IEEE Transactions on Information Theory
New upper bound for (m, k, λ)-IRSs with λ ≥ 2
IEEE Transactions on Information Theory
On constructions for optimal two-dimensional optical orthogonal codes
Designs, Codes and Cryptography
IEEE Transactions on Information Theory
New optimal variable-weight optical orthogonal codes
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Construction and applications of CRT sequences
IEEE Transactions on Information Theory
Problems of Information Transmission
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Some 20-regular CDP(5,1;20u) and their applications
Finite Fields and Their Applications
| Hi-index | 755.08 |
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, in. Eluding in optical code-division multiple-access communication systems and in constructing protocol-sequence sets for the M-active-out-of-T users collision channel without feedback. In this paper we construct optimal constant weight cyclically permutable codes with length n, weight w, and a minimum Hamming distance 2w-2. Some of these codes coincide with the well-known design called a difference family. Some of the constructions use combinatorial structures with other applications in coding