Maximum weight spectrum codes

DOI10.3934/AMC.2019006MaRDI QIDQ1726015zbMATH OpenOpenAlexWikidataFDO

Authors Alessandro Neri, Tim L. Alderson

Publication date 15 February 2019

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.04020

zbMATH Keywords

algebraic coding theoryHamming weightslinear codesprojective geometryweight spectrum

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Abstract: In the recent work cite{shi18}, a combinatorial problem concerning linear codes over a finite field $F_q$ was introduced. In that work the authors studied the weight set of an $[n,k{]}_q$ linear code, that is the set of non-zero distinct Hamming weights, showing that its cardinality is upper bounded by $frac{q}^k-1q-1$. They showed that this bound was sharp in the case $q=2$, and in the case $k=2$. They conjectured that the bound is sharp for every prime power $q$ and every positive integer $k$. In this work quickly establish the truth of this conjecture. We provide two proofs, each employing different construction techniques. 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 on the length of codes that satisfy the conjecture, and the length of the new codes constructed here are discussed.

Recommendations

• A Bound for the Maximum Weight of a Linear Code
• How many weights can a linear code have?
• On the Maximal Cardinality of Binary Two-weight Codes
• A note on full weight spectrum codes
• On linear codes whose weights and length have a common divisor

Cites work

• Codes with given distances
• Coprimitive sets and inextendable codes
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Finite geometry and combinatorial applications
• Four fundamental parameters of a code and their combinatorial significance
• How Many Weights Can a Cyclic Code Have?
• How many weights can a linear code have?
• scientific article; zbMATH DE number 48941 (Why is no real title available?)
• scientific article; zbMATH DE number 3207776 (Why is no real title available?)
• On binary linear codes whose automorphism group is trivial

Cited in

(10)

• A note on full weight spectrum codes
• On the most weight w vectors in a dimension k binary code
• A tight upper bound on the number of non-zero weights of a constacyclic code
• New upper bounds on the number of non-zero weights of constacyclic codes
• The maximum number of homogeneous weights of linear codes over chain rings
• A tight upper bound on the number of nonzero weights of a quasi-cyclic code
• Some bounds on the cardinality of the b-symbol weight spectrum of codes
• MWS and FWS codes for coordinate-wise weight functions
• Full weight spectrum one-orbit cyclic subspace codes
• On linear codes whose weights and length have a common divisor

This page was built for publication: Maximum weight spectrum codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1726015)