Mar 11, 2018 · In this work quickly establish the truth of this conjecture. We provide two proofs, each employing different construction techniques. The first ...

... codes of dimension k = 2 . They conjectured that the bound is sharp for all q and k . Codes meeting this bound are called maximum weight spectrum (MWS) codes.

The first relies on the geometric view of linear codes as systems of projective points. The second approach is purely algebraic. We establish some lower bounds ...

This work establishes the truth of the conjecture that the bound is sharp for every prime power q and every positive integer k, and establishes some lower ...

We establish some lower bounds on the length of codes that satisfy the conjecture, and the length of the new codes constructed here are discussed. Keywords: ...

Jun 14, 2018 · 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- ...

Mar 31, 2018 · For fixed k and q only sufficient conditions on n are known for which an MWS code exists [2, 12,26]. The questions relating to maximal weight ...

Title:Maximum Weight Spectrum Codes. Authors:Tim L. Alderson, Alessandro Neri. View a PDF of the paper titled Maximum Weight Spectrum Codes, by Tim L ...

By an averaging argument, this work shows the existence of MWS codes of even shorter length, constructed from quasi-minimal codes, thus obtaining of much ...

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 ...