Øyvind Ytrehus

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 28

Top Topics

Information Exchange

Top Venues

IEEE Trans. Inf. Theory

IACR Cryptol. ePrint Arch.

Publications

Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
Secrecy Gain of Formally Unimodular Lattices From Codes Over the Integers Modulo 4. IEEE Trans. Inf. Theory 70 (5) (2024)
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4. CoRR (2023)
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
Formally Unimodular Packings for the Gaussian Wiretap Channel. IEEE Trans. Inf. Theory 69 (12) (2023)
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions. ITW (2023)
Alessandro Melloni, Martijn Stam, Øyvind Ytrehus
Dynamic Security Aspects of Onion Routing. IMACC (2023)
Alessandro Melloni, Martijn Stam, Øyvind Ytrehus
Dynamic Security Aspects of Onion Routing. IACR Cryptol. ePrint Arch. 2023 (2023)
David A. Hayes, David Ros, Øyvind Ytrehus
Proxy Path Scheduling and Erasure Reconstruction for Low Delay mmWave Communication. IEEE Commun. Lett. 27 (6) (2023)
Palma Persson, Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes. ISTC (2023)
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. ISIT (2022)
Joakim Algrøy, Angela I. Barbero, Øyvind Ytrehus
Determining the equivocation in coded transmission over a noisy channel. ISIT (2022)
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
Formally Unimodular Packings for the Gaussian Wiretap Channel. CoRR (2022)
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
Lattices. CoRR (2022)
Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus
Preface of special issue on coding theory and applications. Cryptogr. Commun. 14 (3) (2022)
Maiara F. Bollauf, Øyvind Ytrehus
Tiling of Constellations. ISIT (2021)
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel. CoRR (2021)
Maiara F. Bollauf, Øyvind Ytrehus
Tiling of Constellations. CoRR (2021)
Bjørn Møller Greve, Øyvind Ytrehus, Håvard Raddum, Gunnar Fløystad
Solving non-linear Boolean equation systems by variable elimination. Appl. Algebra Eng. Commun. Comput. 32 (1) (2021)
Alessandro Melloni, Martijn Stam, Øyvind Ytrehus
On Evaluating Anonymity of Onion Routing. SAC (2021)
A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama, Van Khu Vu, Akiko Manada, Kui Cai, Shunsuke Horii, Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta, Xingwei Zhong, Zhen Mei, Renfei Bu, Jos H. Weber, Vitaly Skachek, Hiroyoshi Morita, N. Hovhannisyan, Hiroshi Kamabe, Shan Lu, Hirosuke Yamamoto, Kengo Hashimoto, Øyvind Ytrehus, Shigeaki Kuzuoka, Mikihiko Nishiara, Han Mao Kiah, Jun Muramatsu, Shigeki Miyake
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory. CoRR (2019)
Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Eirik Rosnes, Øyvind Ytrehus
LDPC Codes Over the BEC: Bounds and Decoding Algorithms. IEEE Trans. Commun. 67 (3) (2019)
Bjørn Møller Greve, Øyvind Ytrehus, Håvard Raddum
Variable Elimination - a Tool for Algebraic Cryptanalysis. IACR Cryptol. ePrint Arch. 2019 (2019)
Angela I. Barbero, Øyvind Ytrehus
Rate (n-1)/n Systematic Memory Maximum Distance Separable Convolutional Codes. IEEE Trans. Inf. Theory 64 (4) (2018)
Bjørn Møller Greve, Håvard Raddum, Gunnar Fløystad, Øyvind Ytrehus
Eliminating Variables in Boolean Equation Systems. CoRR (2017)
Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Eirik Rosnes, Øyvind Ytrehus
ML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms. CoRR (2017)
Angela I. Barbero, Øyvind Ytrehus
Rate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$. CoRR (2017)
Bjørn Møller Greve, Håvard Raddum, Gunnar Fløystad, Øyvind Ytrehus
Eliminating Variables in Boolean Equation Systems. IACR Cryptol. ePrint Arch. 2017 (2017)
Olav Lysne, Kjell Jørgen Hole, Christian Otterstad, Øyvind Ytrehus, Raymond Aarseth, Jorgen Tellnes
Vendor Malware: Detection Limits and Mitigation. Computer 49 (8) (2016)
Irina E. Bocharova, Boris D. Kudryashov, Eirik Rosnes, Vitaly Skachek, Øyvind Ytrehus
Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC. ISTC (2016)
Angela I. Barbero, Eirik Rosnes, Guang Yang, Øyvind Ytrehus
Near-Field Passive RFID Communication: Channel Model and Code Design. IEEE Trans. Commun. 62 (5) (2014)
Angela I. Barbero, Øyvind Ytrehus
A Coding-Based Approach to Robust Shortest-Path Routing. ICMCTA (2014)
Angela I. Barbero, Øyvind Ytrehus
Information exchange for routing protocols. ITA (2014)
Daniel Augot, Anne Canteaut, Gohar M. M. Kyureghyan, Faina I. Solov'eva, Øyvind Ytrehus
Editorial. Des. Codes Cryptogr. 66 (1-3) (2013)
Angela I. Barbero, Eirik Rosnes, Guang Yang, Øyvind Ytrehus
Near-Field Passive RFID Communication: Channel Model and Code Design. CoRR (2013)
Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus
Coding for Inductively Coupled Channels. IEEE Trans. Inf. Theory 58 (8) (2012)
Guang Yang, Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus
On the power transfer of error-control codes for RFID communications. ISIT (2012)
Eirik Rosnes, Øyvind Ytrehus, Marcel Ambroze, Martin Tomlinson
Addendum to "An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices". IEEE Trans. Inf. Theory 58 (1) (2012)
Guang Yang, Angela I. Barbero, Eirik Rosnes, Øyvind Ytrehus
Error correction on an insertion/deletion channel applying codes from RFID standards. ITA (2012)
Angela I. Barbero, Eirik Rosnes, Guang Yang, Øyvind Ytrehus
Constrained codes for passive RFID communication. ITA (2011)
Mohammad Ravanbakhsh, Angela I. Barbero, Øyvind Ytrehus
Improved delay estimates for a queueing model for random linear coding for unicast. ISIT (2009)
Mohammad Ravanbakhsh, Angela I. Barbero, Øyvind Ytrehus
Improved Delay Estimates for a Queueing Model for Random Linear Coding for Unicast CoRR (2009)
Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus
Coding for a Bit-Shift Channel with Applications to Inductively Coupled Channels. GLOBECOM (2009)
Eirik Rosnes, Øyvind Ytrehus
An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices. IEEE Trans. Inf. Theory 55 (9) (2009)
Cunsheng Ding, Tor Helleseth, Øyvind Ytrehus
Preface. Des. Codes Cryptogr. 48 (2) (2008)
Øyvind Ytrehus
Communication on Inductively Coupled Channels: Overview and Challenges. ICMCTA (2008)
Angela I. Barbero, Øyvind Ytrehus
An efficient centralized binary multicast network coding algorithm for any cyclic network CoRR (2007)
Eirik Rosnes, Øyvind Ytrehus
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets. IEEE Trans. Inf. Theory 53 (11) (2007)
Eirik Rosnes, Øyvind Ytrehus
An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices. ISIT (2007)
Angela I. Barbero, Øyvind Ytrehus
Facts of LIFE. ICCCN (2007)
Eirik Rosnes, Øyvind Ytrehus
On the Design of Bit-Interleaved Turbo-Coded Modulation With Low Error Floors. IEEE Trans. Commun. 54 (9) (2006)
Angela I. Barbero, Øyvind Ytrehus
Cycle-logical treatment for "Cyclopathic" networks. IEEE Trans. Inf. Theory 52 (6) (2006)
Angela I. Barbero, Pål Ellingsen, Susanna Spinsante, Øyvind Ytrehus
Maximum Likelihood Decoding of Codes on the Z-channel. ICC (2006)
Eirik Rosnes, Øyvind Ytrehus
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets CoRR (2006)
Eirik Rosnes, Øyvind Ytrehus
On the construction of good families of rate-compatible punctured turbo codes. ISIT (2005)
Eirik Rosnes, Øyvind Ytrehus
Improved algorithms for the determination of turbo-code weight distributions. IEEE Trans. Commun. 53 (1) (2005)
Eirik Rosnes, Øyvind Ytrehus
Finite-length analysis of turbo decoding on the binary erasure channel. ISIT (2005)
Eirik Rosnes, Øyvind Ytrehus
Turbo stopping sets: the uniform interleaver and efficient enumeration. ISIT (2005)
Eirik Rosnes, Øyvind Ytrehus
On bit-interleaved turbo-coded modulation with low error floors. ISIT (2004)
Eirik Rosnes, Øyvind Ytrehus
On lowering the error floor of bit-interleaved turbo-coded modulation. ICC (2004)
Pål Ellingsen, Øyvind Ytrehus, Paul H. Siegel
Enhanced decoding by error detection on a channel with correlated 2-dimensional errors. ITW (2004)
Eirik Rosnes, Øyvind Ytrehus
On maximum length convolutional codes under a trellis complexity constraint. J. Complex. 20 (2-3) (2004)
Eirik Rosnes, Øyvind Ytrehus
On convolutional codes and sphere packing bounds. ISIT (2004)
Eirik Rosnes, Øyvind Ytrehus
Sphere-Packing Bounds for Convolutional Codes. IEEE Trans. Inf. Theory 50 (11) (2004)
Eirik Rosnes, Øyvind Ytrehus
High Rate Convolutional Codes with Optimal Cycle Weights. IMACC (2003)
Angela I. Barbero, Øyvind Ytrehus
On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels. Discret. Math. 241 (1-3) (2001)
Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus
There is no ternary [28, 6, 16] code. IEEE Trans. Inf. Theory 46 (4) (2000)
Kjell Jørgen Hole, Øyvind Ytrehus
Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths. IEEE Trans. Inf. Theory 44 (1) (1998)
Khaled A. S. Abdel-Ghaffar, Øyvind Ytrehus
Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels. IEEE Trans. Inf. Theory 44 (4) (1998)
M. F. Hole, Øyvind Ytrehus
Two-step trellis decoding of partial unit memory convolutional codes. IEEE Trans. Inf. Theory 43 (1) (1997)
Iliya G. Bouyukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus
On the [162, 8, 80] codes. IEEE Trans. Inf. Theory 43 (6) (1997)
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus
Bounds on the minimum support weights. IEEE Trans. Inf. Theory 41 (2) (1995)
Øyvind Ytrehus
On the trellis complexity of certain binary linear block codes. IEEE Trans. Inf. Theory 41 (2) (1995)
Kjell Jørgen Hole, Øyvind Ytrehus
Improved coding techniques for preceded partial-response channels. IEEE Trans. Inf. Theory 40 (2) (1994)
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
A New Class of Nonbinary Codes Meeting the Griesmer Bound. Discret. Appl. Math. 47 (3) (1993)
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4}). Discret. Math. 115 (1-3) (1993)
Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus
Generalizations of the Griesmer Bound. Error Control, Cryptology, and Speech Compression (1993)
Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus
Generalized Hamming weights of linear codes. IEEE Trans. Inf. Theory 38 (3) (1992)
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
- 2q; q]-Codes Meeting the Griesmer Bound. Des. Codes Cryptogr. 2 (3) (1992)
Øyvind Ytrehus
Upper bounds on error-correcting runlength-limited block codes. IEEE Trans. Inf. Theory 37 (3) (1991)
Øyvind Ytrehus
Runlength-limited codes for mixed-error channels. IEEE Trans. Inf. Theory 37 (6) (1991)
Øyvind Ytrehus
Binary [18, 11]2 codes do not exist - Nor do [64, 53]2 codes. IEEE Trans. Inf. Theory 37 (2) (1991)
Øyvind Ytrehus, Tor Helleseth
There is no binary [25, 8, 10] code (corresp.). IEEE Trans. Inf. Theory 36 (3) (1990)
Stefan M. Dodunekov, Tor Helleseth, Nikolai L. Manev, Øyvind Ytrehus
New bounds on binary linear codes of dimension eight. IEEE Trans. Inf. Theory 33 (6) (1987)