Weight distributions of two classes of linear codes
Abstract
In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums. In some case, there is an almost optimal code with respect to Griesmer bound, which is also an optimal one according to the online code table. The linear codes can also be employed to get secret sharing schemes.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.