Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\). (Q764400): Difference between revisions

The authors study the problem of classifying cyclic \(2\)-\((v,4,1)\) packing designs (of maximum size) up to isomorphism, and extend earlier work by settling this problem by computer for \(v \leq 76\). Results are thereby obtained also for other closely related or equivalent structures, including cyclic \(2\)-\((v,4,1)\) designs, cyclic \((v,4,1)\) optical orthogonal codes, and cyclic \((v,4,1)\) difference families. The subtle differences between these structures, also with respect to the relevant symmetries (isomorphism, multiplier equivalence), necessitate care when interpreting the results.