Bounds on MLDR Codes Over 𝕫pt

IF 2.9 3区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

IEEE Transactions on Information Theory Pub Date : 2025-06-12 DOI:10.1109/TIT.2025.3579249

Tim L. Alderson

引用次数: 0

Abstract

Upper bounds on the minimum Lee distance of codes that are linear over

$\mathbb {Z}_{q}$

$q=p^{t}$

, p prime are discussed. The bounds are Singleton like, depending on the length, rank, and alphabet size of the code. Codes meeting such bounds are referred to as Maximum Lee Distance with respect to Rank (MLDR) Codes. We present some new bounds on MLDR codes, using combinatorial arguments. In the context of MLDR codes, our work provides improvements over existing bounds in the literature.

查看原文本刊更多论文

MLDR代码的边界在𝕫pt上

讨论了$\mathbb {Z}_{q}$, $q=p^{t}$, p '上线性码的最小李氏距离的上界。边界类似于Singleton，取决于代码的长度、排名和字母大小。满足这些界限的码被称为相对于秩的最大李距离（MLDR）码。我们使用组合参数给出了MLDR代码的一些新的边界。在MLDR代码的上下文中，我们的工作提供了对文献中现有边界的改进。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

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

来源期刊

IEEE Transactions on Information Theory 工程技术-工程：电子与电气

CiteScore

5.70

自引率

20.00%

发文量

514

审稿时长

12 months

期刊介绍： The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.