default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDØyvind Ytrehus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j38]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): 3309-3329 (2024)- [c29]Gustavo Terra Bastos, Maiara F. Bollauf, Agnaldo José Ferrari, Øyvind Ytrehus:
Nested Construction of $\mathbb{Z}_{2^{L}} \text{-Linear}$ Codes. ISIT 2024: 2598-2603 - 2023
- [j37]David A. Hayes, David Ros, Øyvind Ytrehus:
Proxy Path Scheduling and Erasure Reconstruction for Low Delay mmWave Communication. IEEE Commun. Lett. 27(6): 1649-1653 (2023) - [j36]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Formally Unimodular Packings for the Gaussian Wiretap Channel. IEEE Trans. Inf. Theory 69(12): 7755-7776 (2023) - [c28]Alessandro Melloni, Martijn Stam, Øyvind Ytrehus:
Dynamic Security Aspects of Onion Routing. IMACC 2023: 243-262 - [c27]Palma Persson, Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes. ISTC 2023: 1-5 - [c26]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions. ITW 2023: 186-191 - [i16]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4. CoRR abs/2303.08083 (2023) - [i15]Alessandro Melloni, Martijn Stam, Øyvind Ytrehus:
Dynamic Security Aspects of Onion Routing. IACR Cryptol. ePrint Arch. 2023: 1439 (2023) - 2022
- [j35]Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus:
Preface of special issue on coding theory and applications. Cryptogr. Commun. 14(3): 503 (2022) - [c25]Joakim Algrøy, Angela I. Barbero, Øyvind Ytrehus:
Determining the equivocation in coded transmission over a noisy channel. ISIT 2022: 1253-1258 - [c24]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. ISIT 2022: 3226-3231 - [i14]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. CoRR abs/2202.09236 (2022) - [i13]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Formally Unimodular Packings for the Gaussian Wiretap Channel. CoRR abs/2206.14171 (2022) - 2021
- [j34]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): 3-47 (2021) - [c23]Maiara F. Bollauf, Øyvind Ytrehus:
Tiling of Constellations. ISIT 2021: 450-454 - [c22]Alessandro Melloni, Martijn Stam, Øyvind Ytrehus:
On Evaluating Anonymity of Onion Routing. SAC 2021: 3-24 - [i12]Maiara F. Bollauf, Øyvind Ytrehus:
Tiling of Constellations. CoRR abs/2105.04253 (2021) - [i11]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel. CoRR abs/2111.01439 (2021)
2010 – 2019
- 2019
- [j33]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): 1754-1769 (2019) - [i10]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 abs/1907.02944 (2019) - [i9]Bjørn Møller Greve, Øyvind Ytrehus, Håvard Raddum:
Variable Elimination - a Tool for Algebraic Cryptanalysis. IACR Cryptol. ePrint Arch. 2019: 112 (2019) - 2018
- [j32]Angela I. Barbero, Øyvind Ytrehus:
Rate (n-1)/n Systematic Memory Maximum Distance Separable Convolutional Codes. IEEE Trans. Inf. Theory 64(4): 3018-3030 (2018) - 2017
- [e3]Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus:
Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. Lecture Notes in Computer Science 10495, Springer 2017, ISBN 978-3-319-66277-0 [contents] - [i8]Angela I. Barbero, Øyvind Ytrehus:
Rate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$. CoRR abs/1705.10091 (2017) - [i7]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 abs/1709.01455 (2017) - [i6]Bjørn Møller Greve, Håvard Raddum, Gunnar Fløystad, Øyvind Ytrehus:
Eliminating Variables in Boolean Equation Systems. CoRR abs/1710.08540 (2017) - [i5]Bjørn Møller Greve, Håvard Raddum, Gunnar Fløystad, Øyvind Ytrehus:
Eliminating Variables in Boolean Equation Systems. IACR Cryptol. ePrint Arch. 2017: 1027 (2017) - 2016
- [j31]Olav Lysne, Kjell Jørgen Hole, Christian Otterstad, Øyvind Ytrehus, Raymond Aarseth, Jorgen Tellnes:
Vendor Malware: Detection Limits and Mitigation. Computer 49(8): 62-69 (2016) - [c21]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: 16-20 - 2014
- [j30]Angela I. Barbero, Eirik Rosnes, Guang Yang, Øyvind Ytrehus:
Near-Field Passive RFID Communication: Channel Model and Code Design. IEEE Trans. Commun. 62(5): 1716-1727 (2014) - [c20]Angela I. Barbero, Øyvind Ytrehus:
A Coding-Based Approach to Robust Shortest-Path Routing. ICMCTA 2014: 35-42 - [c19]Angela I. Barbero, Øyvind Ytrehus:
Information exchange for routing protocols. ITA 2014: 1-8 - 2013
- [j29]Daniel Augot, Anne Canteaut, Gohar M. Kyureghyan, Faina I. Solov'eva, Øyvind Ytrehus:
Editorial. Des. Codes Cryptogr. 66(1-3): 1-2 (2013) - [i4]Angela I. Barbero, Eirik Rosnes, Guang Yang, Øyvind Ytrehus:
Near-Field Passive RFID Communication: Channel Model and Code Design. CoRR abs/1309.5262 (2013) - 2012
- [j28]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): 164-171 (2012) - [j27]Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus:
Coding for Inductively Coupled Channels. IEEE Trans. Inf. Theory 58(8): 5418-5436 (2012) - [c18]Guang Yang, Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus:
On the power transfer of error-control codes for RFID communications. ISIT 2012: 498-502 - [c17]Guang Yang, Angela I. Barbero, Eirik Rosnes, Øyvind Ytrehus:
Error correction on an insertion/deletion channel applying codes from RFID standards. ITA 2012: 137-142 - 2011
- [c16]Angela I. Barbero, Eirik Rosnes, Guang Yang, Øyvind Ytrehus:
Constrained codes for passive RFID communication. ITA 2011: 496-504
2000 – 2009
- 2009
- [j26]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): 4167-4178 (2009) - [c15]Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus:
Coding for a Bit-Shift Channel with Applications to Inductively Coupled Channels. GLOBECOM 2009: 1-6 - [c14]Mohammad Ravanbakhsh, Angela I. Barbero, Øyvind Ytrehus:
Improved delay estimates for a queueing model for random linear coding for unicast. ISIT 2009: 1413-1417 - [i3]Mohammad Ravanbakhsh, Angela I. Barbero, Øyvind Ytrehus:
Improved Delay Estimates for a Queueing Model for Random Linear Coding for Unicast. CoRR abs/0901.3987 (2009) - 2008
- [j25]Cunsheng Ding, Tor Helleseth, Øyvind Ytrehus:
Preface. Des. Codes Cryptogr. 48(2): 109-110 (2008) - [c13]Øyvind Ytrehus:
Communication on Inductively Coupled Channels: Overview and Challenges. ICMCTA 2008: 186-195 - 2007
- [j24]Eirik Rosnes, Øyvind Ytrehus:
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets. IEEE Trans. Inf. Theory 53(11): 4059-4075 (2007) - [c12]Angela I. Barbero, Øyvind Ytrehus:
Facts of LIFE. ICCCN 2007: 832-837 - [c11]Eirik Rosnes, Øyvind Ytrehus:
An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices. ISIT 2007: 2936-2940 - [e2]Tor Helleseth, P. Vijay Kumar, Øyvind Ytrehus:
Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, July 1-6, 2007, Solstrand, Norway. IEEE 2007, ISBN 1-4244-1199-8 [contents] - [i2]Angela I. Barbero, Øyvind Ytrehus:
An efficient centralized binary multicast network coding algorithm for any cyclic network. CoRR abs/0705.0085 (2007) - 2006
- [j23]Eirik Rosnes, Øyvind Ytrehus:
On the Design of Bit-Interleaved Turbo-Coded Modulation With Low Error Floors. IEEE Trans. Commun. 54(9): 1563-1573 (2006) - [j22]Angela I. Barbero, Øyvind Ytrehus:
Cycle-logical treatment for "Cyclopathic" networks. IEEE Trans. Inf. Theory 52(6): 2795-2804 (2006) - [c10]Angela I. Barbero, Pål Ellingsen, Susanna Spinsante, Øyvind Ytrehus:
Maximum Likelihood Decoding of Codes on the Z-channel. ICC 2006: 1200-1205 - [e1]Øyvind Ytrehus:
Coding and Cryptography, International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005. Revised Selected Papers. Lecture Notes in Computer Science 3969, Springer 2006, ISBN 978-3-540-35481-9 [contents] - [i1]Eirik Rosnes, Øyvind Ytrehus:
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets. CoRR abs/cs/0602072 (2006) - 2005
- [j21]Eirik Rosnes, Øyvind Ytrehus:
Improved algorithms for the determination of turbo-code weight distributions. IEEE Trans. Commun. 53(1): 20-26 (2005) - [c9]Eirik Rosnes, Øyvind Ytrehus:
On the construction of good families of rate-compatible punctured turbo codes. ISIT 2005: 602-606 - [c8]Eirik Rosnes, Øyvind Ytrehus:
Finite-length analysis of turbo decoding on the binary erasure channel. ISIT 2005: 1246-1250 - [c7]Eirik Rosnes, Øyvind Ytrehus:
Turbo stopping sets: the uniform interleaver and efficient enumeration. ISIT 2005: 1251-1255 - 2004
- [j20]Eirik Rosnes, Øyvind Ytrehus:
On maximum length convolutional codes under a trellis complexity constraint. J. Complex. 20(2-3): 372-403 (2004) - [j19]Eirik Rosnes, Øyvind Ytrehus:
Sphere-Packing Bounds for Convolutional Codes. IEEE Trans. Inf. Theory 50(11): 2801-2809 (2004) - [c6]Eirik Rosnes, Øyvind Ytrehus:
On lowering the error floor of bit-interleaved turbo-coded modulation. ICC 2004: 717-721 - [c5]Eirik Rosnes, Øyvind Ytrehus:
On bit-interleaved turbo-coded modulation with low error floors. ISIT 2004: 52 - [c4]Eirik Rosnes, Øyvind Ytrehus:
On convolutional codes and sphere packing bounds. ISIT 2004: 458 - [c3]Pål Ellingsen, Øyvind Ytrehus, Paul H. Siegel:
Enhanced decoding by error detection on a channel with correlated 2-dimensional errors. ITW 2004: 17-21 - 2003
- [c2]Eirik Rosnes, Øyvind Ytrehus:
High Rate Convolutional Codes with Optimal Cycle Weights. IMACC 2003: 4-23 - 2001
- [j18]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): 51-63 (2001) - 2000
- [j17]Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus:
There is no ternary [28, 6, 16] code. IEEE Trans. Inf. Theory 46(4): 1550-1554 (2000)
1990 – 1999
- 1998
- [j16]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): 423-431 (1998) - [j15]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): 1593-1602 (1998) - 1997
- [j14]M. F. Hole, Øyvind Ytrehus:
Two-step trellis decoding of partial unit memory convolutional codes. IEEE Trans. Inf. Theory 43(1): 324-329 (1997) - [j13]Iliya G. Bouyukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus:
On the [162, 8, 80] codes. IEEE Trans. Inf. Theory 43(6): 2055-2057 (1997) - 1995
- [j12]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus:
Bounds on the minimum support weights. IEEE Trans. Inf. Theory 41(2): 432-440 (1995) - [j11]Øyvind Ytrehus:
On the trellis complexity of certain binary linear block codes. IEEE Trans. Inf. Theory 41(2): 559-560 (1995) - 1994
- [j10]Kjell Jørgen Hole, Øyvind Ytrehus:
Improved coding techniques for preceded partial-response channels. IEEE Trans. Inf. Theory 40(2): 482-493 (1994) - 1993
- [j9]Noboru Hamada, Tor Helleseth, Øyvind Ytrehus:
A New Class of Nonbinary Codes Meeting the Griesmer Bound. Discret. Appl. Math. 47(3): 219-226 (1993) - [j8]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): 175-185 (1993) - [c1]Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus:
Generalizations of the Griesmer Bound. Error Control, Cryptology, and Speech Compression 1993: 41-52 - 1992
- [j7]Noboru Hamada, Tor Helleseth, Øyvind Ytrehus:
On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound. Des. Codes Cryptogr. 2(3): 225-229 (1992) - [j6]Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus:
Generalized Hamming weights of linear codes. IEEE Trans. Inf. Theory 38(3): 1133-1140 (1992) - 1991
- [j5]Øyvind Ytrehus:
Binary [18, 11]2 codes do not exist - Nor do [64, 53]2 codes. IEEE Trans. Inf. Theory 37(2): 349-351 (1991) - [j4]Øyvind Ytrehus:
Upper bounds on error-correcting runlength-limited block codes. IEEE Trans. Inf. Theory 37(3): 941-945 (1991) - [j3]Øyvind Ytrehus:
Runlength-limited codes for mixed-error channels. IEEE Trans. Inf. Theory 37(6): 1577-1585 (1991) - 1990
- [j2]Øyvind Ytrehus, Tor Helleseth:
There is no binary [25, 8, 10] code (corresp.). IEEE Trans. Inf. Theory 36(3): 695-696 (1990)
1980 – 1989
- 1987
- [j1]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): 917-919 (1987)
Coauthor Index
Angela I. Barbero
aka: Ángela I. Barbero
aka: Ángela I. Barbero
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 17:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
