Linear codes from planar functions and related covering codes

被引:0
|
作者
Wu, Yanan [1 ]
Pan, Yanbin [1 ]
机构
[1] Chinese Acad Sci, Key Lab Math Mechanizat, Acad Math & Syst Sci, Beijing 100190, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Linear code; Planar function; Bent function; Weight distribution; Covering code; BENT FUNCTIONS; FINITE-FIELDS;
D O I
10.1016/j.ffa.2024.102535
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Linear codes with few weights have wide applications in consumer electronics, data storage system and secret sharing. In this paper, by virtue of planar functions, several infinite families of l-weight linear codes over F p are constructed, where l can be any positive integer and p is a prime number. The weight distributions of these codes are determined completely by utilizing certain approach on exponential sums. Experiments show that some (almost) optimal codes in small dimensions can be produced from our results. Moreover, the related covering codes are also investigated. (c) 2024 Published by Elsevier Inc.
引用
收藏
页数:24
相关论文
共 50 条
  • [41] Linear Programming Bounds for Codes via a Covering Argument
    Michael Navon
    Alex Samorodnitsky
    Discrete & Computational Geometry, 2009, 41
  • [42] Linear Programming Bounds for Codes via a Covering Argument
    Navon, Michael
    Samorodnitsky, Alex
    DISCRETE & COMPUTATIONAL GEOMETRY, 2009, 41 (02) : 199 - 207
  • [43] CONSTRUCTIONS, FAMILIES, AND TABLES OF BINARY LINEAR COVERING CODES
    DAVYDOV, AA
    DROZHZHINALABINSKAYA, AY
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) : 1270 - 1279
  • [44] Additive Quaternary Codes Related to Exceptional Linear Quaternary Codes
    Bierbrauer, Jurgen
    Marcugini, Stefano
    Pambianco, Fernanda
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (01) : 273 - 277
  • [45] The degree of functions and weights in linear codes
    Guritman, S
    Hoogweg, F
    Simonis, J
    DISCRETE APPLIED MATHEMATICS, 2001, 111 (1-2) : 87 - 102
  • [46] Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors
    Torleiv Kløve
    Moshe Schwartz
    Designs, Codes and Cryptography, 2014, 73 : 1029 - 1029
  • [47] Unidirectional covering codes
    Östergård, PRJ
    Seuranen, EA
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (01) : 336 - 340
  • [48] ON LENGTHENING OF COVERING CODES
    HONKALA, I
    DISCRETE MATHEMATICS, 1992, 106 : 291 - 295
  • [49] COVERING BOUNDS FOR CODES
    CALDERBANK, AR
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1992, 60 (01) : 117 - 122
  • [50] Switching of covering codes
    Ostergard, Patric R. J.
    Weakley, William D.
    DISCRETE MATHEMATICS, 2018, 341 (06) : 1778 - 1788