Complementary information set codes over GF(p)

Hyun Jin Kim, Yoonjin Lee

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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 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 GF(p). We complete the classification of all inequivalent CIS codes over GF(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 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.

Original languageEnglish
Pages (from-to)541-555
Number of pages15
JournalDesigns, Codes, and Cryptography
Issue number3
Publication statusPublished - 2016 Dec 1

Bibliographical note

Publisher Copyright:
© 2016, Springer Science+Business Media New York.

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Complementary information set codes over GF(p)'. Together they form a unique fingerprint.

Cite this