Isomorphism problem for relational structures with a cyclic automorphism
European Journal of Combinatorics
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
Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
Further progress on difference families with block size 4 or 5
Designs, Codes and Cryptography
New results on optimal (v, 4, 2, 1) optical orthogonal codes
Designs, Codes and Cryptography
Optical orthogonal codes: their bounds and new optimal constructions
IEEE Transactions on Information Theory
Combinatorial constructions of optimal optical orthogonal codes with weight 4
IEEE Transactions on Information Theory
Constructions for optimal constant weight cyclically permutable codes and difference families
IEEE Transactions on Information Theory
New constructions of optimal cyclically permutable constant weight codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We classify up to isomorphism optimal (v, 4, 1) binary cyclically permutable constantweight (CPCW) codes with v 驴 76 and cyclic 2-(73, 4, 1) and 2-(76, 4, 1) designs. There is a one-to-one correspondence between optimal (v, 4, 1) CPCW codes, optimal cyclic binary constant-weight codes with weight 4 and minimum distance 6, (v, 4; 驴(v 驴 1)/12驴) difference packings, and optimal (v, 4, 1) optical orthogonal codes. Therefore, the classification of CPCW codes holds for them too. Perfect (v, 4, 1) CPCWcodes are equivalent to (v, 4, 1) cyclic difference families, and thus (73, 4, 1) cyclic difference families are classified too.