和秩度量码的线性规划界

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

IEEE Transactions on Information Theory Pub Date : 2024-11-04 DOI:10.1109/TIT.2024.3488902

Aida Abiad;Alexander L. Gavrilyuk;Antonina P. Khramova;Ilia Ponomarenko

引用次数: 0

摘要

给出了和秩度量中纠错码的最大基数的线性规划界。基于相对较小实例的计算实验，我们观察到获得的边界优于所有先前已知的边界。

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

查看原文本刊更多论文

A Linear Programming Bound for Sum-Rank Metric Codes

We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all previously known bounds.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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.