Vitenskapelig artikkel

• Gustavo T. Bastos; Maiara F. Bollauf; Agnaldo J. Ferreira et al. (2025). Linearity of $$\mathbb {Z}_{2^L}$$-linear codes via Schur product. (ekstern lenke)
• N. Hamada; Tor Helleseth; Øyvind Ytrehus (1993). There are exact two nonequivalent @<20,5,12;3@>-codes. (ekstern lenke)
• Øyvind Ytrehus (1991). Runlenght limited codes for mixed channels. (ekstern lenke)
• Khaled A.S. Abdel-Ghaffar; Øyvind Ytrehus (1998). Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2006). Cycle-logical treatment for "Cyclopathic" networks. (ekstern lenke)
• Øyvind Ytrehus (2008). Communication on Inductively Coupled Channels: Overview and Challenges. (ekstern lenke)
• Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (2024). Secrecy Gain of Formally Unimodular Lattices From Codes Over the Integers Modulo 4. (ekstern lenke)
• Noboru Hamada; Tor Helleseth; Halvard Martinsen et al. (2000). There is no ternary [28,6,18] code. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus; Marcel Adryan Ambroze et al. (2012). Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”. (ekstern lenke)
• Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (2023). Formally Unimodular Packings for the Gaussian Wiretap Channel. (ekstern lenke)
• Angela Barbero; Øyvind Ytrehus (2018). Rate (n-1)/n Systematic Memory Maximum Distance Separable Convolutional Codes. (ekstern lenke)
• E Rosnes; Øyvind Ytrehus (2004). High rate convolutional codes with optimal cycle weights. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2004). On maximum length convolutional codes under a trellis complexity constraint. (ekstern lenke)
• Marianne Fjelltveit Hole; Øyvind Ytrehus (1997). Two-Step Trellis decoding of Partial Unit memory Codes. (ekstern lenke)
• Øyvind Ytrehus (1995). On The Trellis Complexity of Certain Binary Linear Block Codes. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2006). On the design of bit-interleaved turbo-coded modulation with low error floors. (ekstern lenke)
• Olav Lysne; Kjell Jørgen Hole; Christian W. Otterstad et al. (2016). Vendor malware: detection limits and mitigation. (ekstern lenke)
• N. Hamada; Tor Helleseth; Øyvind Ytrehus (1993). A characterization of @(2(q+1)+2,2,2;t,q@)-minihypers in PG(t,q)(t@Z3,q_e@(3,4@)). (ekstern lenke)
• Guang Yang; Eirik Rosnes; Ángela I. Barbero et al. (2012). On the power transfer of error-control codes for RFID communications. (ekstern lenke)
• David Hayes; David Ros; Øyvind Ytrehus (2023). Proxy Path Scheduling and Erasure Reconstruction for Low Delay mmWave Communication. (ekstern lenke)
• Irina E. Bocharova; Boris D. Kudryashev; Vitaly Skachek et al. (2018). LDPC Codes Over the BEC: Bounds and Decoding Algorithms. (ekstern lenke)
• Tor Helleseth; N. Hamada; Øyvind Ytrehus (1992). On the construction of @<q%4 + q%2 - q,5,q%4 - q%3 + q%2 - 2q;q@>codes meeting the Griesmer bound. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2007). Turbo decoding on the binary erasure channel: Finite-length analysis and turbo stopping sets. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2001). On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels. (ekstern lenke)
• Eirik Rosnes; Ángela I. Barbero; Øyvind Ytrehus (2012). Coding for inductively coupled channels. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2009). An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices. (ekstern lenke)
• Bjørn Møller Greve; Øyvind Ytrehus; Håvard Raddum et al. (2019). Solving non-linear Boolean equation systems by variable elimination. (ekstern lenke)
• Øyvind Ytrehus (1991). @<18.11@>2 codes do not exist. Nor do @<64,53@>2 codes. (ekstern lenke)
• Øyvind Ytrehus (1991). Upper bounds on error-correcting runlenght limited block codes. (ekstern lenke)
• N. Hamada; Tor Helleseth; Øyvind Ytrehus (1993). A new class of nonbinary codes meeting the Griesmer bound. (ekstern lenke)
• Tor Helleseth; Torleiv Kløve; Øyvind Ytrehus (1992). Generalized Hamming weights of linear codes. (ekstern lenke)
• Kjell Jørgen Hole; Øyvind Ytrehus (1998). Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths. (ekstern lenke)
• Ángela I. Barbero; Eirik Rosnes; Guang Yang et al. (2014). Near-field passive RFID communication: Channel model and code design. (ekstern lenke)
• Irina E. Bocharova; Boris D. Kudryashov; Eirik Rosnes et al. (2016). Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2009). An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices. (ekstern lenke)
• Bjørn Møller Greve; Øyvind Ytrehus; Håvard Raddum et al. (2019). Solving non-linear Boolean equation systems by variable elimination. (ekstern lenke)
• Øyvind Ytrehus (1991). @<18.11@>2 codes do not exist. Nor do @<64,53@>2 codes. (ekstern lenke)
• Øyvind Ytrehus (1991). Upper bounds on error-correcting runlenght limited block codes. (ekstern lenke)
• N. Hamada; Tor Helleseth; Øyvind Ytrehus (1993). A new class of nonbinary codes meeting the Griesmer bound. (ekstern lenke)
• Tor Helleseth; Torleiv Kløve; Øyvind Ytrehus (1992). Generalized Hamming weights of linear codes. (ekstern lenke)
• Kjell Jørgen Hole; Øyvind Ytrehus (1998). Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths. (ekstern lenke)
• Ángela I. Barbero; Eirik Rosnes; Guang Yang et al. (2014). Near-field passive RFID communication: Channel model and code design. (ekstern lenke)
• Irina E. Bocharova; Boris D. Kudryashov; Eirik Rosnes et al. (2016). Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC. (ekstern lenke)

Lederartikkel

• Cunsheng Ding; Tor Helleseth; Øyvind Ytrehus (2008). Special issue dedicated to Professor Torleiv Kløve for his 65th birthday - Preface. (ekstern lenke)
• Daniel Augot; Anne Canteaut; Gohar Kyureghyan et al. (2013). Special Issue on Coding and Cryptography. (ekstern lenke)
• Ángela I. Barbero; Vitaly Skachek; Øyvind Ytrehus (2017). Coding theory and applications: 5th international castle meeting, ICMCTA 2017 Vihula, Estonia, august 28-31, 2017 proceedings. (ekstern lenke)
• Ángela I. Barbero; Vitaly Skachek; Øyvind Ytrehus (2017). Coding theory and applications: 5th international castle meeting, ICMCTA 2017 Vihula, Estonia, august 28-31, 2017 proceedings. (ekstern lenke)

Konferanseforedrag

• Ángela I. Barbero; Øyvind Ytrehus (2015). Message merging for routing. (ekstern lenke)
• M. Fjelltveit; Øyvind Ytrehus (1994). On Viterbi decoding of high-rate convolutional codes. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2002). On algorithms for determination of turbo code weight distributions. (ekstern lenke)
• Tor Helleseth; Torleiv Kløve; Øyvind Ytrehus (1992). Codes, weight hierarchies and chains. (ekstern lenke)
• [Mangler fornavn] I. Boukliev; [Mangler fornavn] S. Dodunekov; [Mangler fornavn] T. Helleseth et al. (1996). Two New Binary Optimal 8-Dimensional Codes. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2004). On convolutional codes and sphere packing bounds. (ekstern lenke)
• Kjell Jørgen Hole; Øyvind Ytrehus (1994). Convolutional Codes for precoded partial-response channels: A Review. (ekstern lenke)
• Ángela I. Barbero; Gregory Horler; Oleksandr Kholosa et al. (2007). Secure and Reliable Communicationfor the Inductively Coupled Channel. (ekstern lenke)
• Øyvind Ytrehus (2007). Graphs applied to codes. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2003). High Rate Convolutional Codes with Optimal Cycle Weights. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2004). On bit-interleaved turbo-coded modulation with low error floors. (ekstern lenke)
• Øyvind Ytrehus (2006). Network coding for cyclic networks. (ekstern lenke)
• Kjell Jørgen Hole; Øyvind Ytrehus (1993). New zero-run lenght limited codes for partial response channels. (ekstern lenke)
• Øyvind Ytrehus (2006). Network coding. (ekstern lenke)
• Kjell Jørgen Hole; Øyvind Ytrehus (1995). Further results on cosets of convolutional codes with short maximum zero-run lengths. (ekstern lenke)
• M. Fjelltveit; Øyvind Ytrehus (1994). On Viterbi decoding of high-rate convolutional codes on partial-response channels. (ekstern lenke)
• Pål Ellingsen; Øyvind Ytrehus; Paul Siegel (2004). Enhanced decoding by error detection on a channel with correlated 2-dimensional errors. (ekstern lenke)
• Øyvind Ytrehus (1995). Ascetic Convolutional Codes. (ekstern lenke)
• Rolf Erstad; Øyvind Ytrehus (1998). Coding for Channels with Local Data Dependent Noise. (ekstern lenke)
• Tor Helleseth; N. Hamada; Øyvind Ytrehus (1991). A new class of nonbinary codes meeting the Griesmer bound. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2003). On Trellis Complexity Constrained Convolutional Codes of Maximum Length. (ekstern lenke)
• Øyvind Ytrehus (2009). Graphs applied to codes. (ekstern lenke)
• Øyvind Ytrehus; Kjell Jørgen Hole (1996). Self-Synchronizing Cosets of Convolutional Codes. (ekstern lenke)
• Øyvind Ytrehus (1993). Block code based analysis of convolutional codes. (ekstern lenke)
• Øyvind Ytrehus (1997). Trellis complexity and generalized Hamming weights. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2002). Reduced Trellis State Complexity Convolutional Code Constructions. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2003). Improved Algorithms for High Rate Turbo Code Weight Distribution Calculation. (ekstern lenke)
• I. Boukliev; S. Dodunekov; Tor Helleseth et al. (1996). Two New Binary Optimal 8-Dimensional Codes. (ekstern lenke)
• Øyvind Ytrehus (1993). Block code based analysis of convolutional codes. (ekstern lenke)
• Øyvind Ytrehus (1997). Trellis complexity and generalized Hamming weights. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2002). Reduced Trellis State Complexity Convolutional Code Constructions. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2003). Improved Algorithms for High Rate Turbo Code Weight Distribution Calculation. (ekstern lenke)
• I. Boukliev; S. Dodunekov; Tor Helleseth et al. (1996). Two New Binary Optimal 8-Dimensional Codes. (ekstern lenke)
• Khaled Abdel-Ghaffar; Øyvind Ytrehus (1997). Difference Set Codes For. (ekstern lenke)
• Øyvind Ytrehus (1997). On Codes for Error Correction and Block Synchronization. (ekstern lenke)
• Øyvind Ytrehus (2006). Innføring i nettverkskoding. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2004). On lowering the error floor of bit-interleaved turbo-coded modulation. (ekstern lenke)

Forskningsrapport

• Tor Helleseth; Torleiv Kløve; Øyvind Ytrehus (1993). On generalizations of the Grismer bound. (ekstern lenke)
• Øyvind Ytrehus (1992). A note on high rate binary convolutional codes. (ekstern lenke)
• Øyvind Ytrehus (1992). A note on high rate binary convolutional codes. (ekstern lenke)
• Øyvind Ytrehus (1992). Constructions and proofs of nonexistence of some convolutional codes. (ekstern lenke)
• Øyvind Ytrehus (1989). A rate 3/8 (1,3) constrained code with free hamming distance 3. (ekstern lenke)
• Tor Helleseth; Øyvind Ytrehus (1986). New bounds on the minimum lenght of binary block codes of dimension 8. (ekstern lenke)
• Tor Helleseth; Øyvind Ytrehus (1989). How to find a 33,8,14Å code. (ekstern lenke)
• Tor Helleseth; Øyvind Ytrehus (2003). Lecture Notes for the International Mini-workshop: Coding for Kløve. (ekstern lenke)
• Tor Helleseth; Torleiv Kløve; Øyvind Ytrehus (1992). Excess sequences of codes and the chain condition. (ekstern lenke)
• Øyvind Ytrehus (1992). Constructions and proofs of nonexistence of some convolutional codes. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2003). Avoiding Cycles in Combined Turbo Decoding and Channel Estimation for Correlated Fading Channels. (ekstern lenke)
• Tor Helleseth; Torleiv Kløve; Øyvind Ytrehus (1992). Excess sequences of codes and the chain condition. (ekstern lenke)
• Øyvind Ytrehus (1992). Constructions and proofs of nonexistence of some convolutional codes. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2003). Avoiding Cycles in Combined Turbo Decoding and Channel Estimation for Correlated Fading Channels. (ekstern lenke)

Vitenskapelig bokkapittel

• Eirik Rosnes; Ángela I. Barbero; Øyvind Ytrehus (2009). Coding for a Bit-Shift Channel With Applications to Inductively Coupled Channels. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2005). On the construction of good families of rate-compatible punctured turbo codes. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2005). Finite-length analysis of turbo decoding on the binary erasure channel. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2010). Queuing aspects of packet coding based bidirectional communication over satellite channels. (ekstern lenke)
• Øyvind Ytrehus (2006). Preface. (ekstern lenke)
• Mohammad Ravanbakhsh; Ángela I. Barbero; Øyvind Ytrehus et al. (2010). Power savings of cyclic network coding for multicast on wireless networks. (ekstern lenke)
• Eirik Rosnes; Ángela I. Barbero; Øyvind Ytrehus (2010). Coding Challenges for Inductively Coupled Channels. (ekstern lenke)
• Eirik Rosnes; Guang Yang; Øyvind Ytrehus (2010). Exploiting the CRC-CCITT Code on the Binary Erasure Channel. (ekstern lenke)
• Eirik Rosnes; Øyvind Ytrehus (2007). An algorithm to find all small-size stopping sets of low-density parity-check matrices. (ekstern lenke)
• Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (2022). On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2006). Heuristic algorithms for small field multicast encoding. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2010). Introduction to Network Coding for Acyclic and Cyclic Networks. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2014). Information exchange for routing protocols. (ekstern lenke)
• Joakim Algrøy; Ángela I. Barbero; Øyvind Ytrehus (2022). Determining the equivocation in coded transmission over a noisy channel. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2007). Facts of LIFE. (ekstern lenke)
• Ángela I. Barbero; Gregory Horler; Alexander Kholosha et al. (2008). Lighweight cryptography for RFID devices. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2010). Rate of convergence in cooperative games on COPE-encoded wireless networks. (ekstern lenke)
• Ángela I. Barbero; Gregory Horler; Eirik Rosnes et al. (2008). Modulation Codes for Reader-Tag Communication on Inductively Coupled Channels. (ekstern lenke)
• Guang Yang; Ángela I. Barbero; Eirik Rosnes et al. (2012). Error correction on an insertion/deletion channel applying codes from RFID standards. (ekstern lenke)
• Ángela I. Barbero; Pål Ellingsen; Susanna Spinsante et al. (2006). Maximum Likelihood Decoding of Codes on the Z-channel. (ekstern lenke)
• Joakim Algrøy; Ángela I. Barbero; Øyvind Ytrehus (2022). Determining the equivocation in coded transmission over a noisy channel. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2007). Facts of LIFE. (ekstern lenke)
• Ángela I. Barbero; Gregory Horler; Alexander Kholosha et al. (2008). Lighweight cryptography for RFID devices. (ekstern lenke)
• Ángela I. Barbero; Øyvind Ytrehus (2010). Rate of convergence in cooperative games on COPE-encoded wireless networks. (ekstern lenke)
• Ángela I. Barbero; Gregory Horler; Eirik Rosnes et al. (2008). Modulation Codes for Reader-Tag Communication on Inductively Coupled Channels. (ekstern lenke)
• Guang Yang; Ángela I. Barbero; Eirik Rosnes et al. (2012). Error correction on an insertion/deletion channel applying codes from RFID standards. (ekstern lenke)
• Ángela I. Barbero; Pål Ellingsen; Susanna Spinsante et al. (2006). Maximum Likelihood Decoding of Codes on the Z-channel. (ekstern lenke)
• Øyvind Ytrehus; Ángela I. Barbero; Garegin Markarian et al. (2008). Coding on networks. (ekstern lenke)
• Tor Helleseth; Øyvind Ytrehus (2013). Personnummerering i Norge: Litt anvendt kodeteori og økonomi. (ekstern lenke)
• Pål Ellingsen; Susanna Spinsante; Øyvind Ytrehus et al. (2006). Maximum likelihood decoding of codes on the Z-channel. (ekstern lenke)
• Mohammad Ravanbakhsh; Ángela I. Barbero; Øyvind Ytrehus (2009). Improved Delay Estimates for a Queueing Model for Random Linear Coding for Unicast. (ekstern lenke)

Doktorgradsavhandling

• Øyvind Ytrehus (1989). Codes for error control. (ekstern lenke)
• Bjørn Møller Greve; Øyvind Ytrehus; Håvard Raddum (2018). Systems of Boolean equations, elimination theory, and applications to cryptography. (ekstern lenke)
• Christian W. Otterstad; Øyvind Ytrehus; Kjell Jørgen Hole (2017). Selected x86 Low-level Attacks and Mitigations. (ekstern lenke)
• Christian W. Otterstad; Øyvind Ytrehus; Kjell Jørgen Hole (2017). Selected x86 Low-level Attacks and Mitigations. (ekstern lenke)
• Mohsen Toorani; Øyvind Ytrehus (2015). Security protocols and related topics. (ekstern lenke)

Antologi

• Øyvind Ytrehus (2006). Coding and Cryptography International Workshop, WCC 2005 Bergen, Norway, March 2005 Revised Selected Papers. (ekstern lenke)
• Øyvind Ytrehus (2006). Coding and Cryptography International Workshop, WCC 2005 Bergen, Norway, March 2005 Revised Selected Papers. (ekstern lenke)
• Tor Helleseth; P. Vijay Kumar; Øyvind Ytrehus (2007). 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks. (ekstern lenke)

Konferanseposter

• Eirik Rosnes; Øyvind Ytrehus (2003). An Efficient Algorithm for Tailbiting Turbo Code Weight Distribution Calculation. (ekstern lenke)

Se en fullstendig oversikt over publikasjoner i NVA.