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
来源：
DISCRETE MATHEMATICS | 2016年 / 339卷 / 09期
关键词：
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 条
  • [41] Further projective binary linear codes derived from two-to-one functions and their duals
    Sihem Mesnager
    Liqin Qian
    Xiwang Cao
    Designs, Codes and Cryptography, 2023, 91 : 719 - 746
  • [42] The construction of periodically time-variant convolutional codes using binary linear block codes
    Ogasahara, Naonori
    Kobayashi, Manabu
    Hirasawa, Shigeichi
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2007, 90 (09): : 31 - 40
  • [43] Linear codes from planar functions and related covering codes
    Wu, Yanan
    Pan, Yanbin
    FINITE FIELDS AND THEIR APPLICATIONS, 2025, 101
  • [44] ON LINEAR DECOMPOSITION OF BOOLEAN FUNCTIONS
    Cheremushkin, A. V.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2016, 31 (01): : 46 - 56
  • [45] LINEAR SYMMETRY OF BOOLEAN FUNCTIONS
    SYCHEV, AN
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1982, (04): : 43 - 49
  • [46] On a Property of Linear Boolean Functions
    A. A. Voronenko
    Moscow University Computational Mathematics and Cybernetics, 2021, 45 (2) : 85 - 86
  • [47] Linear symmetries of Boolean functions
    Xiao, WJ
    DISCRETE APPLIED MATHEMATICS, 2005, 149 (1-3) : 192 - 199
  • [48] Linear structures of Boolean functions
    Dubuc, S
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 440 - 440
  • [49] Minimal linear codes constructed from functions
    Xia Wu
    Wei Lu
    Xiwang Cao
    Cryptography and Communications, 2022, 14 : 875 - 895
  • [50] Minimal linear codes constructed from functions
    Wu, Xia
    Lu, Wei
    Cao, Xiwang
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2022, 14 (04): : 875 - 895
12345