Complete Weight Enumerator of a Family of Linear Codes from Cyclotomy

Abstract

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for a prime $p$, we determine the explicit complete weight enumerators of a family of linear codes over ${\mathbb{F}}_p$ with defining set related to cyclotomy. These codes may have applications in cryptography and secret sharing schemes.

13 pages

References in corpus (2)

• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• Complete Weight Enumerators of Some Linear Codes