Related papers: Parameters of two classes of LCD BCH codes
In this paper, we investigate the first few largest coset leaders modulo $\frac{q^m+1}{\lambda}$ where $\lambda\mid q+1$ and $q$ is an odd prime power, and give the dimensions of some LCD BCH codes of length $\frac{q^m+1}{\lambda}$ with…
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and…
A new approach to bound the minimum distance of $q$-ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for several cases an improvement is achieved. We associate a…
Recently, binary cyclic codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construct four classes of binary cyclic codes…
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated…
As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…
Under research for near sixty years, Bose-$\!$Ray-$\!$Chaudhuri-$\!$Hocquenghem(BCH) codes have played increasingly important roles in many applications such as communication systems, data storage and information security. However, the…
Affine-invariant codes have attracted considerable attention due to their rich algebraic structure and strong theoretical properties. In this paper, we study a family of affine-invariant codes whose defining set consists of all descendants…
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…
Cyclic codes have wide applications in data storage systems and communication systems. Employing two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field GF}(q) and…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…
Linear complementary pairs (LCPs) of codes have been studied since they were introduced in the context of discussing mitigation measures against possible hardware attacks to integrated circuits. In this situation, the security parameters…
Maximum distance separable (MDS) codes are very important in both theory and practice. There is a classical construction of a family of $[2^m+1, 2u-1, 2^m-2u+3]$ MDS codes for $1 \leq u \leq 2^{m-1}$, which are cyclic, reversible and BCH…
Linear complementary dual (LCD) codes and linear complementary pair (LCP) of codes over finite fields have been intensively studied recently due to their applications in cryptography, in the context of side-channel and fault injection…
Constacyclic codes over finite fields are a family of linear codes and contain cyclic codes as a subclass. Constacyclic codes are related to many areas of mathematics and outperform cyclic codes in several aspects. Hence, constacyclic codes…
In the paper we investigate the structure of $i$-components of two classes of codes: Kerdock codes and the duals of the primitive cyclic BCH code with designed distance 5 of length $n=2^m-1$, for odd $m$. We prove that for any admissible…
Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
Bose-Chaudhuri-Hocquenghem (BCH) codes have been intensively investigated. Even so, there is only a little known about primitive BCH codes, let alone non-primitive ones. In this paper, let $q>2$ be a prime power, the dimension of a family…
Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do…