Additive cyclic codes over mixed alphabets and the football pool problem
Motivated by a generalization of the football pool problem, we introduce additive cyclic codes over mixed alphabets of the form Fq1×Fq2 where q1=pm11, q2=pm22 for distinct primes p1,p2. We study their algebraic properties, generating sets, and duals. Additionally, we give examples of additive cyclic codes over the alphabet Z2Z3 that have best-known or optimal parameters.
Discrete Mathematics, Algorithms and Applications