Complete Weight Enumerators of Some Linear Codes
Abstract
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime p, we determine the explicit complete weight enumerators of two classes of linear codes over Fp and they may have applications in cryptography and secret sharing schemes. Moreover, some examples are included to illustrate our results.
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.