Constructing few-weight linear codes and strongly regular graphs

被引:3
|
作者
Cheng, Xiangdong [1 ]
Cao, Xiwang [1 ,2 ]
Qian, Liqin [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Dept Math, Nanjing 211106, Peoples R China
[2] MIIT, Key Lab Math Modelling & High Performance Comp Ai, Nanjing 211106, Peoples R China
基金
中国国家自然科学基金;
关键词
Linear code; Weakly regular bent function; Weight distribution; Minimal code; Strongly regular graph; 3-WEIGHT CODES; BENT FUNCTIONS; FINITE-FIELDS; 2-WEIGHT; SCHEMES;
D O I
10.1016/j.disc.2022.113101
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Linear codes with few weights have applications in data storage systems, secret sharing schemes, graph theory and so on. In this paper, we construct a class of few-weight linear codes by choosing defining sets from cyclotomic classes and we also establish few-weight linear codes by employing weakly regular bent functions. Notably, we get some codes that are minimal and we also obtain a class of two-weight optimal punctured codes with respect to the Griesmer bound. Finally, we get a class of strongly regular graphs with new parameters by using the obtained two-weight linear codes. (C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:12
相关论文
共 50 条
  • [41] On strongly walk regular graphs, triple sum sets and their codes
    Kiermaier, Michael
    Kurz, Sascha
    Sole, Patrick
    Stoll, Michael
    Wassermann, Alfred
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (02) : 645 - 675
  • [42] On strongly walk regular graphs, triple sum sets and their codes
    Kiermaier, Michael
    Kurz, Sascha
    Sole, Patrick
    Stoll, Michael
    Wassermann, Alfred
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2022,
  • [43] Codes arising from directed strongly regular graphs with μ = 1
    Huilgol, Medha Itagi
    D'Souza, Grace Divya
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (06)
  • [44] On strongly walk regular graphs, triple sum sets and their codes
    Michael Kiermaier
    Sascha Kurz
    Patrick Solé
    Michael Stoll
    Alfred Wassermann
    [J]. Designs, Codes and Cryptography, 2023, 91 : 645 - 675
  • [45] Linear Codes from Strongly Regular Shult Space
    Li, Xiuli
    [J]. PROCEEDINGS OF THE THIRD INTERNATIONAL WORKSHOP ON MATRIX ANALYSIS AND APPLICATIONS, VOL 2, 2009, : 133 - 136
  • [46] CONSTRUCTION OF STRONGLY REGULAR GRAPHS 2-WEIGHT CODES AND PARTIAL GEOMETRIES BY FINITE-FIELDS
    VANLINT, JH
    SCHRIJVER, A
    [J]. COMBINATORICA, 1981, 1 (01) : 63 - 73
  • [47] Some optimal codes and strongly regular graphs from the linear group L4(3)
    Crnkovic, Dean
    Crnkovic, Vedrana Mikulic
    Rodrigues, B. G.
    [J]. UTILITAS MATHEMATICA, 2012, 89 : 237 - 255
  • [48] STRONGLY REGULAR GRAPHS WITH STRONGLY REGULAR DECOMPOSITION
    HAEMERS, WH
    HIGMAN, DG
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1989, 114 : 379 - 398
  • [50] Constructing signed strongly regular graphs via star complement technique
    Ramezani, F.
    [J]. MATHEMATICAL SCIENCES, 2018, 12 (03) : 157 - 161