Kjell Jørgen Hole

According to our database1, Kjell Jørgen Hole authored at least 42 papers between 1988 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


Dominating Software Systems: How to Overcome Online Information Asymmetry.
IEEE Softw., 2019

Software Systems With Antifragility to Downtime.
Computer, 2019

Biologically Driven Artificial Intelligence.
Computer, 2019

Vendor Malware: Detection Limits and Mitigation.
Computer, 2016

Building Trust in E-Government Services.
Computer, 2016

Anti-fragile ICT Systems
Simula SpringerBriefs on Computing 1, Springer, ISBN: 978-3-319-30070-2, 2016

Toward Anti-fragility: A Malware-Halting Technique.
IEEE Secur. Priv., 2015

Diversity Reduces the Impact of Malware.
IEEE Secur. Priv., 2015

Management of Hidden Risks.
Computer, 2013

Toward a Practical Technique to Halt Multiple Virus Outbreaks on Computer Networks.
J. Comput. Networks Commun., 2012

Building and Maintaining Trust in Internet Voting.
Computer, 2012

Toward Risk Assessment of Large-Impact and Rare Events.
IEEE Secur. Priv., 2010

Security Analysis of Mobile Phones Used as OTP Generators.
Proceedings of the Information Security Theory and Practices. Security and Privacy of Pervasive Systems and Smart Devices, 2010

Risk Assessment of a National Security Infrastructure.
IEEE Secur. Priv., 2009

Open Wireless Networks on University Campuses.
IEEE Secur. Priv., 2008

Rate and Power Allocation for Discrete-Rate Link Adaptation.
EURASIP J. Wirel. Commun. Netw., 2008

Robbing Banks with Their Own Software-an Exploit Against Norwegian Online Banks.
Proceedings of The IFIP TC-11 23rd International Information Security Conference, 2008

Identity Theft: Much Too Easy? A Study of Online Systems in Norway.
Proceedings of the Financial Cryptography and Data Security, 12th International Conference, 2008

A Proof of Concept Attack against Norwegian Internet Banking Systems.
Proceedings of the Financial Cryptography and Data Security, 12th International Conference, 2008

Vulnerabilities in e-governments.
Int. J. Electron. Secur. Digit. Forensics, 2007

Lessons from the Norwegian ATM System.
IEEE Secur. Priv., 2007

Challenges in Securing Networked J2ME Applications.
Computer, 2007

Adaptive coded modulation with receive antenna diversity and imperfect channel knowledge at receiver and transmitter.
IEEE Trans. Veh. Technol., 2006

Case Study: Online Banking Security.
IEEE Secur. Priv., 2006

Securing Wi-Fi Networks.
Computer, 2005

Impact of channel prediction on adaptive coded modulation performance in Rayleigh fading.
IEEE Trans. Veh. Technol., 2004

Weaknesses in the temporal key hash of WPA.
ACM SIGMOBILE Mob. Comput. Commun. Rev., 2004

Channel prediction for adaptive coded modulation in Rayleigh fading.
Proceedings of the 11th European Signal Processing Conference, 2002

Spectral efficiency of adaptive coded modulation in urban microcellular networks.
IEEE Trans. Veh. Technol., 2001

On classes of convolutional codes that are not asymptotically catastrophic.
IEEE Trans. Inf. Theory, 2000

Adaptive multidimensional coded modulation over flat fading channels.
IEEE J. Sel. Areas Commun., 2000

Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths.
IEEE Trans. Inf. Theory, 1998

A comparison of trellis modules for binary convolutional codes.
IEEE Trans. Commun., 1998

Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes.
IEEE Trans. Inf. Theory, 1997

Low-complexity decoding of partial unit memory codes on precoded partial-response channels.
IEEE Trans. Inf. Theory, 1997

A note on asymptotically catastrophic convolutional codes of rate (n-1)/n.
IEEE Trans. Commun., 1997

Cosets of convolutional codes with short maximum zero-run lengths.
IEEE Trans. Inf. Theory, 1995

Improved coding techniques for preceded partial-response channels.
IEEE Trans. Inf. Theory, 1994

Punctured convolutional codes for the 1-D partial-response channel.
IEEE Trans. Inf. Theory, 1991

Rate k/(k + 1) punctured convolutional encoders.
IEEE Trans. Inf. Theory, 1991

An algorithm for determining if a rate (n-1)/n punctured convolutional encoder is catastrophic.
IEEE Trans. Commun., 1991

New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding.
IEEE Trans. Inf. Theory, 1988