2008 |
18 | EE | André N. Klingsheim,
Kjell Jørgen Hole:
Identity Theft: Much Too Easy? A Study of Online Systems in Norway.
Financial Cryptography 2008: 192-196 |
17 | EE | Yngve Espelid,
Lars-Helge Netland,
André N. Klingsheim,
Kjell Jørgen Hole:
A Proof of Concept Attack against Norwegian Internet Banking Systems.
Financial Cryptography 2008: 197-201 |
16 | EE | Yngve Espelid,
Lars-Helge Netland,
André N. Klingsheim,
Kjell Jørgen Hole:
Robbing Banks with Their Own Software-an Exploit Against Norwegian Online Banks.
SEC 2008: 63-77 |
2007 |
15 | EE | Anders Gjendemsjø,
Geir E. Øien,
Henrik Holm,
Mohamed-Slim Alouini,
David Gesbert,
Kjell Jørgen Hole,
Pål Orten:
Rate and Power Allocation for Discrete-Rate Link Adaptation
CoRR abs/0707.2527: (2007) |
14 | EE | André N. Klingsheim,
Vebjørn Moen,
Kjell Jørgen Hole:
Challenges in Securing Networked J2ME Applications.
IEEE Computer 40(2): 24-30 (2007) |
2006 |
13 | EE | Kjell Jørgen Hole,
Vebjørn Moen,
Thomas Tjøstheim:
Case Study: Online Banking Security.
IEEE Security & Privacy 4(2): 14-20 (2006) |
2005 |
12 | EE | Kjell Jørgen Hole,
Erlend Dyrnes,
Per Thorsheim:
Securing Wi-Fi Networks.
IEEE Computer 38(7): 28-34 (2005) |
2004 |
11 | EE | Vebjørn Moen,
Håvard Raddum,
Kjell Jørgen Hole:
Weaknesses in the temporal key hash of WPA.
Mobile Computing and Communications Review 8(2): 76-83 (2004) |
2000 |
10 | | Kjell Jørgen Hole,
Henrik Holm,
Geir E. Øien:
Adaptive multidimensional coded modulation over flat fading channels.
IEEE Journal on Selected Areas in Communications 18(7): 1153-1158 (2000) |
9 | | Kjell Jørgen Hole:
On classes of convolutional codes that are not asymptotically catastrophic.
IEEE Transactions on Information Theory 46(2): 663-669 (2000) |
1998 |
8 | | 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) |
1997 |
7 | | M. F. Hole,
Kjell Jørgen Hole:
Low-complexity decoding of partial unit memory codes on precoded partial-response channels.
IEEE Transactions on Information Theory 43(3): 1052-1058 (1997) |
6 | | M. F. Hole,
Kjell Jørgen Hole:
Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes.
IEEE Transactions on Information Theory 43(4): 1301-1305 (1997) |
1995 |
5 | | Kjell Jørgen Hole:
Cosets of convolutional codes with short maximum zero-run lengths.
IEEE Transactions on Information Theory 41(4): 1145-1150 (1995) |
1994 |
4 | | Kjell Jørgen Hole,
Øyvind Ytrehus:
Improved coding techniques for preceded partial-response channels.
IEEE Transactions on Information Theory 40(2): 482-493 (1994) |
1991 |
3 | | Kjell Jørgen Hole:
Rate k/(k + 1) punctured convolutional encoders.
IEEE Transactions on Information Theory 37(3): 653- (1991) |
2 | | Kjell Jørgen Hole:
Punctured convolutional codes for the 1-D partial-response channel.
IEEE Transactions on Information Theory 37(3): 808-817 (1991) |
1988 |
1 | | Kjell Jørgen Hole:
New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding.
IEEE Transactions on Information Theory 34(5): 1079- (1988) |