- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j25 |      | |
| 2012 | ||
| j24 | | Lars Hopland Nestås, Kjell Jørgen Hole: Building and Maintaining Trust in Internet Voting. IEEE Computer 45(5): 74-80 (2012) |
| j23 | | Kjell Jørgen Hole: Toward a Practical Technique to Halt Multiple Virus Outbreaks on Computer Networks. Journal Comp. Netw. and Communic. 2012 (2012) |
| 2010 | ||
| j22 | | Kjell Jørgen Hole, Lars-Helge Netland: Toward Risk Assessment of Large-Impact and Rare Events. IEEE Security & Privacy 8(3): 21-27 (2010) |
| c4 | | Håvard Raddum, Lars Hopland Nestås, Kjell Jørgen Hole: Security Analysis of Mobile Phones Used as OTP Generators. WISTP 2010: 324-331 |
| 2009 | ||
| j21 | | Kjell Jørgen Hole, André N. Klingsheim, Lars-Helge Netland, Yngve Espelid, Thomas Tjøstheim, Vebjørn Moen: Risk Assessment of a National Security Infrastructure. IEEE Security & Privacy 7(1): 34-41 (2009) |
| 2008 | ||
| j20 | | 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. EURASIP J. Wireless Comm. and Networking 2008 (2008) |
| j19 | | Kjell Jørgen Hole, Lars-Helge Netland, Yngve Espelid, André N. Klingsheim, Hallvar Helleseth, Jan B. Henriksen: Open Wireless Networks on University Campuses. IEEE Security & Privacy 6(4): 14-20 (2008) |
| c3 | | André N. Klingsheim, Kjell Jørgen Hole: Identity Theft: Much Too Easy? A Study of Online Systems in Norway. Financial Cryptography 2008: 192-196 |
| c2 | | 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 |
| c1 | | 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 | ||
| j18 | | André N. Klingsheim, Vebjørn Moen, Kjell Jørgen Hole: Challenges in Securing Networked J2ME Applications. IEEE Computer 40(2): 24-30 (2007) |
| j17 | | Kjell Jørgen Hole, Vebjørn Moen, André N. Klingsheim, Knut M. Tande: Lessons from the Norwegian ATM System. IEEE Security & Privacy 5(6): 25-31 (2007) |
| i1 | | 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) |
| 2006 | ||
| j16 | | Kjell Jørgen Hole, Vebjørn Moen, Thomas Tjøstheim: Case Study: Online Banking Security. IEEE Security & Privacy 4(2): 14-20 (2006) |
| 2005 | ||
| j15 | | Kjell Jørgen Hole, Erlend Dyrnes, Per Thorsheim: Securing Wi-Fi Networks. IEEE Computer 38(7): 28-34 (2005) |
| 2004 | ||
| j14 | | 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 | ||
| j13 | | 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) |
| j12 | | 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 | ||
| j11 | | Kjell Jørgen Hole: A comparison of trellis modules for binary convolutional codes. IEEE Transactions on Communications 46(10): 1245-1249 (1998) |
| j10 | | 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 | ||
| j9 | | Kjell Jørgen Hole: A note on asymptotically catastrophic convolutional codes of rate (n-1)/n. IEEE Transactions on Communications 45(9): 1014-1016 (1997) |
| j8 | | 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) |
| j7 | | 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 | ||
| j6 | | 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 | ||
| j5 | | 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 | ||
| j4 | | Kjell Jørgen Hole: An algorithm for determining if a rate (n-1)/n punctured convolutional encoder is catastrophic. IEEE Transactions on Communications 39(3): 386-389 (1991) |
| j3 | | Kjell Jørgen Hole: Rate k/(k + 1) punctured convolutional encoders. IEEE Transactions on Information Theory 37(3): 653-655 (1991) |
| j2 | | 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 | ||
| j1 | | 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-1081 (1988) |
Colors in the list of coauthors
Last update Sat May 25 02:36:13 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page