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 条
  • [11] Proofs of several conjectures on linear codes from Boolean functions
    Gologlu, Faruk
    Krasnayova, Dasa
    DISCRETE MATHEMATICS, 2019, 342 (02) : 572 - 583
  • [12] Linear codes from vectorial Boolean functions in the context of algebraic attacks
    Boumezbeur, M.
    Mesnager, S.
    Guenda, K.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021, 13 (03)
  • [13] Four classes of minimal binary linear codes with wmin/wmax < 1/2 derived from Boolean functions
    Li, Xia
    Yue, Qin
    DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (02) : 257 - 271
  • [14] Construction of binary linear codes through geometric Goppa codes
    Construção de códigos lineares binários através de códigos geométricos de Goppa
    Da Câmara, M.A. (camara@ufu.br), 2005, University Federal de Uberlandia, P.O. Box 593, Uberlandia, 38400-902, Brazil (14):
  • [15] Several classes of minimal linear codes from vectorial Boolean functions and p-ary functions
    Jin, Wengang
    Li, Kangquan
    Qu, Longjiang
    DISCRETE MATHEMATICS, 2025, 348 (07)
  • [16] CONSTRUCTION OF MINIMAL LINEAR CODES FROM MULTI-VARIABLE FUNCTIONS
    Hyun, Jong Yoon
    Kim, Boran
    Na, Minwon
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2021, 15 (02) : 227 - 240
  • [17] BCJR trellis construction for binary linear block codes
    Manoukian, HH
    Honary, B
    IEE PROCEEDINGS-COMMUNICATIONS, 1997, 144 (06): : 367 - 371
  • [18] Construction of Two Classes of Minimal Binary Linear Codes
    Du Xiaoni
    Hu Jinxi
    Jin Wengan
    Sun Yanzhong
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2022, 44 (10) : 3643 - 3649
  • [19] Construction of Two Classes of Minimal Binary Linear Codes from Definition Sets
    Wu, Hao
    Du, Xiaoni
    Qiao, Xingbin
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (12) : 1470 - 1474
  • [20] Binary Linear Codes With Few Weights From Two-to-One Functions
    Li, Kangquan
    Li, Chunlei
    Helleseth, Tor
    Qu, Longjiang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (07) : 4263 - 4275
12345