Proceedings of the Korea Institutes of Information Security and Cryptology Conference (한국정보보호학회:학술대회논문집)
- 1996.11a
- /
- Pages.286-294
- /
- 1996
길이가 16인 Z$_4$ 위의 Preparata 부호는 연쇄조건을 만족하지 않는다
- Kyeongcheol Yang (Department of Electronic Communication Engineering Hanyang University) ;
- Dooroo Lim (Department of Electronic Communication Engineering Hanyang University)
- Published : 1996.11.01
Abstract
In a remarkable paper 〔3〕, Hammons et al. showed that, when properly defined, the binary nonlinear Preparata code can be considered as the Gray map of a linear code eve. Z
Keywords
- linear codes over Z$_4$;
- Preparata codes;
- Kerdock codes;
- nonlinear codes;
- weight hierarchy;
- generalized Hamming weights;
- minimum support size