RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2011 Volume 47, Issue 3, Pages 10–18 (Mi ppi2051)

This article is cited in 4 papers

Coding Theory

Classification of optimal $(v,4,1)$ binary cyclically permutable constant-weight codes and cyclic $2$-$(v,4,1)$ designs with $v\le76$

T. Baicheva, S. Topalova

Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria

Abstract: We classify up to isomorphism optimal $(v,4,1)$ binary cyclically permutable constant-weight (CPCW) codes with $v\le76$ 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;\lfloor(v-1)/12\rfloor)$ 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.

UDC: 621.391.15

Received: 18.01.2011
Revised: 11.05.2011


 English version:
Problems of Information Transmission, 2011, 47:3, 224–231

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024