Title :
Linear Codes From Some 2-Designs
Author_Institution :
Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong, China
Abstract :
A classical method of constructing a linear code over GF(q) with a t-design is to use the incidence matrix of the t-design as a generator matrix over GF(q) of the code. This approach has been extensively investigated in the literature. In this paper, a different method of constructing linear codes using specific classes of 2-designs is studied, and linear codes with a few weights are obtained from almost difference sets, difference sets, and a type of 2-designs associated to semibent functions. Two families of the codes obtained in this paper are optimal. The linear codes presented in this paper have applications in secret sharing and authentication schemes, in addition to their applications in consumer electronics, communication and data storage systems. A coding-theory approach to the characterization of highly nonlinear Boolean functions is presented.
Keywords :
Boolean functions; linear codes; matrix algebra; nonlinear functions; telecommunication security; 2-designs; almost difference sets; authentication schemes; coding-theory approach; communication systems; consumer electronics; data storage systems; generator matrix; incidence matrix; linear codes; nonlinear Boolean functions; secret sharing; Additives; Authentication; Binary codes; Boolean functions; Cryptography; Hamming weight; Linear codes; Almost bent functions; Almost bent functions,; almost difference sets; bent functions; difference sets; linear codes; semibent functions; t-designs;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2015.2420118