Øyvind Ytrehus

90 papers B 17C 2Misc 4Journal 58Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
Attacking the Polynomials in the Maze of Finite Fields problem.
CoRR
Ángela I. Barbero, Ragnar Freij-Hollanti, Camilla Hollanti, Håvard Raddum, Øyvind Ytrehus, Morten Øygarden
2025 J jnl
Correction: Linearity of $\mathbb {Z}_{2^L}$-linear codes via Schur product.
Des. Codes Cryptogr.
Gustavo Terra Bastos, Maiara F. Bollauf, Agnaldo José Ferrari, Øyvind Ytrehus
2025 J jnl
Linearity of $\mathbb {Z}_{2^L}$-linear codes via Schur product.
Des. Codes Cryptogr.
Gustavo Terra Bastos, Maiara F. Bollauf, Agnaldo J. Ferreira, Øyvind Ytrehus
2025 J jnl
On Evaluating Anonymity of Onion Routing.
IACR Cryptol. ePrint Arch.
Alessandro Melloni, Martijn Stam, Øyvind Ytrehus
2024 B conf
Nested Construction of $\mathbb{Z}_{2^{L}} \text{-Linear}$ Codes.
ISIT
Gustavo Terra Bastos, Maiara F. Bollauf, Agnaldo José Ferrari, Øyvind Ytrehus
2024 J jnl
Secrecy Gain of Formally Unimodular Lattices From Codes Over the Integers Modulo 4.
IEEE Trans. Inf. Theory
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
2023 B conf
Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions.
ITW
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
2023 C conf
Dynamic Security Aspects of Onion Routing.
IMACC
Alessandro Melloni, Martijn Stam, Øyvind Ytrehus
2023 J jnl
Dynamic Security Aspects of Onion Routing.
IACR Cryptol. ePrint Arch.
Alessandro Melloni, Martijn Stam, Øyvind Ytrehus
2023 J jnl
Formally Unimodular Packings for the Gaussian Wiretap Channel.
IEEE Trans. Inf. Theory
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
2023 — conf
On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes.
ISTC
Palma Persson, Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
2023 J jnl
Proxy Path Scheduling and Erasure Reconstruction for Low Delay mmWave Communication.
IEEE Commun. Lett.
David A. Hayes, David Ros, Øyvind Ytrehus
2023 J jnl
Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4.
CoRR
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
2022 B conf
Determining the equivocation in coded transmission over a noisy channel.
ISIT
Joakim Algrøy, Angela I. Barbero, Øyvind Ytrehus
2022 J jnl
Formally Unimodular Packings for the Gaussian Wiretap Channel.
CoRR
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
2022 J jnl
On the Secrecy Gain of Formally Unimodular Construction A
CoRR
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
2022 B conf
On the Secrecy Gain of Formally Unimodular Construction A4 Lattices.
ISIT
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
2022 J jnl
Preface of special issue on coding theory and applications.
Cryptogr. Commun.
Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus
2021 Misc conf
On Evaluating Anonymity of Onion Routing.
SAC
Alessandro Melloni, Martijn Stam, Øyvind Ytrehus
2021 J jnl
Solving non-linear Boolean equation systems by variable elimination.
Appl. Algebra Eng. Commun. Comput.
Bjørn Møller Greve, Øyvind Ytrehus, Håvard Raddum, Gunnar Fløystad
2021 J jnl
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel.
CoRR
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
2021 B conf
Tiling of Constellations.
ISIT
Maiara F. Bollauf, Øyvind Ytrehus
2021 J jnl
Tiling of Constellations.
CoRR
Maiara F. Bollauf, Øyvind Ytrehus
2019 J jnl
LDPC Codes Over the BEC: Bounds and Decoding Algorithms.
IEEE Trans. Commun.
Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Eirik Rosnes, Øyvind Ytrehus
2019 J jnl
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory.
CoRR
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
2019 J jnl
Variable Elimination - a Tool for Algebraic Cryptanalysis.
IACR Cryptol. ePrint Arch.
Bjørn Møller Greve, Øyvind Ytrehus, Håvard Raddum
2018 J jnl
Rate (n-1)/n Systematic Memory Maximum Distance Separable Convolutional Codes.
IEEE Trans. Inf. Theory
Angela I. Barbero, Øyvind Ytrehus
2017 — ed.
Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings
ICMCTA
Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus
2017 J jnl
Eliminating Variables in Boolean Equation Systems.
CoRR
Bjørn Møller Greve, Håvard Raddum, Gunnar Fløystad, Øyvind Ytrehus
2017 J jnl
Eliminating Variables in Boolean Equation Systems.
IACR Cryptol. ePrint Arch.
Bjørn Møller Greve, Håvard Raddum, Gunnar Fløystad, Øyvind Ytrehus
2017 J jnl
ML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms.
CoRR
Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Eirik Rosnes, Øyvind Ytrehus
2017 J jnl
Rate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$.
CoRR
Angela I. Barbero, Øyvind Ytrehus
2016 J jnl
Vendor Malware: Detection Limits and Mitigation.
Computer
Olav Lysne, Kjell Jørgen Hole, Christian Otterstad, Øyvind Ytrehus, Raymond Aarseth, Jorgen Tellnes
2016 — conf
Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC.
ISTC
Irina E. Bocharova, Boris D. Kudryashov, Eirik Rosnes, Vitaly Skachek, Øyvind Ytrehus
2014 — conf
A Coding-Based Approach to Robust Shortest-Path Routing.
ICMCTA
Angela I. Barbero, Øyvind Ytrehus
2014 Misc conf
Information exchange for routing protocols.
ITA
Angela I. Barbero, Øyvind Ytrehus
2014 J jnl
Near-Field Passive RFID Communication: Channel Model and Code Design.
IEEE Trans. Commun.
Angela I. Barbero, Eirik Rosnes, Guang Yang, Øyvind Ytrehus
2013 J jnl
Editorial.
Des. Codes Cryptogr.
Daniel Augot, Anne Canteaut, Gohar M. Kyureghyan, Faina I. Solov'eva, Øyvind Ytrehus
2013 J jnl
Near-Field Passive RFID Communication: Channel Model and Code Design.
CoRR
Angela I. Barbero, Eirik Rosnes, Guang Yang, Øyvind Ytrehus
2012 J jnl
Addendum to "An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices".
IEEE Trans. Inf. Theory
Eirik Rosnes, Øyvind Ytrehus, Marcel Ambroze, Martin Tomlinson
2012 J jnl
Coding for Inductively Coupled Channels.
IEEE Trans. Inf. Theory
Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus
2012 Misc conf
Error correction on an insertion/deletion channel applying codes from RFID standards.
ITA
Guang Yang, Angela I. Barbero, Eirik Rosnes, Øyvind Ytrehus
2012 B conf
On the power transfer of error-control codes for RFID communications.
ISIT
Guang Yang, Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus
2011 Misc conf
Constrained codes for passive RFID communication.
ITA
Angela I. Barbero, Eirik Rosnes, Guang Yang, Øyvind Ytrehus
2009 J jnl
An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices.
IEEE Trans. Inf. Theory
Eirik Rosnes, Øyvind Ytrehus
2009 B conf
Coding for a Bit-Shift Channel with Applications to Inductively Coupled Channels.
GLOBECOM
Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus
2009 J jnl
Improved Delay Estimates for a Queueing Model for Random Linear Coding for Unicast
CoRR
Mohammad Ravanbakhsh, Angela I. Barbero, Øyvind Ytrehus
2009 B conf
Improved delay estimates for a queueing model for random linear coding for unicast.
ISIT
Mohammad Ravanbakhsh, Angela I. Barbero, Øyvind Ytrehus
2008 — conf
Communication on Inductively Coupled Channels: Overview and Challenges.
ICMCTA
Øyvind Ytrehus
2008 J jnl
Preface.
Des. Codes Cryptogr.
Cunsheng Ding, Tor Helleseth, Øyvind Ytrehus
2007 B conf
An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices.
ISIT
Eirik Rosnes, Øyvind Ytrehus
2007 J jnl
An efficient centralized binary multicast network coding algorithm for any cyclic network
CoRR
Angela I. Barbero, Øyvind Ytrehus
2007 B conf
Facts of LIFE.
ICCCN
Angela I. Barbero, Øyvind Ytrehus
2007 B ed.
Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, July 1-6, 2007, Solstrand, Norway
ITW
Tor Helleseth, P. Vijay Kumar, Øyvind Ytrehus
2007 J jnl
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets.
IEEE Trans. Inf. Theory
Eirik Rosnes, Øyvind Ytrehus
2006 — ed.
Coding and Cryptography, International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005. Revised Selected Papers
WCC
Øyvind Ytrehus
2006 J jnl
Cycle-logical treatment for "Cyclopathic" networks.
IEEE Trans. Inf. Theory
Angela I. Barbero, Øyvind Ytrehus
2006 — conf
Maximum Likelihood Decoding of Codes on the Z-channel.
ICC
Angela I. Barbero, Pål Ellingsen, Susanna Spinsante, Øyvind Ytrehus
2006 J jnl
On the Design of Bit-Interleaved Turbo-Coded Modulation With Low Error Floors.
IEEE Trans. Commun.
Eirik Rosnes, Øyvind Ytrehus
2006 J jnl
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets
CoRR
Eirik Rosnes, Øyvind Ytrehus
2005 B conf
Finite-length analysis of turbo decoding on the binary erasure channel.
ISIT
Eirik Rosnes, Øyvind Ytrehus
2005 J jnl
Improved algorithms for the determination of turbo-code weight distributions.
IEEE Trans. Commun.
Eirik Rosnes, Øyvind Ytrehus
2005 B conf
On the construction of good families of rate-compatible punctured turbo codes.
ISIT
Eirik Rosnes, Øyvind Ytrehus
2005 B conf
Turbo stopping sets: the uniform interleaver and efficient enumeration.
ISIT
Eirik Rosnes, Øyvind Ytrehus
2004 B conf
Enhanced decoding by error detection on a channel with correlated 2-dimensional errors.
ITW
Pål Ellingsen, Øyvind Ytrehus, Paul H. Siegel
2004 B conf
On bit-interleaved turbo-coded modulation with low error floors.
ISIT
Eirik Rosnes, Øyvind Ytrehus
2004 B conf
On convolutional codes and sphere packing bounds.
ISIT
Eirik Rosnes, Øyvind Ytrehus
2004 — conf
On lowering the error floor of bit-interleaved turbo-coded modulation.
ICC
Eirik Rosnes, Øyvind Ytrehus
2004 J jnl
On maximum length convolutional codes under a trellis complexity constraint.
J. Complex.
Eirik Rosnes, Øyvind Ytrehus
2004 J jnl
Sphere-Packing Bounds for Convolutional Codes.
IEEE Trans. Inf. Theory
Eirik Rosnes, Øyvind Ytrehus
2003 C conf
High Rate Convolutional Codes with Optimal Cycle Weights.
IMACC
Eirik Rosnes, Øyvind Ytrehus
2001 J jnl
On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels.
Discret. Math.
Angela I. Barbero, Øyvind Ytrehus
2000 J jnl
There is no ternary [28, 6, 16] code.
IEEE Trans. Inf. Theory
Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus
1998 J jnl
Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths.
IEEE Trans. Inf. Theory
Kjell Jørgen Hole, Øyvind Ytrehus
1998 J jnl
Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels.
IEEE Trans. Inf. Theory
Khaled A. S. Abdel-Ghaffar, Øyvind Ytrehus
1997 J jnl
On the [162, 8, 80] codes.
IEEE Trans. Inf. Theory
Iliya G. Bouyukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus
1997 J jnl
Two-step trellis decoding of partial unit memory convolutional codes.
IEEE Trans. Inf. Theory
M. F. Hole, Øyvind Ytrehus
1995 J jnl
Bounds on the minimum support weights.
IEEE Trans. Inf. Theory
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus
1995 J jnl
On the trellis complexity of certain binary linear block codes.
IEEE Trans. Inf. Theory
Øyvind Ytrehus
1994 J jnl
Improved coding techniques for preceded partial-response channels.
IEEE Trans. Inf. Theory
Kjell Jørgen Hole, Øyvind Ytrehus
1993 J jnl
A New Class of Nonbinary Codes Meeting the Griesmer Bound.
Discret. Appl. Math.
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
1993 J jnl
Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4}).
Discret. Math.
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
1993 — conf
Generalizations of the Griesmer Bound.
Error Control, Cryptology, and Speech Compression
Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus
1992 J jnl
Generalized Hamming weights of linear codes.
IEEE Trans. Inf. Theory
Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus
1992 J jnl
On the Construction of [q
Des. Codes Cryptogr.
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
1991 J jnl
Binary [18, 11]2 codes do not exist - Nor do [64, 53]2 codes.
IEEE Trans. Inf. Theory
Øyvind Ytrehus
1991 J jnl
Runlength-limited codes for mixed-error channels.
IEEE Trans. Inf. Theory
Øyvind Ytrehus
1991 J jnl
Upper bounds on error-correcting runlength-limited block codes.
IEEE Trans. Inf. Theory
Øyvind Ytrehus
1990 J jnl
There is no binary [25, 8, 10] code (corresp.).
IEEE Trans. Inf. Theory
Øyvind Ytrehus, Tor Helleseth
1987 J jnl
New bounds on binary linear codes of dimension eight.
IEEE Trans. Inf. Theory
Stefan M. Dodunekov, Tor Helleseth, Nikolai L. Manev, Øyvind Ytrehus