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

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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