Optimal Trace Codes and Their Self-orthogonality
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

The primary objective of this paper is the construction of optimal codes with self-orthogonality that can be used to construct quantum codes. Recently, Ding and Heng explored subfield codes, which can be viewed as trace codes. In this paper, we focus on investigating self-orthogonal optimal trace codes. First, we provide a novel description of trace codes by choosing suitable defining sets. Second, we determine the parameters of the codes and their trace codes whose defining sets are disjoint union of some affine subspaces in both non-projective cases and projective-cases. This result extends the main findings in (Hu, Li, Zeng, Wang, Tang, IEEE Trans. Inform. Theory, 68(7): 4408-4421, 2022). Third, we compute the parameters of trace codes for MacDonald codes, including the first order Reed-Muller codes and simplex codes as special cases. Finally, we examine their self-orthogonality and distance-optimality to find several classes of self-orthogonal Griesmer codes. Additionally, we resolve a problem proposed by Ding and Heng as a byproduct. © 1963-2012 IEEE.

키워드

Griesmer boundOptimal codeself-orthogonal codetrace codeBINARY LINEAR CODESSUBFIELD CODESCONSTRUCTION
제목
Optimal Trace Codes and Their Self-orthogonality
저자
Hyun, Jong YoonHu, ZhaoCheon, Eun JuWu, Yansheng
DOI
10.1109/TIT.2025.3559453
발행일
2025-06
유형
Article
저널명
IEEE Transactions on Information Theory
71
6
페이지
4267 ~ 4283