| An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices E Rosnes, ุ Ytrehus IEEE transactions on information theory 55 (9), 4167-4178, 2009 | 64 | 2009 |
| Block-diagonal and LT codes for distributed computing with straggling servers A Severinson, AG i Amat, E Rosnes IEEE Transactions on Communications 67 (3), 1739-1753, 2018 | 52 | 2018 |
| Achieving maximum distance separable private information retrieval capacity with linear codes S Kumar, HY Lin, E Rosnes, AG i Amat IEEE Transactions on Information Theory 65 (7), 4243-4273, 2019 | 51 | 2019 |
| Private information retrieval in distributed storage systems using an arbitrary linear code S Kumar, E Rosnes, AG i Amat 2017 IEEE International Symposium on Information Theory (ISIT), 1421-1425, 2017 | 50 | 2017 |
| Improved algorithms for the determination of turbo-code weight distributions E Rosnes, Y Ytrehus IEEE Transactions on communications 53 (1), 20-26, 2005 | 47 | 2005 |
| Optimum distance quadratic permutation polynomial-based interleavers for turbo codes E Rosnes, OY Takeshita 2006 IEEE International Symposium on Information Theory, 1988-1992, 2006 | 41 | 2006 |
| Frequency estimation of a single complex sinusoid using a generalized Kay estimator E Rosnes, A Vahlin IEEE transactions on communications 54 (3), 407-415, 2006 | 34 | 2006 |
| Addendum to “An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices” E Rosnes, ุ Ytrehus, MA Ambroze, M Tomlinson IEEE transactions on information theory 58 (1), 164-171, 2012 | 30 | 2012 |
| Turbo decoding on the binary erasure channel: Finite-length analysis and turbo stopping sets E Rosnes, O Ytrehus IEEE transactions on information theory 53 (11), 4059-4075, 2007 | 30 | 2007 |
| Performance analysis of 3-D turbo codes E Rosnes, AG i Amat IEEE transactions on information theory 57 (6), 3707-3720, 2011 | 27 | 2011 |
| On the minimum distance of turbo codes with quadratic permutation polynomial interleavers E Rosnes IEEE Transactions on Information Theory 58 (7), 4781-4795, 2012 | 26 | 2012 |
| Constrained codes for passive RFID communication AI Barbero, E Rosnes, G Yang, ุ Ytrehus 2011 Information Theory and Applications Workshop, 1-9, 2011 | 25 | 2011 |
| On the minimum/stopping distance of array low-density parity-check codes E Rosnes, MA Ambroze, M Tomlinson IEEE transactions on information theory 60 (9), 5204-5214, 2014 | 24 | 2014 |
| An efficient algorithm for tailbiting turbo code weight distribution calculation E Rosnes, O Ytrehus Proc. 3rd Int. Symp. turbo codes, 439-442, 2003 | 24 | 2003 |
| An MDS-PIR capacity-achieving protocol for distributed storage using non-MDS linear codes HY Lin, S Kumar, E Rosnes, AG i Amat 2018 IEEE International Symposium on Information Theory (ISIT), 966-970, 2018 | 22 | 2018 |
| On maximum length convolutional codes under a trellis complexity constraint E Rosnes, ุ Ytrehus Journal of Complexity 20 (2-3), 372-403, 2004 | 22 | 2004 |
| Private information retrieval from a cellular network with caching at the edge S Kumar, AG i Amat, E Rosnes, L Senigagliesi IEEE Transactions on Communications 67 (7), 4900-4912, 2019 | 20 | 2019 |
| Capacity of private linear computation for coded databases SA Obead, HY Lin, E Rosnes, J Kliewer 2018 56th Annual Allerton Conference on Communication, Control, and …, 2018 | 20 | 2018 |
| On the design of bit-interleaved turbo-coded modulation with low error floors E Rosnes, O Ytrehus IEEE transactions on communications 54 (9), 1563-1573, 2006 | 20 | 2006 |
| Edge spreading design of high rate array-based SC-LDPC codes DGM Mitchell, E Rosnes 2017 IEEE International Symposium on Information Theory (ISIT), 2940-2944, 2017 | 19 | 2017 |
