2014/04/28 by Fabio Enrique Brochero Martínez, F. E. Brochero Martínez, Martínez, F. E. Brochero +3
Computer Science · Engineering · Mathematics · #12E05(primary) and 94B05(secondary) #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT) #Quantum-Dot Cellular Automata #cs.IT #graph theory and CDMA systems #math.IT #math.NT
paper · pdf · doi:10.48550/arxiv.1404.6851
Submitted to Designs, Codes and Cryptography, 8 pages
openalex publication_date 2014/04/28 · arxiv created 2014/05/08 · arxiv updated 2014/05/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length n over a finite field \mathbb Fq, in the case which each prime divisor of n is also a divisor of q-1.