
An efficient method to construct selfdual cyclic codes of length p^s over F_p^m+uF_p^m
Let p be an odd prime number, F_p^m be a finite field of cardinality p^m...
read it

An explicit representation and enumeration for selfdual cyclic codes over F_2^m+uF_2^m of length 2^s
Let F_2^m be a finite field of cardinality 2^m and s a positive integer....
read it

Construction and enumeration for selfdual cyclic codes of even length over F_2^m + uF_2^m
Let F_2^m be a finite field of cardinality 2^m, R=F_2^m+uF_2^m (u^2=0) a...
read it

Constructions of MDS Euclidean Selfdual Codes from smaller length
Systematic constructions of MDS Euclidean selfdual codes is widely conc...
read it

Integer Ring Sieve (IRS) for Constructing Compact QCLDPC Codes with Large Girth
This paper proposes a new method of construction of compact fullyconnec...
read it

Measuring spatial uniformity with the hypersphere chord length distribution
Data uniformity is a concept associated with several semantic data chara...
read it

On the Complexity of Polytopes in LI(2)
In this paper we consider polytopes given by systems of n inequalities i...
read it
An explicit expression for Euclidean selfdual cyclic codes of length 2^k over Galois ring GR(4,m)
For any positive integers m and k, existing literature only determines the number of all Euclidean selfdual cyclic codes of length 2^k over the Galois ring GR(4,m), such as in [Des. Codes Cryptogr. (2012) 63:105–112]. Using properties for Kronecker products of matrices of a specific type and column vectors of these matrices, we give a simple and efficient method to construct all these selfdual cyclic codes precisely. On this basis, we provide an explicit expression to accurately represent all distinct Euclidean selfdual cyclic codes of length 2^k over GR(4,m), using combination numbers. As an application, we list all distinct Euclidean selfdual cyclic codes over GR(4,m) of length 2^k explicitly, for k=4,5,6.
READ FULL TEXT
Comments
There are no comments yet.