Complete weight enumerators and weight hierarchies of two classes of linear codes

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2025-04-03 DOI:10.1016/j.disc.2025.114510

Jiawei He, Yinjin Liao

引用次数: 0

Abstract

The study of generalized Hamming weights for linear coding is an important area of research in coding theory as it provides valuable structural information about coding and plays a crucial role in determining the performance of coding in various applications. In this paper, two distinct classes of linear codes are devised through the selection of two particular defining sets. Initially, the weight distributions of these codes are ascertained. Subsequently, by conducting a detailed analysis of the intersections between the defining sets and the duals of all r-dimensional subspaces, the complete weight hierarchies of the two classes of linear codes are successfully determined.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.