Constructions of cyclic codes and extended primitive cyclic codes with their applications
From MaRDI portal
Publication:6156922
DOI10.1016/J.FFA.2023.102208zbMATH Open1516.94063arXiv2210.05170OpenAlexW4365505990MaRDI QIDQ6156922FDOQ6156922
Xinran Wang, Xiaoru Li, Ziling Heng
Publication date: 19 June 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2210.05170
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
- On the Locality of Codeword Symbols
- Fundamentals of Error-Correcting Codes
- Determining the Nonlinearity of a New Family of APN Functions
- Hamming Weights of the Duals of Cyclic Codes With Two Zeros
- Linear Codes From Some 2-Designs
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- Constructions of near MDS codes which are optimal locally recoverable codes
- Two classes of linear codes and their weight distributions
- Linear codes with few weights from inhomogeneous quadratic functions
- Infinite families of 2-designs and 3-designs from linear codes
- Infinite families of 3-designs from a type of five-weight code
- Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
- Some \(t\)-designs from BCH codes
- An Infinite Family of Steiner Systems from Cyclic Codes
- The weight distribution of a class of cyclic codes containing a subclass with optimal parameters
- Combinatorial \(t\)-designs from quadratic functions
- Infinite Families of Near MDS Codes Holding t-Designs
- An Infinite Family of Linear Codes Supporting 4-Designs
- Combinatorial \(t\)-designs from special functions
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- Constructions of projective linear codes by the intersection and difference of sets
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
Cited In (8)
- Title not available (Why is that?)
- Binary and ternary leading-systematic LCD codes from special functions
- New infinite families of near MDS codes holding \(t\)-designs
- An improvement on Weil bounds for character sums of polynomials over finite fields
- Three families of self-orthogonal codes and their application in optimal quantum codes
- The weight distributions of several classes of few-weight linear codes
- Infinite families of 3-designs from special symmetric polynomials
- Optimal few-weight codes and their subfield codes
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)
