Codes with few weights arising from linear sets
In this paper, a class of linear codes with few weights arising from a special type of linear sets is presented. The authors show that h-scattered linear sets of maximum rank provide families of point sets with few intersection numbers with respect to hyperplanes, yielding codes (equipped with Hamming distance) with few weights. In addition, the weight of such codes, their weight enumerators and possible choices for their generator matrices are derived. In particular, it is shown how this general construction yields to obtain linear codes with three weights which are almost MDS codes.
- Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes
- Constructions for several classes of few-weight linear codes and their applications
- A class of two or three weights linear codes and their complete weight enumerators
- The weight distributions of several classes of few-weight linear codes
- Constructions of several classes of linear codes with a few weights
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A coding theory construction of new systematic authentication codes
- A new family of linear maximum rank distance codes
- A new family of maximum scattered linear sets in \(\mathrm{PG}(1,q^6)\)
- A new family of MRD-codes
- A note on full weight spectrum codes
- Algebraic geometric codes. Basic notions
- Almost MDS codes
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Automorphism groups of Gabidulin-like codes
- Bilinear forms over a finite field, with applications to coding theory
- Cyclotomic Linear Codes of Order 3
- Generalising the scattered property of subspaces
- Generalized twisted Gabidulin codes
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- Intersection sets, three-character multisets and associated codes
- Linear sets from projection of Desarguesian spreads
- Linearized polynomials over finite fields revisited
- MRD codes with maximum idealizers
- MRD-codes and linear sets
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\)
- New maximum scattered linear sets of the projective line
- On kernels and nuclei of rank metric codes
- On sets with few intersection numbers in finite projective and affine spaces
- On the number of roots of some linearized polynomials
- Rank-metric codes, linear sets, and their duality
- Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
- Scattered spaces with respect to spreads, and eggs in finite projective spaces
- Scattered subspaces and related codes
- Secret sharing using near-MDS codes
- The Geometry of Two-Weight Codes
- Theory of codes with maximum rank distance
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- Three-weight cyclic codes and their weight distributions
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\)
- Small sets of even type and codewords
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- How many weights can a linear code have?
- Scattered subspaces and related codes
- On Baer cones in \(\mathrm{PG}(3,q)\)
- scientific article; zbMATH DE number 238421 (Why is no real title available?)
- Several classes of linear codes with few weights over finite fields
- Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals
- Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes
- Saturating systems and the rank-metric covering radius
This page was built for publication: Codes with few weights arising from linear sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6112236)