Follow
yvind Ytrehus
yvind Ytrehus
Unknown affiliation
Verified email at simula.no
Title
Cited by
Cited by
Year
Generalized Hamming weights of linear codes
T Helleseth, T Klove, Ytrehus
IEEE transactions on information theory 38 (3), 1133-1140, 1992
1451992
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
652009
Bounds on the minimum support weights
T Helleseth, T Klove, VI Levenshtein, Ytrehus
IEEE transactions on information theory 41 (2), 432-440, 1995
621995
Cycle-logical treatment for" Cyclopathic" networks
AI Barbero, O Ytrehus
IEEE Transactions on Information Theory 52 (6), 2795-2804, 2006
382006
Improved coding techniques for preceded partial-response channels
KJ Hole, Ytrehus
IEEE transactions on information theory 40 (2), 482-493, 1994
381994
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
332012
Modifications of the Rao-Nam cryptosystem
I Barbero, Ytrehus
Coding Theory, Cryptography and Related Areas, 1-12, 2000
332000
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
302007
Runlength-limited codes for mixed-error channels
O Ytrehus
IEEE transactions on information theory 37 (6), 1577-1585, 1991
271991
Constrained codes for passive RFID communication
AI Barbero, E Rosnes, G Yang, Ytrehus
2011 Information Theory and Applications Workshop, 1-9, 2011
262011
An efficient algorithm for tailbiting turbo code weight distribution calculation
E Rosnes, O Ytrehus
Proc. 3rd Int. Symp. turbo codes, 439-442, 2003
252003
Upper bounds on error-correcting runlength-limited block codes
Ytrehus
IEEE transactions on information theory 37 (3), 941-945, 1991
241991
On maximum length convolutional codes under a trellis complexity constraint
E Rosnes, Ytrehus
Journal of Complexity 20 (2-3), 372-403, 2004
232004
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
231987
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
192006
On the trellis complexity of certain binary linear block codes
Ytrehus
IEEE transactions on information theory 41 (2), 559-560, 1995
171995
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
152014
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
151992
Vendor malware: detection limits and mitigation
O Lysne, KJ Hole, C Otterstad, Ytrehus, R Aarseth, J Tellnes
Computer 49 (8), 62-69, 2016
142016
An efficient centralized binary multicast network coding algorithm for any cyclic network
AI Barbero, O Ytrehus
arXiv preprint arXiv:0705.0085, 2007
142007
The system can't perform the operation now. Try again later.
Articles 1–20