| 2009 |
|---|
| 33 | EE | Mohammad Ravanbakhsh,
Angela I. Barbero,
Øyvind Ytrehus:
Improved Delay Estimates for a Queueing Model for Random Linear Coding for Unicast
CoRR abs/0901.3987: (2009) |
| 2008 |
|---|
| 32 | EE | Øyvind Ytrehus:
Communication on Inductively Coupled Channels: Overview and Challenges.
ICMCTA 2008: 186-195 |
| 31 | EE | Cunsheng Ding,
Tor Helleseth,
Øyvind Ytrehus:
Preface.
Des. Codes Cryptography 48(2): 109-110 (2008) |
| 2007 |
|---|
| 30 | EE | Angela I. Barbero,
Øyvind Ytrehus:
Facts of LIFE.
ICCCN 2007: 832-837 |
| 29 | EE | Angela I. Barbero,
Øyvind Ytrehus:
An efficient centralized binary multicast network coding algorithm for any cyclic network
CoRR abs/0705.0085: (2007) |
| 28 | EE | Eirik Rosnes,
Øyvind Ytrehus:
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets.
IEEE Transactions on Information Theory 53(11): 4059-4075 (2007) |
| 2006 |
|---|
| 27 | | Øyvind Ytrehus:
Coding and Cryptography, International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005. Revised Selected Papers
Springer 2006 |
| 26 | EE | Eirik Rosnes,
Øyvind Ytrehus:
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets
CoRR abs/cs/0602072: (2006) |
| 25 | EE | Eirik Rosnes,
Øyvind Ytrehus:
On the Design of Bit-Interleaved Turbo-Coded Modulation With Low Error Floors.
IEEE Transactions on Communications 54(9): 1563-1573 (2006) |
| 24 | EE | Angela I. Barbero,
Øyvind Ytrehus:
Cycle-logical treatment for "Cyclopathic" networks.
IEEE Transactions on Information Theory 52(6): 2795-2804 (2006) |
| 2005 |
|---|
| 23 | EE | Eirik Rosnes,
Øyvind Ytrehus:
Improved algorithms for the determination of turbo-code weight distributions.
IEEE Transactions on Communications 53(1): 20-26 (2005) |
| 2004 |
|---|
| 22 | | Eirik Rosnes,
Øyvind Ytrehus:
Sphere-Packing Bounds for Convolutional Codes.
IEEE Transactions on Information Theory 50(11): 2801-2809 (2004) |
| 21 | EE | Eirik Rosnes,
Øyvind Ytrehus:
On maximum length convolutional codes under a trellis complexity constraint.
J. Complexity 20(2-3): 372-403 (2004) |
| 2003 |
|---|
| 20 | EE | Eirik Rosnes,
Øyvind Ytrehus:
High Rate Convolutional Codes with Optimal Cycle Weights.
IMA Int. Conf. 2003: 4-23 |
| 2001 |
|---|
| 19 | EE | Angela I. Barbero,
Øyvind Ytrehus:
On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels.
Discrete Mathematics 241(1-3): 51-63 (2001) |
| 2000 |
|---|
| 18 | | Noboru Hamada,
Tor Helleseth,
Halvard Martinsen,
Øyvind Ytrehus:
There is no ternary [28, 6, 16] code.
IEEE Transactions on Information Theory 46(4): 1550-1554 (2000) |
| 1998 |
|---|
| 17 | | Kjell Jørgen Hole,
Øyvind Ytrehus:
Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths.
IEEE Transactions on Information Theory 44(1): 423-431 (1998) |
| 16 | | Khaled A. S. Abdel-Ghaffar,
Øyvind Ytrehus:
Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels.
IEEE Transactions on Information Theory 44(4): 1593-1602 (1998) |
| 1997 |
|---|
| 15 | | M. F. Hole,
Øyvind Ytrehus:
Two-step trellis decoding of partial unit memory convolutional codes.
IEEE Transactions on Information Theory 43(1): 324-329 (1997) |
| 14 | | Iliya Boukliev,
Stefan M. Dodunekov,
Tor Helleseth,
Øyvind Ytrehus:
On the [162, 8, 80] codes.
IEEE Transactions on Information Theory 43(6): 2055-2057 (1997) |
| 1995 |
|---|
| 13 | | Tor Helleseth,
Torleiv Kløve,
Vladimir I. Levenshtein,
Øyvind Ytrehus:
Bounds on the minimum support weights.
IEEE Transactions on Information Theory 41(2): 432-440 (1995) |
| 12 | | Øyvind Ytrehus:
On the trellis complexity of certain binary linear block codes.
IEEE Transactions on Information Theory 41(2): 559-560 (1995) |
| 1994 |
|---|
| 11 | | Kjell Jørgen Hole,
Øyvind Ytrehus:
Improved coding techniques for preceded partial-response channels.
IEEE Transactions on Information Theory 40(2): 482-493 (1994) |
| 1993 |
|---|
| 10 | | Tor Helleseth,
Torleiv Kløve,
Øyvind Ytrehus:
Generalizations of the Griesmer Bound.
Error Control, Cryptology, and Speech Compression 1993: 41-52 |
| 9 | EE | Noboru Hamada,
Tor Helleseth,
Øyvind Ytrehus:
A New Class of Nonbinary Codes Meeting the Griesmer Bound.
Discrete Applied Mathematics 47(3): 219-226 (1993) |
| 8 | EE | Noboru Hamada,
Tor Helleseth,
Øyvind Ytrehus:
Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4}).
Discrete Mathematics 115(1-3): 175-185 (1993) |
| 1992 |
|---|
| 7 | | Noboru Hamada,
Tor Helleseth,
Øyvind Ytrehus:
On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound.
Des. Codes Cryptography 2(3): 225-229 (1992) |
| 6 | | Tor Helleseth,
Torleiv Kløve,
Øyvind Ytrehus:
Generalized Hamming weights of linear codes.
IEEE Transactions on Information Theory 38(3): 1133- (1992) |
| 1991 |
|---|
| 5 | | Øyvind Ytrehus:
Binary [18, 11]2 codes do not exist - Nor do [64, 53]2 codes.
IEEE Transactions on Information Theory 37(2): 349- (1991) |
| 4 | | Øyvind Ytrehus:
Upper bounds on error-correcting runlength-limited block codes.
IEEE Transactions on Information Theory 37(3): 941- (1991) |
| 3 | | Øyvind Ytrehus:
Runlength-limited codes for mixed-error channels.
IEEE Transactions on Information Theory 37(6): 1577-1585 (1991) |
| 1990 |
|---|
| 2 | | Øyvind Ytrehus,
Tor Helleseth:
There is no binary [25, 8, 10] code (corresp.).
IEEE Transactions on Information Theory 36(3): 695- (1990) |
| 1987 |
|---|
| 1 | | Stefan M. Dodunekov,
Tor Helleseth,
Nickolai Manev,
Øyvind Ytrehus:
New bounds on binary linear codes of dimension eight.
IEEE Transactions on Information Theory 33(6): 917- (1987) |
