Skip to Content

2 Results Found

  • Article
  • Open Access
1 Citations
802 Views
15 Pages

1 January 2026

The problem of the existence of optimal (v,k,1) binary cyclically permutable constant-weight (CPCW) codes has been completely solved for codeword weights k<5. We consider the smallest open cases, namely k=5 and k=6. We present such codes for small...

(This article belongs to the Special Issue Computational Algebra, Coding Theory and Cryptography: Theory and Applications, 2nd Edition)
  • Article
  • Open Access
321 Views
17 Pages

11 September 2026

We derive necessary conditions for the existence of optimal (k(k−1)s+2,k,1) binary cyclically permutable constant weight codes with length divisible by 2n, where n≥2. This is achieved by counting in different ways the pairs of points in the...

(This article belongs to the Special Issue Computational Algebra, Coding Theory and Cryptography: Theory and Applications, 3rd Edition)