A note on full weight spectrum codes

07/31/2018
by   Tim L. Alderson, et al.
0

A linear [n,k]_q code C is said to be a full weight spectrum (FWS) code if there exist codewords of each nonzero weight less than or equal to n . In this brief communication we determine necessary and sufficient conditions for the existence of linear [n,k]_q full weight spectrum (FWS) codes. Central to our approach is the geometric view of linear codes, whereby columns of a generator matrix correspond to points in PG(k-1,q) .

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2023

The weight spectrum of several families of Reed-Muller codes

We determine the weight spectrum of RM(m-3,m) for m≥ 6, of RM(m-4,m) for...
research
06/14/2018

Maximum weight spectrum codes with reduced length

A q-ary linear code of dimension k is called a maximum weight spectrum (...
research
07/30/2021

On weight spectrum of linear codes

We study sequences of linear or affine codes with uniform weight spectru...
research
08/15/2021

Approximate MDS Property of Linear Codes

In this paper, we study the weight spectrum of linear codes with super-l...
research
03/06/2018

Predictability of sequences and subsequences with spectrum degeneracy at periodically located points

The paper established sufficient conditions of predictability with degen...
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
07/02/2021

PIR codes from combinatorial structures

A k-server Private Information Retrieval (PIR) code is a binary linear [...

Please sign up or login with your details

Forgot password? Click here to reset