A construction of binary linear codes from Boolean functions

被引:116
|
作者
Ding, Cunsheng [1 ]
机构
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R China
关键词
Almost bent functions; Bent functions; Difference sets; Linear codes; Semibent functions; O-polynomials; CROSS-CORRELATION FUNCTIONS; SEMI-BENT FUNCTIONS; DESARGUESIAN PLANES; CYCLIC CODES; M-SEQUENCES; DISTRIBUTIONS; SUBCODES; WEIGHTS; OVALS; PROOF;
D O I
10.1016/j.disc.2016.03.029
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed Muller codes and Kerdock codes. In the past two decades, a lot of progress on the study of applications of Boolean functions in coding theory has been made. Two generic constructions of binary linear codes with Boolean functions have been well investigated in the literature. The objective of this paper is twofold. The first is to provide a survey on recent results, and the other is to propose open problems on one of the two generic constructions of binary linear codes with Boolean functions. These open problems are expected to stimulate further research on binary linear codes from Boolean functions. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:2288 / 2303
页数:16
相关论文
共 50 条
  • [31] Linear codes from a generic construction
    Xiang, Can
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2016, 8 (04): : 525 - 539
  • [32] Several Families of Binary Minimal Linear Codes From Two-to-One Functions
    Mesnager, Sihem
    Qian, Liqin
    Cao, Xiwang
    Yuan, Mu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (05) : 3285 - 3301
  • [33] Linear codes from a generic construction
    Can Xiang
    Cryptography and Communications, 2016, 8 : 525 - 539
  • [34] On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions
    Borissov, Y
    Braeken, A
    Nikova, S
    Preneel, B
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) : 1182 - 1189
  • [35] Optimal binary codes and binary construction of quantum codes
    Weiliang Wang
    Yangyu Fan
    Ruihu Li
    Frontiers of Computer Science, 2014, 8 : 1024 - 1031
  • [36] Optimal binary codes and binary construction of quantum codes
    Wang, Weiliang
    Fan, Yangyu
    Li, Ruihu
    FRONTIERS OF COMPUTER SCIENCE, 2014, 8 (06) : 1024 - 1031
  • [37] Constructions of Optimal Binary Locally Recoverable Codes via a General Construction of Linear Codes
    Luo, Gaojun
    Cao, Xiwang
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (08) : 4987 - 4997
  • [38] Construction of minimal linear codes with few weights from weakly regular plateaued functions
    Sinak, Ahmet
    TURKISH JOURNAL OF MATHEMATICS, 2022, 46 (03) : 953 - 972
  • [39] Construction of minimal binary linear codes with dimension n+3
    Shaikh, Wajid M.
    Jain, Rupali S.
    Reddy, B. Surendranath
    Patil, Bhagyashri S.
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2025, 17 (02): : 433 - 452
  • [40] Further projective binary linear codes derived from two-to-one functions and their duals
    Mesnager, Sihem
    Qian, Liqin
    Cao, Xiwang
    DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (03) : 719 - 746