Z4-linear Hadamard and extended perfect codes Full article
| Conference |
WCC2001, International Workshop on Coding and Cryptography 08-12 Jan 2001 , Paris |
||
|---|---|---|---|
| Journal |
Electronic Notes in Discrete Mathematics
ISSN: 1571-0653 |
||
| Output data | Year: 2001, Volume: 6, Pages: 107-112 Pages count : 6 DOI: 10.1016/s1571-0653(04)00161-1 | ||
| Tags | Hadamard Codes, Perfect Codes, Z4-Linear Codes | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
If N = 2^k ≥ 16 then there exist exactly ⌊(k−1)/2⌋ pairwise nonequivalent Z4-linear Hadamard (N, 2N, N/2)-codes and ⌊(k + 1)/2⌋ pairwise nonequivalent Z4-linear extended perfect (N, 2N/2N, 4)-codes. Recurrent construction of Z4-linear Hadamard codes is given.
Cite:
Krotov D.S.
Z4-linear Hadamard and extended perfect codes
Electronic Notes in Discrete Mathematics. 2001. V.6. P.107-112. DOI: 10.1016/s1571-0653(04)00161-1 Scopus РИНЦ OpenAlex
Z4-linear Hadamard and extended perfect codes
Electronic Notes in Discrete Mathematics. 2001. V.6. P.107-112. DOI: 10.1016/s1571-0653(04)00161-1 Scopus РИНЦ OpenAlex
Identifiers:
| Scopus: | 2-s2.0-34147131651 |
| Elibrary: | 13364646 |
| OpenAlex: | W3101163237 |