DocumentCode
879007
Title
Idempotents, Mattson-Solomon polynomials and binary LDPC codes
Author
Horan, R. ; Tjhai, C. ; Tomlinson, M. ; Ambroze, M. ; Ahmed, M.
Author_Institution
Fixed & Mobile Commun. Res., Univ. of Plymouth, UK
Volume
153
Issue
2
fYear
2006
fDate
4/1/2006 12:00:00 AM
Firstpage
256
Lastpage
262
Abstract
It is shown how to construct an algorithm to search for binary idempotents that may be used to construct binary LDPC codes. The algorithm, which allows control of the key properties of sparseness, code rate and minimum distance, is constructed in the Mattson-Solomon domain. Examples are given of the codes constructed that include equivalent codes to the Euclidean and Projective Geometry codes in addition to some new codes. Codes having cycles of length 4 can also be constructed and are demonstrated to have good performance under iterative decoding.
Keywords
binary codes; cyclic codes; iterative decoding; parity check codes; polynomials; Mattson-Solomon domain; binary LDPC code construction; binary idempotent; cyclic code; iterative decoding; linear density parity check;
fLanguage
English
Journal_Title
Communications, IEE Proceedings-
Publisher
iet
ISSN
1350-2425
Type
jour
DOI
10.1049/ip-com:20050415
Filename
1610500
Link To Document