Related papers: Ds-bounds for cyclic codes: new bounds for abelian…
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…
We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes.
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
It has been shown that good structured codes over non-Abelian groups do exist. Specifically, we construct codes over the smallest non-Abelian group $\mathds{D}_6$ and show that the performance of these codes is superior to the performance…
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…
In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a…
In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…
Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…
New families of classical and quantum optimal negacyclic convolutional codes are constructed in this paper. This optimality is in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in…
A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…
Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…
Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…
We prove that there exist non-linear binary cyclic codes that attain the Gilbert-Varshamov bound.
We define and study burst-covering codes. We provide some general bounds connecting the parameters of a code with its burst-covering radius. We then provide stronger bounds on the burst-covering radius of cyclic codes, by employing…
It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…
We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of [9]. In particular, we improve the previous results by…
The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…
We present an extension of the Delsarte linear programming method. For several dimensions it yields improved upper bounds for kissing numbers and for spherical codes. Musin's recent work on kissing numbers in dimensions three and four can…