New bounds on binary linear codes of dimension eight. - Stefan M. Dodunekov; Tor Helleseth; Nikolai L. Manev; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1987)

There is no binary [25, 8, 10] code (corresp.). - Øyvind Ytrehus; Tor Helleseth (IEEE Trans. Inf. Theory, 1990)

Binary [18, 11]2 codes do not exist - Nor do [64, 53]2 codes. - Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1991)

Upper bounds on error-correcting runlength-limited block codes. - Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1991)

Runlength-limited codes for mixed-error channels. - Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1991)

On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound. - Noboru Hamada; Tor Helleseth; Øyvind Ytrehus (Des. Codes Cryptogr., 1992)

Generalized Hamming weights of linear codes. - Tor Helleseth; Torleiv Kløve; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1992)

Generalizations of the Griesmer Bound. - Tor Helleseth; Torleiv Kløve; Øyvind Ytrehus (Error Control, Cryptology, and Speech Compression, 1993)

A New Class of Nonbinary Codes Meeting the Griesmer Bound. - Noboru Hamada; Tor Helleseth; Øyvind Ytrehus (Discret. Appl. Math., 1993)

Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4}). - Noboru Hamada; Tor Helleseth; Øyvind Ytrehus (Discret. Math., 1993)

Improved coding techniques for preceded partial-response channels. - Kjell Jørgen Hole; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1994)

Bounds on the minimum support weights. - Tor Helleseth; Torleiv Kløve; Vladimir I. Levenshtein; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1995)

On the trellis complexity of certain binary linear block codes. - Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1995)

On the [162, 8, 80] codes. - Iliya G. Bouyukliev; Stefan M. Dodunekov; Tor Helleseth; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1997)

Two-step trellis decoding of partial unit memory convolutional codes. - M. F. Hole; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1997)

Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels. - Khaled A. S. Abdel-Ghaffar; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1998)

Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths. - Kjell Jørgen Hole; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 1998)

There is no ternary [28, 6, 16] code. - Noboru Hamada; Tor Helleseth; Halvard Martinsen; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 2000)

On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels. - Angela I. Barbero; Øyvind Ytrehus (Discret. Math., 2001)

High Rate Convolutional Codes with Optimal Cycle Weights. - Eirik Rosnes; Øyvind Ytrehus (IMACC, 2003)

On lowering the error floor of bit-interleaved turbo-coded modulation. - Eirik Rosnes; Øyvind Ytrehus (ICC, 2004)

On bit-interleaved turbo-coded modulation with low error floors. - Eirik Rosnes; Øyvind Ytrehus (ISIT, 2004)

On convolutional codes and sphere packing bounds. - Eirik Rosnes; Øyvind Ytrehus (ISIT, 2004)

Enhanced decoding by error detection on a channel with correlated 2-dimensional errors. - Pål Ellingsen; Øyvind Ytrehus; Paul H. Siegel (ITW, 2004)

On maximum length convolutional codes under a trellis complexity constraint. - Eirik Rosnes; Øyvind Ytrehus (J. Complex., 2004)

Sphere-Packing Bounds for Convolutional Codes. - Eirik Rosnes; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 2004)

On the construction of good families of rate-compatible punctured turbo codes. - Eirik Rosnes; Øyvind Ytrehus (ISIT, 2005)

Finite-length analysis of turbo decoding on the binary erasure channel. - Eirik Rosnes; Øyvind Ytrehus (ISIT, 2005)

Turbo stopping sets: the uniform interleaver and efficient enumeration. - Eirik Rosnes; Øyvind Ytrehus (ISIT, 2005)

Improved algorithms for the determination of turbo-code weight distributions. - Eirik Rosnes; Øyvind Ytrehus (IEEE Trans. Commun., 2005)

Maximum Likelihood Decoding of Codes on the Z-channel. - Angela I. Barbero; Pål Ellingsen; Susanna Spinsante; Øyvind Ytrehus (ICC, 2006)

On the Design of Bit-Interleaved Turbo-Coded Modulation With Low Error Floors. - Eirik Rosnes; Øyvind Ytrehus (IEEE Trans. Commun., 2006)

Cycle-logical treatment for "Cyclopathic" networks. - Angela I. Barbero; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 2006)

Facts of LIFE. - Angela I. Barbero; Øyvind Ytrehus (ICCCN, 2007)

An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices. - Eirik Rosnes; Øyvind Ytrehus (ISIT, 2007)

An efficient centralized binary multicast network coding algorithm for any cyclic network - Angela I. Barbero; Øyvind Ytrehus (CoRR, 2007)

Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets. - Eirik Rosnes; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 2007)

Communication on Inductively Coupled Channels: Overview and Challenges. - Øyvind Ytrehus (ICMCTA, 2008)

Preface. - Cunsheng Ding; Tor Helleseth; Øyvind Ytrehus (Des. Codes Cryptogr., 2008)

Coding for a Bit-Shift Channel with Applications to Inductively Coupled Channels. - Eirik Rosnes; Angela I. Barbero; Øyvind Ytrehus (GLOBECOM, 2009)

Improved delay estimates for a queueing model for random linear coding for unicast. - Mohammad Ravanbakhsh; Angela I. Barbero; Øyvind Ytrehus (ISIT, 2009)

An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices. - Eirik Rosnes; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 2009)

Constrained codes for passive RFID communication. - Angela I. Barbero; Eirik Rosnes; Guang Yang 016; Øyvind Ytrehus (ITA, 2011)

On the power transfer of error-control codes for RFID communications. - Guang Yang 016; Eirik Rosnes; Angela I. Barbero; Øyvind Ytrehus (ISIT, 2012)

Error correction on an insertion/deletion channel applying codes from RFID standards. - Guang Yang 016; Angela I. Barbero; Eirik Rosnes; Øyvind Ytrehus (ITA, 2012)

Coding for Inductively Coupled Channels. - Eirik Rosnes; Angela I. Barbero; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 2012)

Addendum to "An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices". - Eirik Rosnes; Øyvind Ytrehus; Marcel Ambroze; Martin Tomlinson (IEEE Trans. Inf. Theory, 2012)

Editorial. - Daniel Augot; Anne Canteaut; Gohar M. Kyureghyan; Faina I. Solov'eva; Øyvind Ytrehus (Des. Codes Cryptogr., 2013)

A Coding-Based Approach to Robust Shortest-Path Routing. - Angela I. Barbero; Øyvind Ytrehus (ICMCTA, 2014)

Information exchange for routing protocols. - Angela I. Barbero; Øyvind Ytrehus (ITA, 2014)

Near-Field Passive RFID Communication: Channel Model and Code Design. - Angela I. Barbero; Eirik Rosnes; Guang Yang 016; Øyvind Ytrehus (IEEE Trans. Commun., 2014)

Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC. - Irina E. Bocharova; Boris D. Kudryashov; Eirik Rosnes; Vitaly Skachek; Øyvind Ytrehus (ISTC, 2016)

Vendor Malware: Detection Limits and Mitigation. - Olav Lysne; Kjell Jørgen Hole; Christian Otterstad; Øyvind Ytrehus; Raymond Aarseth; Jorgen Tellnes (Computer, 2016)

Rate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$. - Angela I. Barbero; Øyvind Ytrehus (CoRR, 2017)

ML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms. - Irina E. Bocharova; Boris D. Kudryashov; Vitaly Skachek; Eirik Rosnes; Øyvind Ytrehus (CoRR, 2017)

Eliminating Variables in Boolean Equation Systems. - Bjørn Møller Greve; Håvard Raddum; Gunnar Fløystad; Øyvind Ytrehus (IACR Cryptol. ePrint Arch., 2017)

Rate (n-1)/n Systematic Memory Maximum Distance Separable Convolutional Codes. - Angela I. Barbero; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 2018)

Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory. - A. J. Han Vinck; Kees A. Schouhamer Immink; Tadashi Wadayama; Van Khu Vu; Akiko Manada; Kui Cai 001; Shunsuke Horii; Yoshiki Abe; Mitsugu Iwamoto; Kazuo Ohta; Xingwei Zhong; Zhen Mei; et al. (CoRR, 2019)

Variable Elimination - a Tool for Algebraic Cryptanalysis. - Bjørn Møller Greve; Øyvind Ytrehus; Håvard Raddum (IACR Cryptol. ePrint Arch., 2019)

LDPC Codes Over the BEC: Bounds and Decoding Algorithms. - Irina E. Bocharova; Boris D. Kudryashov; Vitaly Skachek; Eirik Rosnes; Øyvind Ytrehus (IEEE Trans. Commun., 2019)

Tiling of Constellations. - Maiara F. Bollauf; Øyvind Ytrehus (ISIT, 2021)

On Evaluating Anonymity of Onion Routing. - Alessandro Melloni; Martijn Stam; Øyvind Ytrehus (SAC, 2021)

Solving non-linear Boolean equation systems by variable elimination. - Bjørn Møller Greve; Øyvind Ytrehus; Håvard Raddum; Gunnar Fløystad (Appl. Algebra Eng. Commun. Comput., 2021)

The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel. - Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (CoRR, 2021)

Determining the equivocation in coded transmission over a noisy channel. - Joakim Algrøy; Angela I. Barbero; Øyvind Ytrehus (ISIT, 2022)

On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. - Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (ISIT, 2022)

Preface of special issue on coding theory and applications. - Ángela I. Barbero; Vitaly Skachek; Øyvind Ytrehus (Cryptogr. Commun., 2022)

On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. - Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (CoRR, 2022)

On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes. - Palma Persson; Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (ISTC, 2023)

Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions. - Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (ITW, 2023)

Dynamic Security Aspects of Onion Routing. - Alessandro Melloni; Martijn Stam; Øyvind Ytrehus (IACR Cryptol. ePrint Arch., 2023)

Proxy Path Scheduling and Erasure Reconstruction for Low Delay mmWave Communication. - David A. Hayes; David Ros; Øyvind Ytrehus (IEEE Commun. Lett., 2023)

Formally Unimodular Packings for the Gaussian Wiretap Channel. - Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 2023)

Nested Construction of $ mathbb{Z}_{2^{L}} text{-Linear}$ Codes. - Gustavo Terra Bastos; Maiara F. Bollauf; Agnaldo José Ferrari; Øyvind Ytrehus (ISIT, 2024)

Secrecy Gain of Formally Unimodular Lattices From Codes Over the Integers Modulo 4. - Maiara F. Bollauf; Hsuan-Yin Lin; Øyvind Ytrehus (IEEE Trans. Inf. Theory, 2024)