# Øyvind Ytrehus

Professor
• E-mailoyvind.ytrehus@uib.no
• Phone+47 411 07 855
HIB - Thormøhlens gate 55
5006 Bergen
Postboks 7803
5020 Bergen
• Show author(s) (2019). Solving non-linear Boolean equation systems by variable elimination. Applicable Algebra in Engineering, Communication and Computing. 3-47.
• Show author(s) (2018). Rate (n-1)/n Systematic Memory Maximum Distance Separable Convolutional Codes. IEEE Transactions on Information Theory. 3018-3030.
• Show author(s) (2018). LDPC Codes Over the BEC: Bounds and Decoding Algorithms. IEEE Transactions on Communications. 1754-1769.
• Show author(s) (2016). Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC. International Symposium on Turbo Codes and Iterative Information Processing, ISTC. 16-20.
• Show author(s) (2016). Vendor malware: detection limits and mitigation. Computer. 62-69.
• Show author(s) (2014). Near-field passive RFID communication: Channel model and code design. IEEE Transactions on Communications. 1716-1727.
• Show author(s) (2012). On the power transfer of error-control codes for RFID communications. IEEE International Symposium on Information Theory. Proceedings. 498-502.
• Show author(s) (2012). Coding for inductively coupled channels. IEEE Transactions on Information Theory. 5418-5436.
• Show author(s) (2012). Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”. IEEE Transactions on Information Theory. 164-171.
• Show author(s) (2011). Numerical Study of Power Transfer in a Passive RFID System. AIP Conference Proceedings. 1874-1877.
• Show author(s) (2009). An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices. IEEE Transactions on Information Theory. 4167-4178.
• Show author(s) (2008). Communication on Inductively Coupled Channels: Overview and Challenges. Lecture Notes in Computer Science (LNCS). 186-195.
• Show author(s) (2007). Turbo decoding on the binary erasure channel: Finite-length analysis and turbo stopping sets. IEEE Transactions on Information Theory. 4059-4075.
• Show author(s) (2006). On the design of bit-interleaved turbo-coded modulation with low error floors. IEEE Transactions on Communications. 1563-1573.
• Show author(s) (2006). Cycle-logical treatment for "Cyclopathic" networks. IEEE Transactions on Information Theory. 2795-2804.
• Show author(s) (2005). Improved algorithms for the determination of turbo-code weight distributions. IEEE Transactions on Communications. 20-26.
• Show author(s) (2004). Sphere-Packing Bounds for Convolutional Codes. IEEE Transactions on Information Theory. 2801-2809.
• Show author(s) (2004). On maximum length convolutional codes under a trellis complexity constraint. Journal of Complexity. 372-403.
• Show author(s) (2004). High rate convolutional codes with optimal cycle weights. Lecture Notes in Computer Science (LNCS). 4-23.
• Show author(s) (2001). On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels. Discrete Mathematics. 51-63.
• Show author(s) (2000). There is no ternary [28,6,18] code. IEEE Transactions on Information Theory. 1550-1554.
• Show author(s) (1998). Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels. IEEE Transactions on Information Theory. 1593-1602.
• Show author(s) (1998). Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths. IEEE Transactions on Information Theory. 423-431.
• Show author(s) (1997). Two-Step Trellis decoding of Partial Unit memory Codes. IEEE Transactions on Information Theory. 324-330.
• Show author(s) (1997). On the [162,8,80] codes. IEEE Transactions on Information Theory. 2055.
• Show author(s) (1995). On The Trellis Complexity of Certain Binary Linear Block Codes. IEEE Transactions on Information Theory. 559-560.
• Show author(s) (1995). Bounds on the Minimum Support Weights. IEEE Transactions on Information Theory. 432-440.
• Show author(s) (1994). Improved Coding Techniques for Precoded Partial-Response Channels. IEEE Transactions on Information Theory. 482-493.
• Show author(s) (1994). Generalizations of the Griesmer bound. Error Control, Cryptography and Speech Compression. Lecture Notes in Computer Science (LNCS). 41-52.
• Show author(s) (1993). There are exact two nonequivalent @<20,5,12;3@>-codes. Ars combinatoria. 3-14.
• Show author(s) (1993). A new class of nonbinary codes meeting the Griesmer bound. Discrete Applied Mathematics. 219-226.
• Show author(s) (1993). A characterization of @(2(q+1)+2,2,2;t,q@)-minihypers in PG(t,q)(t@Z3,q_e@(3,4@)). Discrete Mathematics. 175-185.
• Show author(s) (1992). On the construction of @<q%4 + q%2 - q,5,q%4 - q%3 + q%2 - 2q;q@>codes meeting the Griesmer bound. Designs, Codes and Cryptography. 225-229.
• Show author(s) (1992). Generalized Hamming weights of linear codes. IEEE Transactions on Information Theory. 1133-1140.
• Show author(s) (1991). Upper bounds on error-correcting runlenght limited block codes. IEEE Transactions on Information Theory. 941-945.
• Show author(s) (1991). Runlenght limited codes for mixed channels. IEEE Transactions on Information Theory. 1577-1585.
• Show author(s) (1991). @<18.11@>2 codes do not exist. Nor do @<64,53@>2 codes. IEEE Transactions on Information Theory. 349-351.
Report
• Show author(s) (2005). The International Workshop on Coding and Cryptography 2005: Book of Extended Abstracts. .
• Show author(s) (2003). Lecture Notes for the International Mini-workshop: Coding for Kløve. 259. 259. .
• Show author(s) (2003). Avoiding Cycles in Combined Turbo Decoding and Channel Estimation for Correlated Fading Channels. 241. 241. .
• Show author(s) (1993). On generalizations of the Grismer bound. 87. 87. .
• Show author(s) (1992). Excess sequences of codes and the chain condition. .
• Show author(s) (1992). Constructions and proofs of nonexistence of some convolutional codes. .
• Show author(s) (1992). Constructions and proofs of nonexistence of some convolutional codes. .
• Show author(s) (1992). A note on high rate binary convolutional codes. .
• Show author(s) (1992). A note on high rate binary convolutional codes. .
• Show author(s) (1989). How to find a 33,8,14Å code. .
• Show author(s) (1989). A rate 3/8 (1,3) constrained code with free hamming distance 3. .
• Show author(s) (1987). Code-buster: A software tool for characterizing abstract codes. .
• Show author(s) (1986). New bounds on the minimum lenght of binary block codes of dimension 8. .
Popular scientific lecture
• Show author(s) (1994). On Trellis Decoding.
• Show author(s) (2015). Message merging for routing.
• Show author(s) (2009). Network coding for wireless multicast networks.
• Show author(s) (2009). Graphs applied to codes.
• Show author(s) (2007). Secure and Reliable Communicationfor the Inductively Coupled Channel.
• Show author(s) (2007). Graphs applied to codes.
• Show author(s) (2007). Coco communications.
• Show author(s) (2006). Network coding for cyclic networks.
• Show author(s) (2006). Network coding.
• Show author(s) (2006). Knotwork coding.
• Show author(s) (2006). Innføring i nettverkskoding.
• Show author(s) (2004). On lowering the error floor of bit-interleaved turbo-coded modulation.
• Show author(s) (2004). On convolutional codes and sphere packing bounds.
• Show author(s) (2004). On bit-interleaved turbo-coded modulation with low error floors.
• Show author(s) (2004). Enhanced decoding by error detection on a channel with correlated 2-dimensional errors.
• Show author(s) (2003). On Trellis Complexity Constrained Convolutional Codes of Maximum Length.
• Show author(s) (2003). Improved Algorithms for High Rate Turbo Code Weight Distribution Calculation.
• Show author(s) (2003). High Rate Convolutional Codes with Optimal Cycle Weights.
• Show author(s) (2002). Reduced Trellis State Complexity Convolutional Code Constructions.
• Show author(s) (2002). On algorithms for determination of turbo code weight distributions.
• Show author(s) (2001). Fast algorithms for determining the weight distribution of turbo codes.
• Show author(s) (1998). Modifications of the Rao-Nam cryptosystem.
• Show author(s) (1998). Coding for Channels with Local Data Dependent Noise.
• Show author(s) (1997). Trellis complexity and generalized Hamming weights.
• Show author(s) (1997). On Codes for Error Correction and Block Synchronization.
• Show author(s) (1997). How to determine cosets of convolutional codes with least possible maximum zero run length.
• Show author(s) (1997). Difference Set Codes For.
• Show author(s) (1996). Two New Binary Optimal 8-Dimensional Codes.
• Show author(s) (1996). Two New Binary Optimal 8-Dimensional Codes.
• Show author(s) (1996). Self-Synchronizing Cosets of Convolutional Codes.
• Show author(s) (1995). Further results on cosets of convolutional codes with short maximum zero-run lengths.
• Show author(s) (1995). Convolutional codes for partial-response channels.
• Show author(s) (1995). Ascetic Convolutional Codes.
• Show author(s) (1994). Trellis Codes for precodes I-D partial-response channels: Further improved search techniques.
• Show author(s) (1994). On Viterbi decoding of high-rate convolutional codes on partial-response channels.
• Show author(s) (1994). On Viterbi decoding of high-rate convolutional codes.
• Show author(s) (1994). Convolutional Codes for precoded partial-response channels: A Review.
• Show author(s) (1993). On the trellis complexity of block codes.
• Show author(s) (1993). New zero-run lenght limited codes for partial response channels.
• Show author(s) (1993). Block code based analysis of convolutional codes.
• Show author(s) (1992). Codes, weight hierarchies and chains.
• Show author(s) (1992). Codes and the chain condition.
• Show author(s) (1991). A new class of nonbinary codes meeting the Griesmer bound.
Editorial
• Show author(s) (2022). Preface of special issue on coding theory and applications. Cryptography and Communications. 503.
• Show author(s) (2017). Coding theory and applications: 5th international castle meeting, ICMCTA 2017 Vihula, Estonia, august 28-31, 2017 proceedings. Lecture Notes in Computer Science (LNCS). III-IV.
• Show author(s) (2013). Special Issue on Coding and Cryptography. Designs, Codes and Cryptography. 1-2.
• Show author(s) (2008). Special issue dedicated to Professor Torleiv Kløve for his 65th birthday - Preface. Designs, Codes and Cryptography. 109-110.
• Show author(s) (2007). 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks. IEEE Press.
• Show author(s) (2006). Coding and Cryptography International Workshop, WCC 2005 Bergen, Norway, March 2005 Revised Selected Papers. Springer.
Popular scientific article
• Show author(s) (2002). An Introduction to Turbo Codes and Iterative Decoding. Telektronikk. 65-77.
Doctoral dissertation
• Show author(s) (2018). Systems of Boolean equations, elimination theory, and applications to cryptography.
• Show author(s) (2017). Selected x86 Low-level Attacks and Mitigations.
• Show author(s) (2015). Security protocols and related topics.
• Show author(s) (1989). Codes for error control.
• Show author(s) (2015). A Coding-Based Approach to Robust Shortest-Path Routing. 8 pages.
• Show author(s) (2014). Information exchange for routing protocols . 8 pages.
• Show author(s) (2013). Personnummerering i Norge: Litt anvendt kodeteori og økonomi. 12 pages.
• Show author(s) (2012). Error correction on an insertion/deletion channel applying codes from RFID standards. 6 pages.
• Show author(s) (2011). On the Capacity of a Discretized Gaussian Shift Channel. 6 pages.
• Show author(s) (2011). Constrained Codes for Passive RFID Communication. 9 pages.
• Show author(s) (2010). Rate of convergence in cooperative games on COPE-encoded wireless networks. 2 pages.
• Show author(s) (2010). Queuing aspects of packet coding based bidirectional communication over satellite channels. 8 pages.
• Show author(s) (2010). Power savings of cyclic network coding for multicast on wireless networks. 5 pages.
• Show author(s) (2010). Introduction to Network Coding for Acyclic and Cyclic Networks. 84 pages.
• Show author(s) (2010). Exploiting the CRC-CCITT Code on the Binary Erasure Channel. 5 pages.
• Show author(s) (2010). Coding Challenges for Inductively Coupled Channels. 2 pages.
• Show author(s) (2009). Improved Delay Estimates for a Queueing Model for Random Linear Coding for Unicast. 5 pages.
• Show author(s) (2009). Coding for a Bit-Shift Channel With Applications to Inductively Coupled Channels. 6 pages.
• Show author(s) (2008). Two Layer Secure Network Coding - (2-LSNC). 6 pages.
• Show author(s) (2008). Modulation Codes for Reader-Tag Communication on Inductively Coupled Channels. 6 pages.
• Show author(s) (2008). Lighweight cryptography for RFID devices. 4 pages.
• Show author(s) (2008). Coding on networks. 1 pages.
• Show author(s) (2007). Facts of LIFE. 6 pages.
• Show author(s) (2007). An algorithm to find all small-size stopping sets of low-density parity-check matrices. 5 pages.
• Show author(s) (2006). Preface. 1 pages.
• Show author(s) (2006). Maximum likelihood decoding of codes on the Z-channel. 6 pages.
• Show author(s) (2006). Maximum Likelihood Decoding of Codes on the Z-channel. 6 pages.
• Show author(s) (2006). Heuristic algorithms for small field multicast encoding. 5 pages.
• Show author(s) (2005). Turbo stopping sets: the uniform interleaver and efficient enumeration. 5 pages.
• Show author(s) (2005). On the construction of good families of rate-compatible punctured turbo codes. 5 pages.
• Show author(s) (2005). Finite-length analysis of turbo decoding on the binary erasure channel. 5 pages.
Poster
• Show author(s) (2003). An Efficient Algorithm for Tailbiting Turbo Code Weight Distribution Calculation.