DocumentCode
1098586
Title
Construction of some binary linear codes of minimum distance five
Author
Chen, C.L.
Author_Institution
IBM Corp., Poughkeepsie, NY, USA
Volume
37
Issue
5
fYear
1991
fDate
9/1/1991 12:00:00 AM
Firstpage
1429
Lastpage
1432
Abstract
A method of constructing binary linear codes that have a minimum Hamming distance of five is presented. The author proposes a general formulation of the parity check matrix for the desired code and then derives necessary conditions for the code to have a minimum distance of five. Some new codes that satisfy the necessary conditions are described. 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
Keywords
error correction codes; (47,36,5) code; binary linear codes; minimum Hamming distance; parity check matrix; Block codes; Buildings; Hamming distance; Linear code; Null space; Parity check codes; Polynomials; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.133262
Filename
133262
Link To Document