Sciweavers

Share
1 search results - page 1 / 1
» Breaking the Trapping Sets in LDPC Codes: Check Node Removal...
Sort
View
ICC
2007
IEEE
192views Communications» more  ICC 2007»
10 years 7 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...
books