764 citations
- G. Alkhazov7 profiles141 · h 105
- S. Malik5 profiles132 · h 96
- A. Meyer4 profiles121 · h 142
- S. Banerjee5 profiles120 · h 90
- A. Garcia-Bellido4 profiles118 · h 115
- A. Harel12 profiles118 · h 107
- A. Quadt13 profiles118 · h 86
- E. Barberis4 profiles118 · h 118
- G. Davies6 profiles118 · h 107
- M. Naimuddin3 profiles118 · h 102
- P. Lebrun13 profiles118 · h 54
- T. Hebbeker10 profiles118 · h 141
- University of ManchesterGB158 papers
- Centre National de la Recherche ScientifiqueFR152 papers
- Imperial College LondonGB145 papers
- Lomonosov Moscow State UniversityRU144 papers
- Fermi National Accelerator LaboratoryUS143 papers
- Iowa State UniversityUS137 papers
- Joint Institute for Nuclear ResearchRU134 papers
- Michigan State UniversityUS133 papers
- Northwestern UniversityUS132 papers
- Sorbonne UniversitéFR132 papers
- University of MichiganUS132 papers
- University of RochesterUS132 papers
Showing 2010 · cs.ITShow all
2 papers · 2 filters
cs.IT2010
Low Complexity Linear Programming Decoding of Nonbinary Linear Codes
Mayur Punekar, Mark F. Flanagan
Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. The aim of LP decoding is to…
cs.IT2010
Exploration of AWGNC and BSC Pseudocodeword Redundancy
Jens Zumbragel, Mark F. Flanagan, Vitaly Skachek
The AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code is defined as the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudo…