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
来源：
DISCRETE MATHEMATICS | 2022年 / 345卷 / 12期
基金：
中国国家自然科学基金;
关键词：
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 条
  • [31] Three-weight codes, triple sum sets, and strongly walk regular graphs
    Minjia Shi
    Patrick Solé
    [J]. Designs, Codes and Cryptography, 2019, 87 : 2395 - 2404
  • [32] A New Family of Optimal Binary Few-Weight Codes From Simplicial Complexes
    Li, Xiaoxiao
    Shi, Minjia
    [J]. IEEE COMMUNICATIONS LETTERS, 2021, 25 (04) : 1048 - 1051
  • [33] Few-weight ZpZp[u]-additive codes from down-sets
    Wang, Shukai
    Shi, Minjia
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2022, 68 (04) : 2381 - 2388
  • [34] Strongly regular graphs from reducible cyclic codes
    Shi, Minjia
    Helleseth, Tor
    Sole, Patrick
    [J]. JOURNAL OF ALGEBRAIC COMBINATORICS, 2022, 55 (01) : 173 - 184
  • [35] CODES FROM ORBIT MATRICES OF STRONGLY REGULAR GRAPHS
    Crnkovic, Dean
    Maksimovic, Marija
    Rukavina, Sanja
    [J]. RAD HRVATSKE AKADEMIJE ZNANOSTI I UMJETNOSTI-MATEMATICKE ZNANOSTI, 2018, 22 (534): : 23 - 38
  • [36] Strongly regular graphs from reducible cyclic codes
    Minjia Shi
    Tor Helleseth
    Patrick Solé
    [J]. Journal of Algebraic Combinatorics, 2022, 55 : 173 - 184
  • [37] Identifying codes in vertex-transitive graphs and strongly regular graphs
    Gravier, Sylvain
    Parreau, Aline
    Rottey, Sara
    Storme, Leo
    Vandomme, Elise
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (04):
  • [38] Optimal Binary Few-Weight Codes Using a Mixed Alphabet Ring and Simplicial Complexes
    Mondal, Nilay Kumar
    Lee, Yoonjin
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (07) : 4865 - 4878
  • [39] A new construction of two-, three- and few-weight codes via our GU codes and their applications
    Arrieta A Eddie
    Heeralal Janwa
    [J]. Applicable Algebra in Engineering, Communication and Computing, 2022, 33 : 629 - 647
  • [40] A new construction of two-, three- and few-weight codes via our GU codes and their applications
    Eddie, Arrieta A.
    Janwa, Heeralal
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2022, 33 (06) : 629 - 647
12345