Two classes of linear codes with a few weights based on twisted Kloosterman sums

01/17/2019
by   Minglong Qi, et al.
0

Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters are an important research topic in coding theory. In this paper, we construct two classes of linear codes with a few weights and determine their complete weight enumerators based on twisted Kloosterman sums.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2017

On the complete weight enumerators of some linear codes with a few weights

Linear codes with a few weights have important applications in authentic...
research
04/12/2018

On linear codes and distinct weights

We provide a construction for linear codes attaining the maximum possibl...
research
11/23/2018

A class of linear codes with few weights

Linear codes have been an interesting topic in both theory and practice ...
research
02/20/2020

Greedy weights for matroids

We introduce greedy weights of matroids, inspired by those for linear co...
research
11/28/2022

Three classes of BCH codes and their duals

BCH codes are an important class of cyclic codes, and have wide applican...
research
03/04/2018

Applied Erasure Coding in Networks and Distributed Storage

The amount of digital data is rapidly growing. There is an increasing us...
research
07/18/2020

Maximal-entropy driven determination of weights in least-square approximation

We exploit the idea to use the maximal-entropy method, successfully test...

Please sign up or login with your details

Forgot password? Click here to reset