A construction of q-ary linear codes with irreducible cyclic codes

被引：8
|
作者：
Heng, Ziling [1 ,2 ]
Ding, Cunsheng [2 ]
机构：
[1] Changan Univ, Sch Sci, Xian 710064, Shaanxi, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Clear Water Bay, Hong Kong, Peoples R China
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2019年 / 87卷 / 05期
关键词：
Linear code; Constacyclic code; Weight distribution; Secret sharing scheme;
D O I：
10.1007/s10623-018-0507-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Linear codes are an important class of error-correcting codes and widely used in secret sharing schemes, combinational designs, authentication codes and so on. The objective of this paper is to construct q-ary linear codes with good parameters from irreducible cyclic codes. Several classes of linear codes with a few weights including infinite families of distance-optimal ones are derived. The nonzero codewords of some of the codes in this paper have minimal support for inclusion and such codes can be used to construct secret sharing schemes with interesting access structures.
引用
收藏
页码：1087 / 1108
页数：22
相关论文
共 50 条
  • [31] The weight hierarchies of q-ary linear codes of dimension 4
    Hu, Guoxiang
    Chen, Wende
    DISCRETE MATHEMATICS, 2010, 310 (24) : 3528 - 3536
  • [32] Linear Programming Bounds on the Kissing Number of q-ary Codes
    Sole, Patrick
    Liu, Yi
    Cheng, Wei
    Guilley, Sylvain
    Rioul, Olivier
    2021 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [33] On the minimum length of q-ary linear codes of dimension four
    Maruta, T
    DISCRETE MATHEMATICS, 1999, 208 : 427 - 435
  • [34] The q-Ary Antiprimitive BCH Codes
    Zhu, Hongwei
    Shi, Minjia
    Wang, Xiaoqiang
    Helleseth, Tor
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (03) : 1683 - 1695
  • [35] On normal and subnormal q-ary codes
    Lobstein, Antoine C., 1600, (35):
  • [36] On q-ary Linear Quasi-Constant-Weight Codes
    Liu, Zihui
    Zeng, Xiangyong
    IEEE COMMUNICATIONS LETTERS, 2016, 20 (01) : 41 - 44
  • [37] On the Nonexistence of q-ary Linear Codes Attaining the Griesmer Bound
    Li, Xiuli
    ARS COMBINATORIA, 2009, 90 : 137 - 143
  • [38] Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes
    Zeng, LQ
    Lan, L
    Tai, YY
    Lin, S
    GLOBECOM '05: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6: DISCOVERY PAST AND FUTURE, 2005, : 1193 - 1198
  • [39] LOWER BOUNDS FOR Q-ARY COVERING CODES
    CHEN, W
    HONKALA, IS
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (03) : 664 - 671
  • [40] Polar Codes for Q-ary Source Coding
    Karzand, Mohammad
    Telatar, Emre
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 909 - 912
12345