Corrections and Comments on “Modified OSD Algorithm With Reduced Gaussian Elimination”

IF 3.7 3区计算机科学 Q2 TELECOMMUNICATIONS

IEEE Communications Letters Pub Date : 2025-04-22 DOI:10.1109/LCOMM.2025.3563185

Marc Fossorier;Mahdi Shakiba-Herfeh;Huazi Zhang

引用次数: 0

Abstract

In [1], the redaction of the results of Section-˜IV has been mixed up. For a reduced echelon form (REF) representation of the code, the sets B_K,MR and P_N–K,MR represent the information positions and the parity check positions that belong to the K most reliable positions of the received sequence, respectively. Section-˜IV should read.

查看原文本刊更多论文

“简化高斯消去的改进OSD算法”的修正与评论

在[1]中，第~ⅳ节结果的编校混淆了。对于代码的简化阶梯形（REF）表示，集合BK，MR和PN-K，MR分别表示属于接收序列的K个最可靠位置的信息位置和奇偶校验位置。第四节应该阅读。

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

求助全文

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

来源期刊

IEEE Communications Letters 工程技术-电信学

CiteScore

8.10

自引率

7.30%

发文量

590

审稿时长

2.8 months

期刊介绍： The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.