Two-weight and three-weight linear codes based on Weil sums
arXiv:1612.07060 · doi:10.1016/j.ffa.2019.02.001
Abstract
Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their weight distributions are determined using Weil sums. Some of the linear codes obtained are optimal or almost optimal with respect to the Griesmer bound.
Cited by in corpus (6)
- Weight distributions and weight hierarchies of two classes of binary linear codes
- Weight hierarchies and weight distributions of a familiy of -ary linear codes
- Binary linear codes with few weights from Boolean functions
- Complete weight enumerators for several classes of two-weight and three-weight linear codes
- Two new classes of projective two-weight linear codes
- A class of two or three weights linear codes and their complete weight enumerators