A Class of Linear Codes with a Few Weights

Abstract

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of linear codes with a few weights over the finite field $\gf(p)$ are presented and their weight distributions are also determined, where $p$ is an odd prime. Some of the linear codes obtained are optimal in the sense that they meet certain bounds on linear codes.

arXiv admin note: text overlap with arXiv:1503.06512 by other authors

References in corpus (5)

• Effects of ferroelectric polarization on surface phase diagram: an evolutionary algorithm study of the BaTiO${}_3$(001) surface
• A Construction of Binary Linear Codes from Boolean Functions
• A Class of Linear Codes With Three Weights
• Linear codes with two or three weights from weakly regular bent functions
• A class of three-weight and five-weight linear codes

Cited by in corpus (1)

• Linear codes with a few weights from inhomogeneous quadratic functions