Now showing items 1-6 of 6
Constructions of semi-regular relative difference sets
J. A. Davis, J. Jedwab, and M. Mowbray (1998, Des. Codes Cryptogr. 13, 131-146) gave two new constructions for semi-regular relative difference sets (RDSs). They asked if the two constructions could be unified. In this ...
Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound
It is known that quantum error correction can be achieved using classical binary codes or additive codes over F4 (see , , ). In  and , asymptotically good quantum codes from algebraic-geometry codes were ...
Duadic codes over F2 + uF2
Duadic codes over F2+uF2 are introduced as abelian codes by their zeros. This is the function field analogue of duadic codes over Z4 introduced recently by Langevin and Solé. They produce binary self-dual codes via a ...
Duadic codes over Z2k
Duadic codes constitute a well-known family of binary cyclic codes. They are generalized in this correspondence to the setting of Abelian codes over the ring Z2k. Self-duality, isoduality, and Type II properties are studied.
On the algebraic structure of quasi-cyclic codes I : finite fields
A new algebraic approach to quasi-cyclic codes is introduced. The key idea is to regard a quasi-cyclic code over a field as a linear code over an auxiliary ring. By the use of the Chinese remainder theorem (CRT), or of the ...
Type II codes over F4+uF4
Self-dual codes over F4 for the Euclidean scalar product [2, 6] and over F2 + uF2 [1, 5] received some attention lately. In the present article, we study codes over an alphabet R of size 16 that contains both alphabets as ...