Svetlana Topalova

Learn More
We classify up to multiplier equivalence optimal (v, 3, 1) binary cyclically permutable constant weight (CPCW) codes with v ≤ 61. There is a one-to-one correspondence between optimal (v, 3, 1) CPCW codes, optimal cyclic binary constant weight codes with weight 3 and minimal distance 4, (v, 3; (v − 1)/6) difference packings, and optimal (v, 3, 1) optical(More)
Classifications of (v, k, 1) cyclic difference families (CDFs) by other authors are known for k = 3 and v ≤ 57, k = 4 and v ≤ 64, k = 5 and v ≤ 65, k = 6 and v = 91 and k = 7 and v = 91. In this work we construct all inequivalent (v, k, 1) CDFs (respectively all multiplier inequivalent cyclic 2-(v, k, 1) designs) with k ≤ 11 and some small v by a computer(More)