Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

A finite-field transform domain construction of binary low-density parity-check codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
Horan, R. ; Fixed & Mobile Commun. Res., Plymouth Univ., UK ; Tjhai, C. ; Tomlinson, M. ; Ambroze, M.
more authors

A new method of finding binary cyclic codes from the finite-field transform domain is presented. These cyclic codes have sparse parity-check matrix and thus are suitable for iterative decoding. Some interesting properties of the proposed construction method include the knowledge of the minimum distance and the ability to trade the increase in code dimension with a reduction in the parity-check matrix sparsity. By means of simulations, we show that the error correcting performance of the codes under iterative decoding is very close to the sphere-packing-bound constrained for binary transmission.

Published in:

Information Theory Workshop, 2005 IEEE

Date of Conference:

29 Aug.-1 Sept. 2005