On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings
Designs, Codes and Cryptography
On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots
Designs, Codes and Cryptography
Cyclic codes over the rings Z2 + uZ2 and Z2 + uZ2 + u2Z2
Designs, Codes and Cryptography
Relative (pn,p,pn,n)-difference sets with GCD(p,n)=1
Journal of Algebraic Combinatorics: An International Journal
Cyclic codes and self-dual codes over F2+uF2
IEEE Transactions on Information Theory
On the algebraic structure of quasi-cyclic codes .I. Finite fields
IEEE Transactions on Information Theory
A note on self-dual group codes
IEEE Transactions on Information Theory
A class of 1-generator quasi-cyclic codes
IEEE Transactions on Information Theory
On the algebraic structure of quasi-cyclic codes III: generator theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We obtain structural results about group ring codes over F[G], where F is a finite field of characteristic p 0 and the Sylow p-subgroup of the Abelian group G is cyclic. As a special case, we characterize cyclic codes over finite fields in the case the length of the code is divisible by the characteristic of the field. By the same approach we study cyclic codes of length m over the ring R = F q [u], u r = 0 with r 0, gcd(m, q) = 1. Finally, we give a construction of quasi-cyclic codes over finite fields.