当前位置:
X-MOL 学术
›
IET Commun.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Construction of new codes in term-rank metric
IET Communications ( IF 1.5 ) Pub Date : 2020-05-04 , DOI: 10.1049/iet-com.2019.0709 Pham Huu Loc 1
IET Communications ( IF 1.5 ) Pub Date : 2020-05-04 , DOI: 10.1049/iet-com.2019.0709 Pham Huu Loc 1
Affiliation
This study investigates codes in the term-rank metric. These codes can be used to correct crisscross errors in a (
$ M \times N $ M × N
) matrix. These errors can be found in memory chip arrays, in magnetic tape recordings, or in the parallel-channel system with interference. In this study, the authors will build an algorithm for computing term-rank of a matrix and new construction of term-rank codes. Single error-correcting codes in the term-rank metric are considered and help us build a generator matrix and parity-check matrix for term-rank codes. Research results derived from this study show that the term-rank metric is suitable for correcting crisscross errors.
中文翻译:
构建术语等级度量中的新代码
本研究调查术语排名指标中的代码。这些代码可用于纠正($ M \次N $ 中号 × ñ
)矩阵。这些错误可以在存储芯片阵列,磁带录音或受干扰的并行通道系统中找到。在这项研究中,作者将建立一种算法来计算矩阵的术语等级和术语等级代码的新结构。考虑了术语等级度量中的单个纠错码,可帮助我们为术语等级码构建生成器矩阵和奇偶校验矩阵。这项研究得出的研究结果表明,术语等级度量标准适合校正交叉误差。
更新日期:2020-05-04
中文翻译:
构建术语等级度量中的新代码
本研究调查术语排名指标中的代码。这些代码可用于纠正(