Abstract
Motivated by a generalization of the football pool problem, we introduce additive cyclic codes over mixed alphabets of the form [Formula: see text] where [Formula: see text], [Formula: see text] for distinct primes [Formula: see text]. We study their algebraic properties, generating sets, and duals. Additionally, we give examples of additive cyclic codes over the alphabet [Formula: see text] that have best-known or optimal parameters.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have