Constructions of cyclic codes and extended primitive cyclic codes with their applications
From MaRDI portal
Publication:6156922
Abstract: Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on special polynomials over finite fields. The first family of linear codes are extended primitive cyclic codes which are affine-invariant. The second family of linear codes are reducible cyclic codes. The parameters of these codes and their duals are determined. As the first application, we prove that these two families of linear codes hold -designs, where . As the second application, the minimum localities of the codes are also determined and optimal locally recoverable codes are derived.
Recommendations
- Constructions of several classes of linear codes with a few weights
- A construction of \(q\)-ary linear codes with irreducible cyclic codes
- Complete weight enumerators of two classes of linear codes with a few weights
- A construction of \(q\)-ary linear codes with two weights
- A class of linear codes with a few weights
Cites work
- An Infinite Family of Linear Codes Supporting 4-Designs
- An Infinite Family of Steiner Systems from Cyclic Codes
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
- Combinatorial \(t\)-designs from quadratic functions
- Combinatorial \(t\)-designs from special functions
- Constructions of near MDS codes which are optimal locally recoverable codes
- Constructions of projective linear codes by the intersection and difference of sets
- Determining the Nonlinearity of a New Family of APN Functions
- Fundamentals of Error-Correcting Codes
- Hamming Weights of the Duals of Cyclic Codes With Two Zeros
- Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
- Infinite Families of Near MDS Codes Holding t-Designs
- Infinite families of 2-designs and 3-designs from linear codes
- Infinite families of 3-designs from a type of five-weight code
- Linear Codes From Some 2-Designs
- Linear codes with few weights from inhomogeneous quadratic functions
- On the Locality of Codeword Symbols
- Some \(t\)-designs from BCH codes
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- The weight distribution of a class of cyclic codes containing a subclass with optimal parameters
- Two classes of linear codes and their weight distributions
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
Cited in
(9)- Infinite families of 3-designs from special symmetric polynomials
- Optimal few-weight codes and their subfield codes
- The weight distributions of several classes of few-weight linear codes
- scientific article; zbMATH DE number 7296043 (Why is no real title available?)
- On the parameters of extended primitive cyclic codes and the related designs
- New infinite families of near MDS codes holding \(t\)-designs
- Three families of self-orthogonal codes and their application in optimal quantum codes
- Binary and ternary leading-systematic LCD codes from special functions
- An improvement on Weil bounds for character sums of polynomials over finite fields
This page was built for publication: Constructions of cyclic codes and extended primitive cyclic codes with their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156922)
