Complementary information set codes over GF(p)

摘要

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 G F (p) of minimum weight d + 1, 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 G F (p). We complete the classification of all inequivalent CIS codes over G F (p) of lengths up to 8 for p = 3, 5, 7 using our construction and criterion. We also find their weight enumerators and the order of their automorphism groups. The class of CIS codes over G F (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 G F (p) meet the Gilbert Vashamov hound.