[1]贾耀国.最小奇权列纠1/检2码H矩阵的一种构成方案[J].东南大学学报(自然科学版),1982,12(1):91-101.[doi:10.3969/j.issn.1001-0505.1982.01.009]
 Jia Yao-guo.A Scheme of Constructing H Matrix of Minimum Odd-Weight-Column SEC-DED Codes[J].Journal of Southeast University (Natural Science Edition),1982,12(1):91-101.[doi:10.3969/j.issn.1001-0505.1982.01.009]
点击复制

最小奇权列纠1/检2码H矩阵的一种构成方案()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
12
期数:
1982年第1期
页码:
91-101
栏目:
本刊信息
出版日期:
1982-03-20

文章信息/Info

Title:
A Scheme of Constructing H Matrix of Minimum Odd-Weight-Column SEC-DED Codes
作者:
贾耀国
undefined
Author(s):
Jia Yao-guo
关键词:
子矩阵 循环周期 最大值 构成 素因数 循环移动 最小 元素 并行编码 方案
分类号:
+
DOI:
10.3969/j.issn.1001-0505.1982.01.009
摘要:
本文提出一类最小奇权列纠1/检2码H矩阵构成方案,可以使H矩阵各行“1”的个数的最大值为最小,且各行间“1”的个数之差不大干1,以减少其并行编码、译码时间至最少。
Abstract:
This paper presents a scheme of constructing H Matrix of minimum oddweight-column SEC-DED codes. It can reduce the maximum number of l’s in each row and make the difference of the number of l’s between any two rows of H matrix not greater than one. As a result, the encoding and decoding time in parallel can be reduced to minimum.
更新日期/Last Update: 2013-05-01