Add to ORKGIn this paper, R is a finite chain ring of invariants (q, s), and ℓ is a positive integer fulfilling gcd(ℓ, q) = 1. In the language of q-cyclotomic cosets modulo ℓ, the cyclic codes over R of length ℓ are uniquely decomposed into a direct sum of trace-representable cyclic codes over R and the lattice of cyclic codes over R of length ℓ is investigated
ISBN 978-84-608-6082-2We introduce a new type of linear and cyclic codes. These codes are defined ov...
Copyright c © 2013 Mingzhong Wu. This is an open access article distributed under the Creative Commo...
AbstractQuasi-cyclic codes over a finite field are viewed as cyclic codes over a noncommutative ring...
We generalise structure theorems of Calderbank and Sloane for linear and cyclic codes over Zpa to a ...
AbstractIt is well known that cyclic linear codes of length n over a (finite) field F can be charact...
In this work, we define $G$-codes over the infinite ring $R_\infty$ as ideals in the group ring $R_\...
Let R be a finite commutative chain ring of characteristic p with invariants p,r, and k. In this pap...
In this work, we define $G$-codes over the infinite ring $R_\infty$ as ideals in the group ring $R_\...
In this work, we define $G$-codes over the infinite ring $R_\infty$ as ideals in the group ring $R_\...
Given an integer m which is a product of distinct primes pi, a method is given for constructing code...
AbstractWe study cyclic codes of arbitrary length N over the ring of integers modulo M. We first red...
Cyclic codes give us the most probable method by which we may detect and correct data transmission e...
A major difficulty in quantum computation and communication is preventing and correcting errors in t...
Coding for the synchronous noiseless T-user real adder channel is considered by employing cyclic cod...
Cyclic codes give us the most probable method by which we may detect and correct data transmission e...
ISBN 978-84-608-6082-2We introduce a new type of linear and cyclic codes. These codes are defined ov...
Copyright c © 2013 Mingzhong Wu. This is an open access article distributed under the Creative Commo...
AbstractQuasi-cyclic codes over a finite field are viewed as cyclic codes over a noncommutative ring...
We generalise structure theorems of Calderbank and Sloane for linear and cyclic codes over Zpa to a ...
AbstractIt is well known that cyclic linear codes of length n over a (finite) field F can be charact...
In this work, we define $G$-codes over the infinite ring $R_\infty$ as ideals in the group ring $R_\...
Let R be a finite commutative chain ring of characteristic p with invariants p,r, and k. In this pap...
In this work, we define $G$-codes over the infinite ring $R_\infty$ as ideals in the group ring $R_\...
In this work, we define $G$-codes over the infinite ring $R_\infty$ as ideals in the group ring $R_\...
Given an integer m which is a product of distinct primes pi, a method is given for constructing code...
AbstractWe study cyclic codes of arbitrary length N over the ring of integers modulo M. We first red...
Cyclic codes give us the most probable method by which we may detect and correct data transmission e...
A major difficulty in quantum computation and communication is preventing and correcting errors in t...
Coding for the synchronous noiseless T-user real adder channel is considered by employing cyclic cod...
Cyclic codes give us the most probable method by which we may detect and correct data transmission e...
ISBN 978-84-608-6082-2We introduce a new type of linear and cyclic codes. These codes are defined ov...
Copyright c © 2013 Mingzhong Wu. This is an open access article distributed under the Creative Commo...
AbstractQuasi-cyclic codes over a finite field are viewed as cyclic codes over a noncommutative ring...