@article {28371,
	title = {A thousand brains: toward biologically constrained AI},
	journal = {SN Applied Sciences},
	volume = {3},
	number = {8},
	year = {2021},
	month = {07/2021},
	pages = {743},
	publisher = { Springer nature},
	abstract = {This paper reviews the state of artificial intelligence (AI) and the quest to create general AI with human-like cognitive capabilities. Although existing AI methods have produced powerful applications that outperform humans in specific bounded domains, these techniques have fundamental limitations that hinder the creation of general intelligent systems. In parallel, over the last few decades, an explosion of experimental techniques in neuroscience has significantly increased our understanding of the human brain. This review argues that improvements in current AI using mathematical or logical techniques are unlikely to lead to general AI. Instead, the AI community should incorporate neuroscience discoveries about the neocortex, the human brain{\textquoteright}s center of intelligence. The article explains the limitations of current AI techniques. It then focuses on the biologically constrained Thousand Brains Theory describing the neocortex{\textquoteright}s computational principles. Future AI systems can incorporate these principles to overcome the stated limitations of current systems. Finally, the article concludes that AI researchers and neuroscientists should work together on specified topics to achieve biologically constrained AI with human-like capabilities.},
	keywords = {Biologically constrained general AI, Common cortical algorithm, General AI, Limitations of narrow AI, Neocortex, Neuroscience},
	doi = { https://doi.org/10.1007/s42452-021-04715-0},
	author = {Kjell J{\o}rgen {Hole} and Ahmad, Subutai}
}
@article {28372,
	title = {Tutorial on systems with antifragility to downtime},
	journal = {Computing},
	volume = {104},
	number = {1},
	year = {2021},
	month = {01/2021},
	pages = {73-93},
	publisher = {Springer},
	abstract = {An antifragile system of software and stakeholders, including designers, developers, and operators, learn from incidents how to avoid outages and maintain high uptime. This tutorial article reviews how to design and operate such socio-technical systems with antifragility to downtime. It documents the importance of four design principles and two operational principles by exploring the polar opposite anti-principles and the interplay between the principles and the anti-principles. The design principles mandate a software design of separate and isolatable processes with sufficient diversity and redundancy. The processes should communicate asynchronously over an external network. The operational principles imply that the software development teams should repeatedly inject artificial failures into the production system to understand its behavior and detect and mitigate vulnerabilities as the system and its environment change.},
	keywords = {Antifragility, Design principles, Distributed systems, Uptime},
	doi = {https://doi.org/10.1007/s00607-020-00895-6},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {27200,
	title = {Biologically driven AI},
	journal = {IEEE Computer},
	volume = {52},
	year = {2019},
	pages = {72-87},
	publisher = { IEEE},
	author = {Kjell J{\o}rgen {Hole} and Ahmad, S.}
}
@article {27199,
	title = {Dominating software systems},
	journal = {IEEE Software},
	volume = {36},
	year = {2019},
	pages = {81-87},
	publisher = { IEEE},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {27198,
	title = {Software systems with antifragility to downtime},
	journal = {IEEE Computer},
	volume = {52},
	year = {2019},
	pages = {23-31},
	publisher = { IEEE},
	author = {Kjell J{\o}rgen {Hole} and Otterstad, C.}
}
@book {25099,
	title = {Anti-fragile ICT Systems},
	volume = {1},
	year = {2016},
	pages = {151},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	edition = {1},
	address = {Switzerland},
	abstract = {The book introduces a novel approach to the design and operation of large ICT systems. It views the technical solutions and their stakeholders as complex adaptive systems and argues that traditional risk analyses cannot predict all future incidents with major impacts. To avoid unacceptable events, it is necessary to establish and operate\&nbsp;anti-fragile\&nbsp;ICT systems that limit the impact of all incidents, and which learn from small-impact incidents how to function increasingly well in changing environments.The book applies four design principles and one operational principle to achieve anti-fragility for different classes of incidents. It discusses how systems can achieve high availability, prevent malware epidemics, and detect anomalies. Analyses of Netflix{\textquoteright}s media streaming solution, Norwegian telecom infrastructures, e-government platforms, and Numenta{\textquoteright}s anomaly detection software show that cloud computing is essential to achieving anti-fragility for classes of events with negative impacts.},
	doi = {10.1007/978-3-319-30070-2},
	url = {http://link.springer.com/book/10.1007/978-3-319-30070-2},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {25097,
	title = {Building trust in e-government services},
	journal = {IEEE Computer},
	volume = {49},
	year = {2016},
	month = {01/2016},
	pages = {66-74},
	publisher = {IEEE},
	keywords = {Cloud cmputing, Electronic government, Iterative methods, Trust management, User centered design},
	issn = {0018-9162},
	doi = {10.1109/MC.2016.4},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {25098,
	title = {Vendor malware: detection limits and mitigation},
	journal = {IEEE Computer},
	volume = {49},
	year = {2016},
	month = {08/2016},
	pages = {62-69},
	publisher = {IEEE},
	abstract = {Computing device vendors can introduce malware that is nearly impossible to detect with known methods, but microservice solutions can limit the negative impact. Malware contains instructions whose execution negatively impacts stakeholders, typically leading to unauthorized access and computation, data theft, loss of privacy, inability to inspect data, or prolonged downtime. A computing system\&$\#$39;s robustness to malware attacks strongly depends on the ability of the technical system and its stakeholders to either detect inactive malware before it executes or to detect active executing malware as soon as possible, before it causes serious damage. Many previous works discuss the general difficulty of detecting malware, but we focus on the ability of buyers and other legitimate stakeholders to detect malware inserted in computing devices by vendors and other insiders with access to the devices before they reach the buyers.},
	keywords = {Computer architecture, Computer crime, Computer security, Malware, Software Engineering, Supply chain management},
	issn = {0018-9162},
	doi = {10.1109/MC.2016.227},
	author = {Lysne, Olav and Kjell J{\o}rgen {Hole} and Otterstad, Christian and Ytrehus, {\O}yvind and Aarseth, Raymond and Tellnes, J{\o}rgen}
}
@article {24190,
	title = {Diversity Reduces the Impact of Malware},
	journal = {IEEE Security \& Privacy},
	volume = {13},
	year = {2015},
	pages = {48-54},
	publisher = {IEEE},
	abstract = {Many Internet networks have limited internal diversity, making them vulnerable to serious malware spreading. A proposed malware-halting technique that uses software diversity can halt infectious outbreaks on these networks.},
	keywords = {infectious outbreaks, internal diversity, Internet networks, malware-halting technique, serious malware spreading, software diversity},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {27196,
	title = {Toward anti-fragility: a malware-halting technique},
	journal = { IEEE Security \& Privacy},
	volume = {13},
	year = {2015},
	pages = {48-54},
	publisher = {IEEE},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {24188,
	title = {Toward Anti-fragility: A Malware-Halting Technique},
	journal = {IEEE Security \& Privacy},
	volume = {13},
	year = {2015},
	pages = {40-46},
	publisher = {IEEE},
	abstract = {Unlike robust systems, anti-fragile systems learn to adapt to changes and reduce the impact of future incidents. A combination of software diversity and imperfect malware detection can help achieve networked computing systems that are anti-fragile to malware with unknown and time-varying spreading mechanisms.},
	keywords = {anti fragile systems, anti fragility, imperfect malware detection, malware-halting technique, networked computing systems},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {27197,
	title = {Toward anti-fragility: a malware-halting technique},
	journal = { IEEE Security \& Privacy},
	volume = {13},
	year = {2015},
	pages = {40-46},
	publisher = { IEEE},
	author = {Kjell J{\o}rgen {Hole}}
}
@misc {24095,
	title = {D{\o}mt til d{\r a}rlig sikkerhet},
	howpublished = {Chronicle in Bergens Tidende},
	year = {2014},
	month = {02/2014},
	publisher = {Bergens Tidende},
	type = {Chronicle},
	address = {Bergen},
	abstract = {SIKKERHET P{\r A} NETT: Ville vi akseptert at postmannen {\r a}pnet alle brevene v{\r a}re og la innholdet i postkassen?},
	url = {http://www.bt.no/meninger/kronikk/Domt-til-darlig-sikkerhet-3055677.html},
	author = {Raddum, H{\r a}vard and Kjell J{\o}rgen {Hole}}
}
@misc {24192,
	title = {Hva kan gj{\o}res n{\r a}r man ikke stoler p{\r a} de som lager utstyret til Ekom-nettet v{\r a}rt?},
	howpublished = {Justisdepartementet},
	year = {2014},
	publisher = {Kriser{\r a}det},
	author = {Lysne, Olav and Kjell J{\o}rgen {Hole}}
}
@article {24231,
	title = {Management of hidden risks},
	journal = {IEEE Computer},
	volume = {46},
	year = {2013},
	pages = {65-70},
	publisher = {IEEE},
	abstract = {The ability to recover quickly from large-impact, hard-to-predict, and rare incidents without incurring sizable permanent damage is vital to major stakeholders in ICT infrastructures of national importance.},
	keywords = {Adaptive systems, Base stations, Electronic voting, information systems, Mobile handsets, Privacy, risk management, Security},
	doi = {10.1109/MC.2012.397},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {24191,
	title = {  Building and Maintaining Trust in Internet Voting},
	journal = {IEEE Computer},
	volume = {45},
	year = {2012},
	pages = {74-80},
	publisher = {IEEE},
	keywords = {data privacy, government data processing, Internet computer forensics, risk analysis},
	author = {Nestas, L. and Kjell J{\o}rgen {Hole}}
}
@misc {24240,
	title = {Helseopplysninger p{\r a} nett},
	howpublished = {Letter to there editor in Dagens N{\ae}ringsliv},
	year = {2012},
	month = {05/2012},
	author = {Gj{\o}steen, Kristian and Kjell J{\o}rgen {Hole}}
}
@misc {24239,
	title = {Nytt s{\r a}rbarhetsutvalg m{\r a} til},
	howpublished = {Feature article in Dagens N{\ae}ringsliv},
	year = {2012},
	month = {03/2012},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {24232,
	title = {Toward a Practical Technique to Halt Multiple Virus Outbreaks on Computer Networks},
	journal = {Journal of Computer Networks and Communications},
	volume = {2012},
	year = {2012},
	publisher = {Hindawi Publishing Corporation},
	abstract = {The author analyzes a technique to prevent multiple simultaneous virus epidemics on any vulnerable computer network with inhomogeneous topology. The technique immunizes a small fraction of the computers and utilizes diverse software platforms to halt the virus outbreaks. The halting technique is of practical interest since a network{\textquoteright}s detailed topology need not be known.},
	doi = {10.1155/2012/462747},
	author = {Kjell J{\o}rgen {Hole}}
}
@misc {24241,
	title = {Farene ved e-valg},
	howpublished = {Feature article in Dagbladet},
	year = {2011},
	month = {09/2011},
	author = {Kjell J{\o}rgen {Hole} and Gj{\o}steen, Kristian and Tj{\o}stheim, T. and Nestas, L.H.}
}
@misc {24238,
	title = {Systemene vil svikte},
	howpublished = {Feature article in Dagens N{\ae}ringsliv},
	year = {2011},
	month = {12/2011},
	author = {Kjell J{\o}rgen {Hole}}
}
@inproceedings {24088,
	title = {Security Analysis of Mobile Phones Used as OTP Generators},
	journal = {International Workshop on Security Theory and Practice, WISTP 2010},
	volume = {6033},
	year = {2010},
	month = {04/2010},
	pages = {324-331},
	publisher = {Lecture Notes in Computer Science, Springer Verlag},
	abstract = {The Norwegian company Encap has developed protocols enabling individuals to use their mobile phones as one-time password (OTP) generators. An initial analysis of the protocols reveals minor security flaws. System-level testing of an online bank utilizing Encap\&rsquo;s solution then shows that several attacks allow a malicious individual to turn his own mobile phone into an OTP generator for another individual\&rsquo;s bank account. Some of the suggested countermeasures to thwart the attacks are already incorporated in an updated version of the online banking system.},
	isbn = {978-3-642-12367-2},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-12368-9_26},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-12368-9_26},
	author = {Raddum, H{\r a}vard and Lars Hopland {Nest{\r a}s} and Kjell J{\o}rgen {Hole}}
}
@article {24194,
	title = {Toward Risk Assessment of Large-Impact and Rare Events},
	journal = {IEEE Security \& Privacy},
	volume = {8},
	year = {2010},
	pages = {21-27},
	publisher = {IEEE},
	abstract = {Traditional risk assessment methods underestimate the risks of large-impact, hard-to-predict, and rare events in information systems. An alternative approach extends these methods to better evaluate risks associated with black and gray swans.},
	keywords = {information systems, risk management},
	doi = {10.1109/MSP.2010.55},
	author = {Kjell J{\o}rgen {Hole} and Netland, L.-H.}
}
@misc {24242,
	title = {Alvorlige svakheter ved e-valg},
	howpublished = {Letter to editor in Bergens Tidende},
	year = {2009},
	month = {05/2009},
	author = {Kjell J{\o}rgen {Hole}}
}
@misc {24243,
	title = {N{\r a}r folk stemmer hjemme},
	howpublished = {Feature article in HUBRO},
	year = {2009},
	author = {Raddum, H{\r a}vard and Nestas, L.H. and Kjell J{\o}rgen {Hole}}
}
@article {24196,
	title = {  Risk Assessment of a National Security Infrastructure},
	journal = {IEEE Security \& Privacy},
	volume = {7},
	year = {2009},
	pages = {34-41},
	publisher = {IEEE},
	abstract = {In Norway, BankID is the banking industry{\textquoteright}s public-key infrastructure (PKI) of choice for authenticating Internet customers. But do BanklD{\textquoteright}s differences from standard PKIs make it a riskier choice? This assessment, based on both publicly available information and usage experiences, addresses that question.},
	keywords = {bank data processing, Internet, public key cryptography},
	doi = {10.1109/MSP.2009.17},
	author = {Kjell J{\o}rgen {Hole} and Klingsheim, A.N. and Netland, L.-H. and Espelid, Y. and Tjostheim, T. and Moen, V.}
}
@inproceedings {24237,
	title = {Identity Theft: Much too Easy? A study of Online Systems in Norway},
	journal = {12th International Conference on Financial Cryptography and Data Security (FC08)},
	volume = {Volume 5143 of the series Lecture Notes in Computer Science},
	year = {2008},
	pages = {192-196},
	abstract = {Governments and commercial companies connect more and more computer systems to the Internet, giving people easier access to ser- vices. Many of these online services handle personal information. Leak- age of such information can facilitate large-scale identity theft. This paper determines how personal information leaks from online systems of national importance, discusses proof of concept software to demon- strate the seriousness of the problem, and suggests how to improve the situation.},
	author = {Klingsheim, A.N. and Kjell J{\o}rgen {Hole}}
}
@article {24200,
	title = {Open Wireless Networks on University Campuses},
	journal = {IEEE Security \& Privacy},
	volume = {6},
	year = {2008},
	pages = {14-20},
	publisher = {IEEE},
	abstract = {Open wireless networks raise privacy issues and entail increased risk of malicious attacks and illegal downloading activities. Such networks are nonetheless attractive-particularly to universities-because they enhance usability and thus expand access to nonsensitive system resources. At universities, such access brings numerous benefits to students, faculty, and the surrounding community alike. Here, the authors describe the challenges of removing individual user authentication requirements at the perimeter of a university network in which mobile device users access system resources over wireless links to the wired infrastructure. The authors discuss how to mitigate the security and privacy risks entailed in an open network of this sort, and also describe how IT departments can vary the network{\textquoteright}s degree of openness.},
	keywords = {authorisation, radio networks, telecommunication security},
	doi = {10.1109/MSP.2008.92},
	author = {Kjell J{\o}rgen {Hole} and Netland, L.-H. and Espelid, Y. and Klingsheim, A.N. and Helleseth, H. and Henriksen, J.B.}
}
@inproceedings {24236,
	title = {A Proof of Concept Attack against Norwegian Internet Banking Systems},
	journal = {12th International Conference on Financial Cryptography and Data Security (FC08)},
	volume = {Volume 5143 of the series Lecture Notes in Computer Science},
	year = {2008},
	pages = {197-201},
	abstract = {The banking industry in Norway has developed a new secu- rity infrastructure for conducting commerce on the Internet. The initia- tive, called BankID, aims to become a national ID infrastructure sup- porting services such as authentication and digital signatures for the entire Norwegian population. This paper describes a practical man-in- the-middle attack against online banking applications using BankID. The attack gives an adversary access to customer bank accounts in two dif- ferent online banking systems. Proof of concept code has been developed and executed to demonstrate the seriousness of the problem.},
	author = {Espelid, Y. and Netland, L.-H. and Klingsheim, A.N. and Kjell J{\o}rgen {Hole}}
}
@inproceedings {24235,
	title = {Robbing Banks with Their Own software{\textemdash}an Exploit against Norwegian Online Banks},
	journal = {23rd International Information Security Conference (SEC 2008)},
	volume = {Volume 278 of the series IFIP {\textendash} The International Federation for Information Processing },
	year = {2008},
	pages = {63-77},
	publisher = {Springer},
	abstract = {The banking industry in Norway has developed a new security infrastruc- ture for conducting commerce on the Internet. The initiative, called BankID, aims to become a national ID infrastructure supporting services such as authentication and digital signatures for the entire Norwegian population. This paper describes a man-in-the-middle vulnerability in online banking applications using BankID. An exploit has been implemented and successfully run against two randomly chosen online banking systems to demonstrate the seriousness of the attack.},
	author = {Espelid, Y. and Netland, L.-H. and Klingsheim, A.N. and Kjell J{\o}rgen {Hole}}
}
@article {24201,
	title = {Challenges in securing networked J2ME applications},
	journal = {IEEE Computer},
	volume = {40},
	year = {2007},
	pages = {24-30},
	publisher = {IEEE},
	abstract = {An increasing number of smart phones support Java 2, Micro Edition. Mobile application developers must deal with J2ME{\textquoteright}s inherent security weaknesses as well as bugs in implementations on real devices. The new Security and Trust Services API for J2ME addresses some of these challenges, although it too has shortcomings.},
	keywords = {application program interfaces, Java, mobile computing, security of data},
	doi = {10.1109/MC.2007.49},
	author = {Klingsheim, A.N. and Moen, V. and Kjell J{\o}rgen {Hole}}
}
@article {24202,
	title = {Lessons from the Norwegian ATM System},
	journal = {IEEE Security \& Privacy},
	volume = {5},
	year = {2007},
	pages = {25-31},
	publisher = {IEEE},
	abstract = {This case study focuses on real-world ATM card misuse, illustrating how too much secrecy led to a deterioration of PIN-based authentication procedures, and why a bank{\textquoteright}s refusal to share technical information is a threat to customers during a conflict.},
	keywords = {automatic teller machines, message authentication},
	doi = {10.1109/MSP.2007.168},
	author = {Kjell J{\o}rgen {Hole} and Moen, V. and Klingsheim, A.N. and Tande, K.M.}
}
@article {24233,
	title = {Vulnerabilities in E-Governments},
	journal = {International Journal of Electronic Security and Digital Forensics},
	volume = {1},
	year = {2007},
	pages = {89-100},
	publisher = {InderScience Publishers},
	abstract = {This paper shows that more than 80\% of the E-Governments in the world are vulnerable to common Web-application attacks such as Cross Site Scripting and SQL injection. Industrialized countries were found to be more vulnerable than under-developed countries (90\% vs. 50\%). The paper also describes some malicious data mining possibilities on the Norwegian E-Government, and how information can be combined and used to create other practical attacks.},
	keywords = {cross site scripting, e-government, Electronic government, electronic security, Privacy, SQL injection, vulnerabilities, web application attacks},
	doi = {10.1504/IJESDF.2007.013595},
	author = {Moen, V. and Klingsheim, A.N. and Simonsen, K.I.F. and Kjell J{\o}rgen {Hole}}
}
@article {24208,
	title = {Adaptive coded modulation with receive antenna diversity and imperfect channel knowledge at receiver and transmitter},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {55},
	year = {2006},
	pages = {458 - 465},
	publisher = {IEEE},
	abstract = {Unifying and generalizing the works of Cai and Giannakis and Oien et al., the performance of an adaptive trellis-coded modulation system where receive antenna diversity is implemented by means of maximum ratio combining is analyzed and optimized. As in the work of Cai and Giannakis, the analysis is done in the presence of both estimation and prediction errors. Rayleigh fading on each subchannel is considered, with the estimation and prediction being performed independently on each subchannel. The system optimization process is done in such a way that the throughput is maximized under a bit-error-rate (BER) constraint. The numerical example employs a Jakes-fading spectrum and shows how the power should be distributed between pilot and data symbols and how often pilot symbols should be transmitted for maximum throughput under an instantaneous (with respect to the predicted channel) BER constraint.},
	keywords = {Adaptive systems, Bit error rate, Diversity reception, Estimation error, Modulation coding, Performance Analysis, Rayleigh channels, Receiving antennas, Throughput, Transmitters},
	doi = {10.1109/TVT.2005.863348},
	author = {Duong, D.V. and Oien, G.E. and Kjell J{\o}rgen {Hole}}
}
@article {24211,
	title = {Case study: online banking security},
	journal = {IEEE Security \& Privacy},
	volume = {4},
	year = {2006},
	pages = {14-20},
	publisher = {IEEE},
	abstract = {A description of attack scenarios over a two-year period illustrates several key security issues with Internet banking systems in Norway. Given the banks{\textquoteright} security-by-obscurity policy, online customers knew little about security levels and falsely believed their assets were safe.},
	doi = {10.1109/MSP.2006.36},
	author = {Kjell J{\o}rgen {Hole} and Moen, V. and Tjostheim, T.}
}
@article {24215,
	title = {Securing Wi-Fi networks},
	journal = {IEEE Computer},
	volume = {38},
	year = {2005},
	pages = {28-34},
	publisher = {IEEE},
	abstract = {Wi-Fi networks, based on the IEEE 802.11 b/g standards, have become very popular in recent years. Many users have installed Wi-Fi networks at home, and numerous corporations have added Wi-Fi access points to their wired networks, giving employees easier access to corporate data and services. Hackers can decrypt and read data on a wireless link protected by built-in WEP encryption, and may even be able to access the data on a wired network through a Wi-Fi access point. We assess Wi-Fi network security in one city, analyze alternative security techniques, and suggest ways to secure such networks.},
	keywords = {Cities and towns, Communication system security, Computer crime, Computer hacking, Computer networks, Cryptography Data security},
	doi = {10.1109/MC.2005.241},
	author = {Kjell J{\o}rgen {Hole} and Dyrnes, E. and Thorsheim, P.}
}
@article {24219,
	title = {Impact of channel prediction on adaptive coded modulation performance in Rayleigh fading},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {53},
	year = {2004},
	pages = {758-769},
	publisher = {IEEE},
	doi = {10.1109/TVT.2004.827156},
	author = {Oien, G.E. and Holm, H. and Kjell J{\o}rgen {Hole}}
}
@article {24078,
	title = {Weaknesses in the temporal key hash of WPA},
	journal = {Mobile Computing and Communications Review},
	volume = {8},
	year = {2004},
	month = {04/2004},
	pages = {76-83},
	publisher = {ACM Sigmobile},
	abstract = {This article describes some weaknesses in the key scheduling in Wi-Fi Protected Access (WPA) put forward to secure the IEEE standard 802.11-1999. Given a few RC4 packet keys in WPA it is possible to find the Temporal Key (TK) and the Message Integrity Check (MIC) key. This is not a practical attack on WPA, but it shows that parts of WPA are weak on their own. Using this attack it is possible to do a TK recovery attack on WPA with complexity\&nbsp;O(2105) compared to a brute force attack with complexity\&nbsp;O\&nbsp;(2128).},
	keywords = {802.11, MIC, Michael, temporal key hash, TKIP, WPA},
	doi = {10.1145/997122.997132},
	author = {Moen, Vebj{\o}rn and Raddum, H{\r a}vard and Kjell J{\o}rgen {Hole}}
}
@inproceedings {24224,
	title = {  Limitations in spectral efficiency of a rate-adaptive MIMO system utilizing pilot-aided channel prediction},
	journal = {The 57th IEEE Semiannual  Vehicular Technology Conference, 2003 (VTC 2003-Spring)},
	volume = {1},
	year = {2003},
	pages = {282-286},
	abstract = {A performance analysis of an adaptive modulation (ACM) system operating on a multiple-input multiple-output (MIMO) channel with uncorrelated Rayleigh fading subchannels is presented. Rate adaptation is based on periodically transmitted channel state information (CSI) back to the transmitter, providing information about the channel signal-to-noise ratio (CSNR) as predicted by the receiver. Transmit diversity is utilized by employing space-time block coding (STBC) at the transmitter.},
	doi = {10.1109/VETECS.2003.1207547},
	author = {Holter, B. and Oien, G.E. and Kjell J{\o}rgen {Hole} and Holm, H.}
}
@article {24222,
	title = {  New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding},
	journal = { IEEE Transactions on Information Theory },
	volume = {34},
	year = {2002},
	pages = {1079-1081},
	publisher = {IEEE},
	abstract = {Punctured convolutional codes with good performance are reported for rates ( n -1)/ n \&nbsp;with\&nbsp; n =5, 6, 7, 8 and constraint lengths\&nbsp; k =2, 3, . . ., 6. The tabulated codes are nonsystematic binary convolutional codes with maximum free distance and minimum information weight, for use with soft-decision Viterbi decoding},
	keywords = {punctured convolutional codes, soft-decision Viterbi decoding},
	doi = {10.1109/18.21236},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {24220,
	title = {Spectral efficiency of adaptive coded modulation in urban microcellular networks},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {50},
	year = {2001},
	pages = {205-222},
	publisher = {IEEE},
	keywords = {Adaptive coding, Convolutional codes, Degradation, Fading, Information rates, Intelligent networks, Interference},
	doi = {10.1109/25.917922},
	author = {Kjell J{\o}rgen {Hole} and Oien, G.E.}
}
@article {24218,
	title = {Adaptive multidimensional coded modulation over flat fading channels},
	journal = { IEEE Journal on Selected Areas in Communications (IEEE JSAC)},
	volume = {18},
	year = {2000},
	pages = {1153-1158},
	publisher = {IEEE},
	keywords = {Adaptive coding, Additive white noise, AWGN channels, Codecs, Convolutional codes, Decoding, Fading, Feedback, Modulation coding, Multidimensional systems},
	doi = {10.1109/49.857915},
	author = {Kjell J{\o}rgen {Hole} and Holm, H. and Oien, G.E.}
}
@article {24225,
	title = {On classes of convolutional codes that are not asymptotically catastrophic},
	journal = { IEEE Transactions on Information Theory },
	volume = {46},
	year = {2000},
	pages = {663-669},
	publisher = {IEEE},
	abstract = {The author denotes by w0\&nbsp;the minimum average weight per edge over all nonzero cycles in the state diagram for a convolutional code, and assumes that a technique is available for generating canonical parity-check matrices for codes with increasing degree m. The obtained class of codes is asymptotically catastrophic if w0\&nbsp;approaches zero for large m. We prove the existence of convolutional code classes that are not asymptotically catastrophic by providing explicit constructions of codes with nonzero w0\&nbsp;for all m},
	keywords = {Bit error rate, Convolutional codes},
	doi = {10.1109/18.825838},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {24229,
	title = {A note on asymptotically catastrophic convolutional codes of rate (n-1)/n},
	journal = { IEEE Transactions on Communications},
	volume = {45},
	year = {1997},
	pages = {1014-1016},
	publisher = {IEEE},
	abstract = {Convolutional codes with rate R=(n-1)/n,n⩾2, are defined in terms of their minimal parity check matrices. The matrices are represented by a binary vector notation introduced by Ytrehus (1992). The upper bounds on ω0 (minimum average weight per branch) are presented. Many classes of rate (n-1)/n convolutional codes are shown to be asymptotically catastrophic},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {24227,
	title = {  Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes},
	journal = {IEEE Transactions on Information Theory },
	volume = {43},
	year = {1997},
	pages = {1301-1305},
	publisher = {IEEE},
	abstract = {Consider a cycle in the state diagram of a convolutional code. The average weight per branch of the cycle is equal to the total Hamming weight of all labels on the branches divided by the number of branches. Let w0\&nbsp;be the minimum average weight per branch over all cycles in the state diagram, except the zero state self-loop of weight zero. Codes with low w0\&nbsp;result in high bit error probabilities when they are used with either Viterbi or sequential decoding. Hemmati and Costello (1980) showed that w0\&nbsp;is upper-bounded by 2ν-2/(3{\textperiodcentered}2ν-2-1) for a class of (2,1) codes where ν denotes the constraint length. In the present correspondence it is shown that the bound is valid for a large class of (n,n-1) codes, n⩾2. Examples of high-rate codes with w0\&nbsp;equal to the upper bound are also given. Hemmati and Costello defined a class of codes to be asymptotically catastrophic if w\&nbsp;0\&nbsp;approaches zero for large ν. The class of (n,n-1) codes constructed by Wyner and Ash (1963) is shown to be asymptotically catastrophic. All codes in the class have minimum possible w0\&nbsp;equal to 1/ν},
	keywords = {Convolutional codes, error statistics, minimisation},
	doi = {10.1109/18.605599},
	author = {Hole, M.F. and Kjell J{\o}rgen {Hole}}
}
@article {24228,
	title = { Cosets of convolutional codes with short maximum zero-run lengths},
	journal = {IEEE Transactions on Information Theory},
	volume = {41},
	year = {1995},
	pages = {1145-1150},
	publisher = {IEEE},
	abstract = {Communication systems and storage systems derive symbol synchronization from the received symbol stream. To facilitate symbol synchronization, the channel sequences must have a short maximum zero-run length. One way to achieve this is to use a coset of an (n, k) convolutional code to generate the channel inputs. For k⩽n-2, it is shown that there exist cosets with short maximum zero-run length for any constraint length. Any coset of an (n, n-1) code with high rate and/or large constraint length is shown to have a large maximum zero-run length. A systematic procedure for obtaining cosets with short maximum zero-run length from (n, k) codes is presented, and new cosets with short maximum zero-run length and large minimum Hamming distance are tabulated},
	keywords = {Convolutional codes, encoding, Error correction, Hamming distance},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {24223,
	title = {Improved coding techniques for preceded partial-response channels},
	journal = { IEEE Transactions on Information Theory},
	volume = {40},
	year = {1994},
	pages = {482 - 493},
	publisher = {IEEE},
	abstract = {A coset of a convolutional code may be used to generate a zero-run length limited trellis code for a 1-D partial-response channel. The free squared Euclidean distance, dfree2, at the channel output is lower bounded by the free Hamming distance of the convolutional code. The lower bound suggests the use of a convolutional code with maximal free Hamming distance, dmax(R,N), for given rate R and number of decoder states N. In this paper we present cosets of convolutional codes that generate trellis codes with dfree\&nbsp;2\&gt;dmax(R,N) for rates 1/5⩽R⩽7/9 and (d\&nbsp;free2=dmax(R,N) for R=13/16,29/32,61/64, The tabulated convolutional codes with R⩽7/9 were not optimized for Hamming distance. Instead, a computer search was used to determine cosets of convolutional codes that exploit the memory of the 1-D channel to increase dfree2\&nbsp;at the channel output. The search was limited by only considering cosets with certain structural properties. The R⩾13/16 codes were obtained using a new construction technique for convolutional codes with free Hamming distance 4. Newly developed bounds on the maximum zero-run lengths of cosets were used to ensure a short maximum run length at the 1-D channel output},
	keywords = {Convolutional codes, encoding, telecommunication channels, trellis codes},
	doi = {10.1109/18.312170},
	author = {Kjell J{\o}rgen {Hole} and Ytrehus, O.}
}
@article {24221,
	title = {Punctured convolutional codes for the 1-D partial-response channel},
	journal = {IEEE Transactions on Information Theory },
	volume = {37},
	year = {1991},
	pages = {808-817},
	publisher = {IEEE},
	abstract = {A coded (1-D) system containing a punctured convolutional encoder is analyzed. In general, a punctured encoder with 2v\&nbsp;states results in a decoder trellis with 2v+1\&nbsp;states and a periodically time-varying branch structure. A class C of punctured convolutional encoders for which the decoder trellis has a fixed branch structure with 2v\&nbsp;states is described. An encoder in this class can be combined with a precoder to form a new punctured convolutional encoder that generates the output from the precoder. The author determines the set of good variable-rate trellis codes for selectable rate encoding and Viterbi decoding. A set of variable-rate trellis codes is generated by a variable-rate punctured convolutional encoder in C. The author also determines punctured convolutional encoders in C that generate a single good high-rate trellis code.},
	keywords = {Convolutional codes, Decoding, Euclidean distance, Hamming distance},
	doi = {10.1109/18.79950},
	author = {Kjell J{\o}rgen {Hole}}
}
