Related papers: Self-Dual Convolutional Codes
Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…
We prove that if two linear codes are equivalent then they are semi-linearly equivalent. We also prove that if two additive MDS codes over a field are equivalent then they are additively equivalent.
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…
The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…
In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS…
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
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…
In this note we introduce the concept of group convolutional code. We make a complete classification of the minimal $S_3$-convolutional codes over the field of five elements by means of Jategaonkar's theorems.
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…
Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes,…
In this paper we study a class of convex sets which are called closed pseudo-cones and study a new duality of this class. It turns out that the duality characterizes closed pseudo-cones and is essentially the only possible abstract duality…
We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and introduce a class of invariants that refine the classical…
In this paper we extend the relation between convolutional codes and linear systems over finite fields to certain commutative rings through first order representations . We introduce the definition of rings with representations as those for…
We give a general method to construct MDS one-dimensional convolutional codes. Our method generalizes previous constructions of H. Gluesing-Luerssen and B. Langfeld. Moreover we give a classification of one-dimensional Convolutional Goppa…
The article reviews different definitions for a convolutional code which can be found in the literature. The algebraic differences between the definitions are worked out in detail. It is shown that bi-infinite support systems are dual to…
In this paper, we employ the linear systems representation of a convolutional code to develop a decoding algorithm for convolutional codes over the erasure channel. We study the decoding problem using the state space description and this…
This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the…
Let C be a binary linear code and suppose that its automorphism group contains a non trivial subgroup G. What can we say about C knowing G? In this paper we collect some answers to this question in the cases G=C_p, G=C_2p and G=D_2p (p an…
Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…