A construction of linear codes and strongly regular graphs from q-polynomials

被引：6
|
作者：
Luo, Gaojun [1 ]
Cao, Xiwang [1 ,2 ]
机构：
[1] Nanjing Univ Aeronaut & Astronaut, Sch Math Sci, Nanjing 210016, Jiangsu, Peoples R China
[2] Chinese Acad Sci, State Key Lab Informat Secur, Inst Informat Engn, Beijing 100093, Peoples R China
来源：
DISCRETE MATHEMATICS | 2017年 / 340卷 / 09期
基金：
中国国家自然科学基金;
关键词：
Linear code; Strongly regular graph; q-polynomial; Niho exponent; Weight distribution; CYCLIC CODES; WEIGHTS; 2-WEIGHT;
D O I：
10.1016/j.disc.2017.04.016
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Linear codes with few weights have applications in secret sharing, authentication codes, association schemes, data storage systems, strongly regular graphs and some other fields. Two-weight linear codes are particularly interesting since they are closely related to finite geometry, combinatorial designs, graph theory. In this paper, we present a new approach to constructing linear codes with two or three weights from q-polynomials and study their weight distributions. As an application of two-weight linear codes, we obtain three families of strongly regular graphs. Some of the presented strongly regular graphs are new. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：2262 / 2274
页数：13
相关论文
共 50 条
  • [41] Three-Weight Codes over Rings and Strongly Walk Regular Graphs
    Minjia Shi
    Michael Kiermaier
    Sascha Kurz
    Patrick Solé
    [J]. Graphs and Combinatorics, 2022, 38
  • [42] CONSTRUCTION OF STRONGLY REGULAR GRAPHS HAVING AN AUTOMORPHISM GROUP OF COMPOSITE ORDER
    Crnkovic, Dean
    Maksimovic, Marija
    [J]. CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2020, 15 (01) : 22 - 41
  • [43] A New Construction of Strongly Regular Graphs with Parameters of the Complement Symplectic Graph
    Kabanov, Vladislav V.
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2023, 30 (01):
  • [44] SELF-ORTHOGONAL CODES FROM ORBIT MATRICES OF SEIDEL AND LAPLACIAN MATRICES OF STRONGLY REGULAR GRAPHS
    Crnkovic, Dean
    Egan, Ronan
    Svob, Andrea
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2020, 14 (04) : 591 - 602
  • [45] A construction of q-ary linear codes with irreducible cyclic codes
    Ziling Heng
    Cunsheng Ding
    [J]. Designs, Codes and Cryptography, 2019, 87 : 1087 - 1108
  • [46] A construction of q-ary linear codes with irreducible cyclic codes
    Heng, Ziling
    Ding, Cunsheng
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (05) : 1087 - 1108
  • [47] Strongly Regular Graphs from Pseudocyclic Association Schemes
    Koji Momihara
    Sho Suda
    [J]. Graphs and Combinatorics, 2024, 40
  • [48] Strongly regular graphs from classical generalized quadrangles
    Antonio Cossidente
    Francesco Pavese
    [J]. Designs, Codes and Cryptography, 2017, 85 : 457 - 470
  • [49] STRONGLY REGULAR GRAPHS DERIVED FROM COMBINATORIAL DESIGNS
    GOETHALS, JM
    [J]. CANADIAN JOURNAL OF MATHEMATICS, 1970, 22 (03): : 597 - &
  • [50] Some New Strongly Regular Graphs from Quadrics
    Lane-Harvard, Liz
    Penttila, Tim
    [J]. COMBINATORICS, GRAPH THEORY AND COMPUTING, SEICCGTC 2021, 2024, 448 : 73 - 77
12345