Maximum weight spectrum codes with reduced length

06/14/2018
by   Gérard D. Cohen, et al.
0

A q-ary linear code of dimension k is called a maximum weight spectrum (MWS) code if it has the maximum possible number (viz. (q^k-1)/(q-1)) of different non-zero weights. We construct MWS codes from quasi-minimal codes, thus obtaining of much shorter length than hitherto known. By an averaging argument, we show the existence of MWS codes of even shorter length.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2020

On the maximum number of minimal codewords

Minimal codewords have applications in decoding linear codes and in cryp...
research
07/30/2021

On weight spectrum of linear codes

We study sequences of linear or affine codes with uniform weight spectru...
research
07/31/2018

A note on full weight spectrum codes

A linear [n,k]_q code C is said to be a full weight spectrum (FWS) c...
research
06/08/2020

Characterisation of the parameters of maximum weight spectrum codes according to their spread

We introduce the concept of spread of a code, and we specialize it to th...
research
04/12/2018

On linear codes and distinct weights

We provide a construction for linear codes attaining the maximum possibl...
research
07/16/2022

MWS and FWS Codes for Coordinate-Wise Weight Functions

A combinatorial problem concerning the maximum size of the (hamming) wei...
research
06/22/2020

The resolution of Niho's last conjecture concerning sequences, codes, and Boolean functions

A new method is used to resolve a long-standing conjecture of Niho conce...

Please sign up or login with your details

Forgot password? Click here to reset