Related papers: Self-Dual Convolutional Codes
Unit derived schemes applied to Hadamard matrices are used to construct and analyse linear block and convolutional codes. Codes are constructed to prescribed types, lengths and rates and multiple series of self-dual, dual-containing, linear…
In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…
Duadic codes are a class of cyclic codes that generalizes quadratic residue codes from prime to composite lengths. For every prime power q, we characterize the integers n such that over the finite field with q^2 elements there is a duadic…
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…
A general method for constructing convolutional codes from units in Laurent series over matrix rings is presented. Using group ring as matrix rings, this forms a basis for in-depth exploration of convolutional codes from group ring…
In this paper, we construct self-dual codes from a construction that involves 2x2 block circulant matrices, group rings and a reverse circulant matrix. We provide conditions whereby this construction can yield self-dual codes. We construct…
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…
The aim of this work is to study the structure and properties of the binary LCD codes having an automorphisms of odd prime order and to present a method for their construction.
In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.
The monomial codes over a Galois field F_q that can be thought invariant subspaces are essential to us in this study. More specifically, we look into the link between monomial codes and characteristic subspaces and the decomposition of…
A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…
In this paper we introduce self-dual cyclic and quantum codes over Z2^{\alpha} x (Z2 + uZ2)^{\beta}. We determine the conditions for any Z2Z2[u]-cyclic code to be self-dual, that is, C = C^{\perp}. Since the binary image of a…
These notes survey the theory of (twisted) conformal blocks from an algebro-geometric perspective and have two main goals. The first one is to summarize the construction of conformal blocks from vertex operator algebras, and to describe…
A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.
There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access…
Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This…
Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…
Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n|A]$ where $A$ is the adjacency matrix of a graph on $n$ vertices. A combinatorial interpretation of the minimum distance of such codes is given.…
In this paper, we present some new connections between BCK- algebras and binary block codes.
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…