Maximum distance separable convolutional codes J Rosenthal, R Smarandache Applicable Algebra in Engineering, Communication and Computing 10, 15-32, 1999 | 210 | 1999 |
Quasi-cyclic LDPC codes: Influence of proto-and Tanner-graph structure on minimum Hamming distance upper bounds R Smarandache, PO Vontobel IEEE Transactions on Information Theory 58 (2), 585-607, 2012 | 171 | 2012 |
Strongly-MDS convolutional codes H Gluesing-Luerssen, J Rosenthal, R Smarandache IEEE Transactions on Information Theory 52 (2), 584-598, 2006 | 168 | 2006 |
LDPC codes for compressed sensing AG Dimakis, R Smarandache, PO Vontobel IEEE Transactions on Information Theory 58 (5), 3093-3114, 2012 | 164 | 2012 |
Deriving good LDPC convolutional codes from LDPC block codes AE Pusane, R Smarandache, PO Vontobel, DJ Costello IEEE Transactions on Information Theory 57 (2), 835-857, 2011 | 157 | 2011 |
Spatially coupled sparse codes on graphs: Theory and practice DJ Costello, L Dolecek, TE Fuja, J Kliewer, DGM Mitchell, ... IEEE Communications Magazine 52 (7), 168-176, 2014 | 105 | 2014 |
Constructions of MDS-convolutional codes R Smarandache, H Gluesing-Luerssen, J Rosenthal IEEE Transactions on Information Theory 47 (5), 2045-2049, 2001 | 100 | 2001 |
Diversity polynomials for the analysis of temporal correlations in wireless networks M Haenggi, R Smarandache IEEE Transactions on Wireless Communications 12 (11), 5940-5951, 2013 | 89 | 2013 |
Decoding of convolutional codes over the erasure channel V Tomás, J Rosenthal, R Smarandache IEEE Transactions on Information Theory 58 (1), 90-108, 2012 | 86 | 2012 |
Convolutional codes with maximum distance profile R Hutchinson, J Rosenthal, R Smarandache Systems & control letters 54 (1), 53-63, 2005 | 85 | 2005 |
Quasi-cyclic LDPC codes based on pre-lifted protographs DGM Mitchell, R Smarandache, DJ Costello IEEE Transactions on Information Theory 60 (10), 5856-5874, 2014 | 82 | 2014 |
Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes R Smarandache, PO Vontobel IEEE Transactions on Information Theory 53 (7), 2376-2393, 2007 | 60 | 2007 |
On deriving good LDPC convolutional codes from QC LDPC block codes AE Pusane, R Smarandache, PO Vontobel, DJ Costello 2007 IEEE International Symposium on Information Theory, 1221-1225, 2007 | 56 | 2007 |
On regular quasicyclic LDPC codes from binomials R Smarandache, PO Vontobel International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 274, 2004 | 55 | 2004 |
On superregular matrices and MDP convolutional codes R Hutchinson, R Smarandache, J Trumpf Linear algebra and its applications 428 (11-12), 2585-2596, 2008 | 42 | 2008 |
Constructing strongly-MDS convolutional codes with maximum distance profile. D Napp, R Smarandache Advances in Mathematics of Communications 10 (2), 2016 | 32 | 2016 |
Pseudocodeword performance analysis for LDPC convolutional codes R Smarandache, AE Pusane, PO Vontobel, DJ Costello IEEE transactions on information theory 55 (6), 2577-2598, 2009 | 31 | 2009 |
On the minimal pseudo-codewords of codes from finite geometries PO Vontobel, R Smarandache, N Kiyavash, J Teutsch, D Vukobratovic Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005 | 29 | 2005 |
A state space approach for constructing MDS rate 1/n convolutional codes R Smarandache, J Rosenthal 1998 Information Theory Workshop (Cat. No. 98EX131), 116-117, 1998 | 27 | 1998 |
Designing protograph-based quasi-cyclic spatially coupled LDPC codes with large girth S Mo, L Chen, DJ Costello, DGM Mitchell, R Smarandache, J Qiu IEEE Transactions on Communications 68 (9), 5326-5337, 2020 | 25 | 2020 |