Weight enumerator of some irreducible cyclic codes
Abstract
In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length n over a finite field Fq, in the case which each prime divisor of n is also a divisor of q-1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.