Symplectic spread-based generalized Kerdock codes |
| |
Authors: | S González C Martínez I F Rúa |
| |
Institution: | (1) Departamento de Matemáticas, Universidad de Oviedo, Oviedo, Spain;(2) Departamento de Matemáticas, Estadística y Computación, Universidad de Cantabria, Cantabria, Spain |
| |
Abstract: | Kerdock codes (Kerdock, Inform Control 20:182–187, 1972) are a well-known family of non-linear binary codes with good parameters
admitting a linear presentation in terms of codes over the ring (see Nechaev, Diskret Mat 1:123–139, 1989; Hammons et al., IEEE Trans Inform Theory 40:301–319, 1994). These codes have been
generalized in different directions: in Calderbank et al. (Proc Lond Math Soc 75:436–480, 1997) a symplectic construction
of non-linear binary codes with the same parameters of the Kerdock codes has been given. Such codes are not necessarily equivalent.
On the other hand, in Kuzmin and Nechaev (Russ Math Surv 49(5), 1994) the authors give a family of non-linear codes over the
finite field F of q = 2
l
elements, all of them admitting a linear presentation over the Galois Ring R of cardinality q
2 and characteristic 22. The aim of this article is to merge both approaches, obtaining in this way new families of non-linear codes over F that can be presented as linear codes over the Galois Ring R. The construction uses symplectic spreads.
|
| |
Keywords: | (Generalized) Kerdock code Linear presentation of codes Galois ring Symplectic spread Finite (Pre)Semifield |
本文献已被 SpringerLink 等数据库收录! |
|