Complementary information set codes over GF(p)
- 주제(키워드) Code , Complementary information set code , Correlation immune , Equivalence , Gilbert–Vashamov bound , Self-dual code
- 관리정보기술 faculty
- 등재 SCIE, SCOPUS
- 발행기관 Springer New York LLC
- 발행년도 2016
- 총서유형 Journal
- URI http://www.dcollection.net/handler/ewha/000000123372
- 본문언어 영어
- Published As http://dx.doi.org/10.1007/s10623-015-0174-3
초록/요약
Complementary information set codes (CIS codes) over a finite field GF(p) are closely connected to correlation-immune functions over GF(p), which are important cryptographic functions, where p is an odd prime. Using our CIS codes over GF(p) of minimum weight (Formula presented.), we can obtain p-ary correlation-immune function of strength d. We find an efficient method for constructing CIS codes over GF(p). We also find a criterion for checking equivalence of CIS codes over GF(p). We complete the classification of all inequivalent CIS codes over GF(p) of lengths up to 8 for (Formula presented.) using our construction and criterion. We also find their weight enumerators and the order of their automorphism groups. The class of CIS codes over GF(p) includes self-dual codes over GF(p) as its subclass, and some CIS codes are formally self-dual codes as well; we sort out our classification results. Furthermore, we show that long CIS codes over GF(p) meet the Gilbert–Vashamov bound. © 2016 Springer Science+Business Media New York
more