Optimal few-weight codes and their subfield codes
-
Published:2023-07-25
Issue:
Volume:
Page:
-
ISSN:0219-4988
-
Container-title:Journal of Algebra and Its Applications
-
language:en
-
Short-container-title:J. Algebra Appl.
Affiliation:
1. School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, P. R. China
Abstract
Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. Recently, Wu et al., constructed few-weight quaternary linear codes and their subfield codes by using simplicial complexes. In this paper, we will extend the results from binary case to arbitrarily odd prime number [Formula: see text]. More specifically, we have constructed [Formula: see text] classes of distance optimal linear codes, all of them meet the Griesmer bound.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Jiangsu Province
Natural Science Research Project of Colleges and Universities in Jiangsu Province
Publisher
World Scientific Pub Co Pte Ltd
Subject
Applied Mathematics,Algebra and Number Theory