| Generalized Hamming weights of linear codes T Helleseth, T Klove, Ø Ytrehus IEEE transactions on information theory 38 (3), 1133-1140, 1992 | 145 | 1992 |
| 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 | 65 | 2009 |
| Bounds on the minimum support weights T Helleseth, T Klove, VI Levenshtein, Ø Ytrehus IEEE transactions on information theory 41 (2), 432-440, 1995 | 62 | 1995 |
| Cycle-logical treatment for" Cyclopathic" networks AI Barbero, O Ytrehus IEEE Transactions on Information Theory 52 (6), 2795-2804, 2006 | 38 | 2006 |
| Improved coding techniques for preceded partial-response channels KJ Hole, Ø Ytrehus IEEE transactions on information theory 40 (2), 482-493, 1994 | 38 | 1994 |
| 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 | 33 | 2012 |
| Modifications of the Rao-Nam cryptosystem ÁI Barbero, Ø Ytrehus Coding Theory, Cryptography and Related Areas, 1-12, 2000 | 33 | 2000 |
| 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 |
| Runlength-limited codes for mixed-error channels O Ytrehus IEEE transactions on information theory 37 (6), 1577-1585, 1991 | 27 | 1991 |
| Constrained codes for passive RFID communication AI Barbero, E Rosnes, G Yang, Ø Ytrehus 2011 Information Theory and Applications Workshop, 1-9, 2011 | 26 | 2011 |
| An efficient algorithm for tailbiting turbo code weight distribution calculation E Rosnes, O Ytrehus Proc. 3rd Int. Symp. turbo codes, 439-442, 2003 | 25 | 2003 |
| Upper bounds on error-correcting runlength-limited block codes Ø Ytrehus IEEE transactions on information theory 37 (3), 941-945, 1991 | 24 | 1991 |
| On maximum length convolutional codes under a trellis complexity constraint E Rosnes, Ø Ytrehus Journal of Complexity 20 (2-3), 372-403, 2004 | 23 | 2004 |
| New bounds on binary linear codes of dimension eight (Corresp.) S Dodunekov, T Helleseth, N Manev, Ø Ytrehus IEEE transactions on information theory 33 (6), 917-919, 1987 | 23 | 1987 |
| 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 | 19 | 2006 |
| On the trellis complexity of certain binary linear block codes Ø Ytrehus IEEE transactions on information theory 41 (2), 559-560, 1995 | 17 | 1995 |
| Near-field passive RFID communication: Channel model and code design AI Barbero, E Rosnes, G Yang, O Ytrehus IEEE transactions on communications 62 (5), 1716-1727, 2014 | 15 | 2014 |
| On the construction of [q 4+ q 2− q, 5, q 4− q 3+ q 2− 2q; q]-codes meeting the Griesmer bound N Hamada, T Helleseth, Ø Ytrehus Designs, Codes and Cryptography 2 (3), 225-229, 1992 | 15 | 1992 |
| Vendor malware: detection limits and mitigation O Lysne, KJ Hole, C Otterstad, Ø Ytrehus, R Aarseth, J Tellnes Computer 49 (8), 62-69, 2016 | 14 | 2016 |
| An efficient centralized binary multicast network coding algorithm for any cyclic network AI Barbero, O Ytrehus arXiv preprint arXiv:0705.0085, 2007 | 14 | 2007 |
