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 条
  • [1] A construction for infinite families of Steiner 3-designs
    Mohácsy, H
    Ray-Chaudhuri, DK
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2001, 94 (01) : 127 - 141
  • [2] Infinite families of 3-designs from special symmetric polynomials
    Xu, Guangkui
    Cao, Xiwang
    Luo, Gaojun
    Wu, Huawei
    DESIGNS CODES AND CRYPTOGRAPHY, 2024, : 4487 - 4509
  • [3] INFINITE FAMILIES OF 3-DESIGNS FROM O-POLYNOMIALS
    Ding, Cunsheng
    Tang, Chunming
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2021, 15 (04) : 557 - 573
  • [4] Infinite families of 2-designs and 3-designs from linear codes
    Ding, Cunsheng
    Li, Chengju
    DISCRETE MATHEMATICS, 2017, 340 (10) : 2415 - 2431
  • [5] Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
    Xu, Guangkui
    Cao, Xiwang
    Qu, Longjiang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (07) : 4344 - 4353
  • [6] Infinite families of 3-designs from a type of five-weight code
    Cunsheng Ding
    Designs, Codes and Cryptography, 2018, 86 : 703 - 719
  • [7] Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs
    Wang, Xiaoqiang
    Tang, Chunming
    Ding, Cunsheng
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (04) : 2341 - 2354
  • [8] Infinite families of 3-designs from a type of five-weight code
    Ding, Cunsheng
    DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (03) : 703 - 719
  • [9] Unifying some known infinite families of combinatorial 3-designs
    Jimbo, Masakazu
    Kunihara, Yuta
    Laue, Reinhard
    Sawa, Masanori
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2011, 118 (03) : 1072 - 1085
  • [10] New infinite families of 3-designs from algebraic curves over Fq
    Oh, Byeong-Kweon
    Oh, Jangheon
    Yu, Hoseog
    EUROPEAN JOURNAL OF COMBINATORICS, 2007, 28 (04) : 1262 - 1269