Complementary information set codes over GF(p)

Hyun Jin Kim; Yoonjin Lee

doi:10.1007/s10623-015-0174-3

Complementary information set codes over GF(p)

Hyun Jin Kim, Yoonjin Lee

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

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 language	English
Pages (from-to)	541-555
Number of pages	15
Journal	Designs, Codes, and Cryptography
Volume	81
Issue number	3
DOIs	https://doi.org/10.1007/s10623-015-0174-3
State	Published - 1 Dec 2016

Bibliographical note

Funding Information:
The authors are grateful to anonymous referees and a handling editor for their careful review and constructive suggestions for improvement of our manuscript. The authors were supported by the National Research Foundation of Korea (NRF) Grant founded by the Korea government (MEST) (2014-002731), the first named author was also supported by the National Research Foundation of Korea (NRF) Grant founded by the Korea government (NRF-2013R1A1A2063240), and the second named author by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2009-0093827).

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

Keywords

Code
Complementary information set code
Correlation immune
Equivalence
Gilbert–Vashamov bound
Self-dual code

Access to Document

10.1007/s10623-015-0174-3

Cite this

@article{7a2435d29fce4ad992ca55be4ae87176,

title = "Complementary information set codes over GF(p)",

abstract = "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.",

keywords = "Code, Complementary information set code, Correlation immune, Equivalence, Gilbert–Vashamov bound, Self-dual code",

author = "Kim, {Hyun Jin} and Yoonjin Lee",

note = "Funding Information: The authors are grateful to anonymous referees and a handling editor for their careful review and constructive suggestions for improvement of our manuscript. The authors were supported by the National Research Foundation of Korea (NRF) Grant founded by the Korea government (MEST) (2014-002731), the first named author was also supported by the National Research Foundation of Korea (NRF) Grant founded by the Korea government (NRF-2013R1A1A2063240), and the second named author by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2009-0093827). Publisher Copyright: {\textcopyright} 2016, Springer Science+Business Media New York.",

year = "2016",

month = dec,

day = "1",

doi = "10.1007/s10623-015-0174-3",

language = "English",

volume = "81",

pages = "541--555",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Complementary information set codes over GF(p)

AU - Kim, Hyun Jin

AU - Lee, Yoonjin

N1 - Funding Information: The authors are grateful to anonymous referees and a handling editor for their careful review and constructive suggestions for improvement of our manuscript. The authors were supported by the National Research Foundation of Korea (NRF) Grant founded by the Korea government (MEST) (2014-002731), the first named author was also supported by the National Research Foundation of Korea (NRF) Grant founded by the Korea government (NRF-2013R1A1A2063240), and the second named author by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2009-0093827). Publisher Copyright: © 2016, Springer Science+Business Media New York.

PY - 2016/12/1

Y1 - 2016/12/1

N2 - 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.

AB - 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.

KW - Code

KW - Complementary information set code

KW - Correlation immune

KW - Equivalence

KW - Gilbert–Vashamov bound

KW - Self-dual code

UR - http://www.scopus.com/inward/record.url?scp=84954505957&partnerID=8YFLogxK

U2 - 10.1007/s10623-015-0174-3

DO - 10.1007/s10623-015-0174-3

M3 - Article

AN - SCOPUS:84954505957

SN - 0925-1022

VL - 81

SP - 541

EP - 555

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 3

ER -

Complementary information set codes over GF(p)

Abstract

Bibliographical note

Keywords

Access to Document

Fingerprint

Cite this