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
来源：
FINITE FIELDS AND THEIR APPLICATIONS | 2025年 / 101卷
基金：
中国国家自然科学基金; 中国博士后科学基金;
关键词：
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 条
  • [1] On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions
    Li, Chao
    Ling, San
    Qu, Longjiang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (01) : 70 - 82
  • [2] ON THE COVERING RADIUS OF CYCLIC LINEAR CODES AND ARITHMETIC CODES
    HELLESETH, T
    DISCRETE APPLIED MATHEMATICS, 1985, 11 (02) : 157 - 173
  • [3] Quasi-perfect linear codes from planar and APN functions
    Chunlei Li
    Tor Helleseth
    Cryptography and Communications, 2016, 8 : 215 - 227
  • [4] Quasi-perfect linear codes from planar and APN functions
    Li, Chunlei
    Helleseth, Tor
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2016, 8 (02): : 215 - 227
  • [5] LINEAR CODES WITH COVERING RADIUS-2 AND OTHER NEW COVERING CODES
    GABIDULIN, EM
    DAVYDOV, AA
    TOMBAK, LM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (01) : 219 - 224
  • [6] Covering and secret sharing with linear codes
    Ding, CS
    Yuan, J
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2731 : 11 - 25
  • [7] The Generalized Covering Radii of Linear Codes
    Elimelech, Dor
    Firer, Marcelo
    Schwartz, Moshe
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 302 - 307
  • [8] Linear codes with covering radius 3
    Davydov, Alexander A.
    Ostergard, Patric R. J.
    DESIGNS CODES AND CRYPTOGRAPHY, 2010, 54 (03) : 253 - 271
  • [9] Bounds on the Covering Radius of Linear Codes
    A. Ashikhmin
    A. Barg
    Designs, Codes and Cryptography, 2002, 27 : 261 - 269
  • [10] On the Newton and covering radii of linear codes
    Gabidulin, E
    Klove, T
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) : 2534 - 2536
12345