On the Existence of Optimal (k(k-1)s2,k,1) Binary Cyclically Permutable Constant Weight Codes+
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 corresponding partial cyclic design whose incidence matrix is equivalent to a matrix containing circulants of order v2m for 0≤m
Authors
- Svetlana Topalova (ORCID: https://orcid.org/0000-0003-3821-4672)
- Tsonka Baicheva (ORCID: https://orcid.org/0000-0002-6493-6188)
- Tsvetyana Yoveva
Institutions
- Bulgarian Academy of Sciences (BG)
- Institute of Mathematics and Informatics (BG)
- Institute of Information and Communication Technologies (BG)
Publication Details
- Journal
- Axioms
- Published
- 2026-09-11
- DOI
- https://doi.org/10.3390/axioms15090679
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Bulgarian National Science Fund