CONSTRUCTION OF SOME BINARY LINEAR CODES OF MINIMUM DISTANCE 5

被引：8
|
作者：
CHEN, CL
机构：
[1] IBM Corporation, Poughkeepsie, NY 12602, P.O. Box 950, Department D18
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 05期
关键词：
ERROR-CORRECTING CODE; LINEAR BLOCK CODE;
D O I：
10.1109/18.133262
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A method of constructing binary linear codes is presented that have a minimum Hamming distance of five. Some efficient new codes are obtained. In particular, a (47,36,5) code is obtained that has six more information bits than the best previously known code with 11 check bits.
引用
收藏
页码：1429 / 1432
页数：4
相关论文
共 50 条
12345