Infinite families of 3-designs from APN functions

被引:11
作者
Tang, Chunming [1 ,2 ]
机构
[1] China West Normal Univ, Sch Math & Informat, Nanchong 637002, Sichuan, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Math, Kowloon, Clear Water Bay, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
APN function; t-design; linear code; the general affine group; DIFFERENCE SETS;
D O I
10.1002/jcd.21685
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Combinatorial t-designs have nice applications in coding theory, finite geometries, and several engineering areas. A classical method for constructing t-designs is by the action of a permutation group that is t-transitive or t-homogeneous on a point set. This approach produces t-designs, but may not yield (t+1)-designs. The objective of this paper is to study how to obtain 3-designs with 2-transitive permutation groups. The incidence structure formed by the orbits of a base block under the action of the general affine groups, which are 2-transitive, is considered. A characterization of such incidence structure to be a 3-design is presented, and a sufficient condition for the stabilizer of a base block to be trivial is given. With these general results, infinite families of 3-designs are constructed by employing almost perfect nonlinear functions. Some 3-designs presented in this paper give rise to self-dual binary codes or linear codes with optimal or best parameters known. Several conjectures on 3-designs and binary codes are also presented.
引用
收藏
页码:97 / 117
页数:21
相关论文
共 50 条
  • [31] Several new infinite classes of 0-APN power functions over F2n
    Man, Yuying
    Tian, Shizhu
    Li, Nian
    Zeng, Xiangyong
    Zheng, Yanbin
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2024,
  • [32] Quasi-perfect linear codes from planar and APN functions
    Li, Chunlei
    Helleseth, Tor
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2016, 8 (02): : 215 - 227
  • [33] Quasi-perfect linear codes from planar and APN functions
    Chunlei Li
    Tor Helleseth
    Cryptography and Communications, 2016, 8 : 215 - 227
  • [34] Combinatorialt-designs from special functions
    Ding, Cunsheng
    Tang, Chunming
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2020, 12 (05): : 1011 - 1033
  • [35] Combinatorial t-designs from quadratic functions
    Xiang, Can
    Ling, Xin
    Wang, Qi
    DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (03) : 553 - 565
  • [36] Combinatorial t-designs from special functions
    Cunsheng Ding
    Chunming Tang
    Cryptography and Communications, 2020, 12 : 1011 - 1033
  • [37] Constructing New Piecewise Differentially 4-Uniform Permutations from Known APN Functions
    Xu, Guangkui
    Cao, Xiwang
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (05) : 599 - 609
  • [38] On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences
    Liu, Qi
    Ding, Cunsheng
    Mesnager, Sihem
    Tang, Chunming
    Tonchev, Vladimir D.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (05) : 3096 - 3107
  • [39] Constructing infinite families of low differential uniformity (n,m)-functions with m>n/2
    Carlet, Claude
    Chen, Xi
    Qu, Longjiang
    DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (07) : 1577 - 1599
  • [40] On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions
    Edel, Yves
    Pott, Alexander
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2009, 5921 : 383 - +