By Topic

Iterative majority logic decoding of a class of Euclidean Geometry 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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Thangaraj, A. ; Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; McLaughlin, S.W.

Hard decision decoding of low density parity check (LDPC) codes has potential applications in practical settings like data storage. For this purpose, it is important for the code to have an assured minimum distance and, hence, guaranteed error correction capability. In this paper, we show that with very high probability the guaranteed error correction capability of Euclidean geometry (EG) codes using threshold-optimized, iterative majority logic (ML) decoding is much greater than the usual single iteration ML decoding, making these codes much more attractive for hard decision decoding. For instance, the (262143, 242461, t≥256) EG code (a (512, 512)-regular LDPC code) can correct t=580 bit errors with probability better than 1-1×10-58.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002