By Topic

Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis

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)
Rosenthal, J. ; Dept. of Math., Notre Dame Univ., IN, USA ; Vontobel, P.O.

Some twenty years ago Margulis (1982) proposed an algebraic construction of low density parity check (LDPC) codes. In this paper we mimick the construction of Margulis and describe a method for algebraically constructing regular and irregular LDPC codes

Published in:

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

Date of Conference:

2001