Z4-linear Hadamard and extended perfect codes
| dc.creator | Krotov, Denis | |
| dc.date | 2007-10-01 | |
| dc.date.accessioned | 2026-07-07T09:37:48Z | |
| dc.date.available | 2026-07-07T09:37:48Z | |
| dc.description | If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of $Z_4$-linear Hadamard codes is given. | |
| dc.description | 7p. WCC-2001 | |
| dc.identifier | https://arxiv.org/abs/0710.0199 | |
| dc.identifier | http://arxiv.org/abs/0710.0199 | |
| dc.identifier | Electron. Notes Discrete Math. 6 (2001) 107-112 | |
| dc.identifier | doi:10.1016/S1571-0653(04)00161-1 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160589 | |
| dc.subject | Information Theory | |
| dc.title | Z4-linear Hadamard and extended perfect codes | |
| dc.type | text |