13 research outputs found
Double circulant self-dual and LCD codes over Galois rings
This paper investigates the existence, enumeration and asymptotic performance
of self-dual and LCD double circulant codes over Galois rings of characteristic
and order with and odd prime. When we
give an algorithm to construct a duality preserving bijective Gray map from
such a Galois ring to Using random coding, we obtain
families of asymptotically good self-dual and LCD codes over
for the metric induced by the standard
-valued Gray maps.Comment: Sbumitted on 4, December, 20 page
New Quantum and LCD Codes over Finite Fields of Even Characteristic
For an integer m ≥ 1, we study cyclic codes of length l over a commutative non-chain ring F2m + uF2m , where u2 = u . With a new Gray map and Euclidean dual-containing cyclic codes, we provide many new and superior codes to the best-known quantum error-correcting codes. Also, we characterise LCD codes of length l with respect to their generator polynomials and prove that F2m − image of an LCD code of length l is an LCD code of length 2l . Finally, we provide several optimal LCD codes from the Gray images of LCD codes over F2m + uF2m .
 
LCD Codes from tridiagonal Toeplitz matrice
Double Toeplitz (DT) codes are codes with a generator matrix of the form
with a Toeplitz matrix, that is to say constant on the diagonals
parallel to the main. When is tridiagonal and symmetric we determine its
spectrum explicitly by using Dickson polynomials, and deduce from there
conditions for the code to be LCD. Using a special concatenation process, we
construct optimal or quasi-optimal examples of binary and ternary LCD codes
from DT codes over extension fields.Comment: 16 page
Group rings: Units and their applications in self-dual codes
The initial research presented in this thesis is the structure of the unit group of the group ring Cn x D6 over a field of characteristic 3 in terms of cyclic groups, specifically U(F3t(Cn x D6)). There are numerous applications of group rings, such as topology, geometry and algebraic K-theory, but more recently in coding theory. Following the initial work on establishing the unit group of a group ring, we take a closer look at the use of group rings in algebraic coding theory in order to construct self-dual and extremal self-dual codes.
Using a well established isomorphism between a group ring and a ring of matrices, we construct certain self-dual and formally self-dual codes over a finite commutative Frobenius ring. There is an interesting relationships between the Automorphism group of the code produced and the underlying group in the group ring. Building on the theory, we describe all possible group algebras that can be used to construct the well-known binary extended Golay code.
The double circulant construction is a well-known technique for constructing self-dual codes; combining this with the established isomorphism previously mentioned, we demonstrate a new technique for constructing self-dual codes. New theory states that under certain conditions, these self-dual codes correspond to unitary units in group rings. Currently, using methods discussed, we construct 10 new extremal self-dual codes of length 68.
In the search for new extremal self-dual codes, we establish a new technique which considers a double bordered construction. There are certain conditions where this new technique will produce self-dual codes, which are given in the theoretical results. Applying this new construction, we construct numerous new codes to verify the theoretical results; 1 new extremal self-dual code of length 64, 18 new codes of length 68 and 12 new extremal self-dual codes of length 80.
Using the well established isomorphism and the common four block construction, we consider a new technique in order to construct self-dual codes of length 68. There are certain conditions, stated in the theoretical results, which allow this construction to yield self-dual codes, and some interesting links between the group ring elements and the construction. From this technique, we construct 32 new extremal self-dual codes of length 68.
Lastly, we consider a unique construction as a combination of block circulant matrices and quadratic circulant matrices. Here, we provide theory surrounding this construction and conditions for full effectiveness of the method. Finally, we present the 52 new self-dual codes that result from this method; 1 new self-dual code of length 66 and 51 new self-dual codes of length 68. Note that different weight enumerators are dependant on different values of β. In addition, for codes of length 68, the weight enumerator is also defined in terms of γ, and for codes of length 80, the weight
enumerator is also de ned in terms of α
How to obtain lattices from (f,σ,δ)-codes via a generalization of Construction A
We show how cyclic (f,σ,δ)-codes over finite rings canonically induce a Z-lattice in RN by using certain quotients of orders in nonassociative division algebras defined using the skew polynomial f. This construction generalizes the one using certain σ-constacyclic codes by Ducoat and Oggier, which used quotients of orders in non-commutative associative division algebras defined by f, and can be viewed as a generalization of the classical Construction A for lattices from linear codes. It has the potential to be applied to coset coding, in particular to wire-tap coding. Previous results by Ducoat and Oggier are obtained as special cases
Double circulant self-dual and LCD codes over Galois rings.
This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic p 2 and order p 4 with p and odd prime. When p ≡ 3 (mod 4), we give an algorithm to construct a duality preserving bijective Gray map from such a Galois ring to Z 2 p 2. Using random coding, we obtain families of asymptotically good self-dual and LCD codes over Z p 2 , for the metric induced by the standard F p-valued Gray maps