Kjell Jørgen Hole

Computing, 2022

2019

Dominating Software Systems: How to Overcome Online Information Asymmetry.

[BibT_eX]

[DOI]

IEEE Softw., 2019

Software Systems With Antifragility to Downtime.

[BibT_eX]

[DOI]

Christian Otterstad

Computer, 2019

Biologically Driven Artificial Intelligence.

[BibT_eX]

[DOI]

Subutai Ahmad

Computer, 2019

2016

Vendor Malware: Detection Limits and Mitigation.

[BibT_eX]

[DOI]

Computer, 2016

Building Trust in E-Government Services.

[BibT_eX]

[DOI]

Computer, 2016

Anti-fragile ICT Systems

[BibT_eX]

[DOI]

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

2015

Toward Anti-fragility: A Malware-Halting Technique.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2015

Diversity Reduces the Impact of Malware.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2015

2013

Management of Hidden Risks.

[BibT_eX]

[DOI]

Computer, 2013

2012

Toward a Practical Technique to Halt Multiple Virus Outbreaks on Computer Networks.

[BibT_eX]

[DOI]

J. Comput. Networks Commun., 2012

Building and Maintaining Trust in Internet Voting.

[BibT_eX]

[DOI]

Lars Hopland Nestås

Computer, 2012

2010

Toward Risk Assessment of Large-Impact and Rare Events.

[BibT_eX]

[DOI]

Lars-Helge Netland

IEEE Secur. Priv., 2010

Security Analysis of Mobile Phones Used as OTP Generators.

[BibT_eX]

[DOI]

Håvard Raddum

Lars Hopland Nestås

Proceedings of the Information Security Theory and Practices. Security and Privacy of Pervasive Systems and Smart Devices, 2010

2009

Risk Assessment of a National Security Infrastructure.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2009

2008

Open Wireless Networks on University Campuses.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2008

Rate and Power Allocation for Discrete-Rate Link Adaptation.

[BibT_eX]

[DOI]

EURASIP J. Wirel. Commun. Netw., 2008

Robbing Banks with Their Own Software-an Exploit Against Norwegian Online Banks.

[BibT_eX]

[DOI]

Proceedings of The IFIP TC-11 23rd International Information Security Conference, 2008

Identity Theft: Much Too Easy? A Study of Online Systems in Norway.

[BibT_eX]

[DOI]

André N. Klingsheim

Proceedings of the Financial Cryptography and Data Security, 12th International Conference, 2008

A Proof of Concept Attack against Norwegian Internet Banking Systems.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 12th International Conference, 2008

2007

Vulnerabilities in e-governments.

[BibT_eX]

[DOI]

Kent Inge Fagerland Simonsen

André N. Klingsheim

Int. J. Electron. Secur. Digit. Forensics, 2007

Lessons from the Norwegian ATM System.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2007

Challenges in Securing Networked J2ME Applications.

[BibT_eX]

[DOI]

André N. Klingsheim

Computer, 2007

2006

Adaptive coded modulation with receive antenna diversity and imperfect channel knowledge at receiver and transmitter.

[BibT_eX]

[DOI]

Duc V. Duong

IEEE Trans. Veh. Technol., 2006

Case Study: Online Banking Security.

[BibT_eX]

[DOI]

Thomas Tjøstheim

IEEE Secur. Priv., 2006

Simplifying Client-Server Application Development with Secure Reusable Components.

[BibT_eX]

Proceedings of the 2006 IEEE International Symposium on Secure Software Engineering, 2006

2005

Securing Wi-Fi Networks.

[BibT_eX]

[DOI]

Erlend Dyrnes

Per Thorsheim

Computer, 2005

2004

Impact of channel prediction on adaptive coded modulation performance in Rayleigh fading.

[BibT_eX]

[DOI]

Henrik Holm

IEEE Trans. Veh. Technol., 2004

Weaknesses in the temporal key hash of WPA.

[BibT_eX]

[DOI]

Håvard Raddum

ACM SIGMOBILE Mob. Comput. Commun. Rev., 2004

2002

Channel prediction for adaptive coded modulation in Rayleigh fading.

[BibT_eX]

[DOI]

Henrik Holm

Proceedings of the 11th European Signal Processing Conference, 2002

2001

Spectral efficiency of adaptive coded modulation in urban microcellular networks.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2001

2000

On classes of convolutional codes that are not asymptotically catastrophic.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Adaptive multidimensional coded modulation over flat fading channels.

[BibT_eX]

[DOI]

Henrik Holm

IEEE J. Sel. Areas Commun., 2000

1998

Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths.

[BibT_eX]

[DOI]

Øyvind Ytrehus

IEEE Trans. Inf. Theory, 1998

A comparison of trellis modules for binary convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1998

1997

Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes.

[BibT_eX]

[DOI]

M. F. Hole

IEEE Trans. Inf. Theory, 1997

Low-complexity decoding of partial unit memory codes on precoded partial-response channels.

[BibT_eX]

[DOI]

M. F. Hole

IEEE Trans. Inf. Theory, 1997

A note on asymptotically catastrophic convolutional codes of rate (n-1)/n.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1997

1995

Cosets of convolutional codes with short maximum zero-run lengths.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1994

Improved coding techniques for preceded partial-response channels.

[BibT_eX]

[DOI]

Øyvind Ytrehus

IEEE Trans. Inf. Theory, 1994

1991

Punctured convolutional codes for the 1-D partial-response channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Rate k/(k + 1) punctured convolutional encoders.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

An algorithm for determining if a rate (n-1)/n punctured convolutional encoder is catastrophic.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1991

1988

New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding.

[BibT_eX]

[DOI]