Øyvind Ytrehus

963 total citations
67 papers, 573 citations indexed

About

Øyvind Ytrehus is a scholar working on Electrical and Electronic Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Øyvind Ytrehus has authored 67 papers receiving a total of 573 indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Electrical and Electronic Engineering, 44 papers in Computer Networks and Communications and 35 papers in Artificial Intelligence. Recurrent topics in Øyvind Ytrehus's work include Coding theory and cryptography (31 papers), Error Correcting Code Techniques (28 papers) and Advanced Wireless Communication Techniques (27 papers). Øyvind Ytrehus is often cited by papers focused on Coding theory and cryptography (31 papers), Error Correcting Code Techniques (28 papers) and Advanced Wireless Communication Techniques (27 papers). Øyvind Ytrehus collaborates with scholars based in Norway, Spain and Estonia. Øyvind Ytrehus's co-authors include Eirik Rosnes, Tor Helleseth, Torleiv Kløve, V.I. Levenshtein, Kjell Hole, S.M. Dodunekov, Noboru Hamada, Guang Yang, Marcel Ambroze and Guang Yang and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Communications and Computer.

In The Last Decade

Øyvind Ytrehus

62 papers receiving 551 citations

Peers

Countries citing papers authored by Øyvind Ytrehus

Since Specialization

Citations

This map shows the geographic impact of Øyvind Ytrehus's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Øyvind Ytrehus with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Øyvind Ytrehus more than expected).

Fields of papers citing papers by Øyvind Ytrehus

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Øyvind Ytrehus. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Øyvind Ytrehus. The network helps show where Øyvind Ytrehus may publish in the future.

Co-authorship network of co-authors of Øyvind Ytrehus

This figure shows the co-authorship network connecting the top 25 collaborators of Øyvind Ytrehus. A scholar is included among the top collaborators of Øyvind Ytrehus based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Øyvind Ytrehus. Øyvind Ytrehus is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Linearity of $$\mathbb {Z}_{2^L}$$-linear codes via Schur product 2025 ·Designs Codes and Cryptography ·(unknown), (unknown), A. Ferreira, Øyvind Ytrehus	0
2	Secrecy Gain of Formally Unimodular Lattices From Codes Over the Integers Modulo 4 2024 ·IEEE Transactions on Information Theory ·(unknown), Hsuan-Yin Lin, Øyvind Ytrehus	0
3	Nested Construction of $\mathbb{Z}_{2^{L}} \text{-Linear}$ Codes 2024 ·(unknown), (unknown), (unknown), Øyvind Ytrehus	1
4	Formally Unimodular Packings for the Gaussian Wiretap Channel 2023 ·IEEE Transactions on Information Theory ·(unknown), Hsuan-Yin Lin, Øyvind Ytrehus	3
5	Proxy Path Scheduling and Erasure Reconstruction for Low Delay mmWave Communication 2023 ·IEEE Communications Letters ·David A. Hayes, David Ros, Øyvind Ytrehus	1
6	Determining the equivocation in coded transmission over a noisy channel 2022 ·2022 IEEE International Symposium on Information Theory (ISIT) ·(unknown), (unknown), Øyvind Ytrehus	1
7	Vendor Malware: Detection Limits and Mitigation 2016 ·Computer ·Olav Lysne, Kjell Hole, (unknown), Øyvind Ytrehus, (unknown), (unknown)	4
8	Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices” 2012 ·IEEE Transactions on Information Theory ·Eirik Rosnes, Øyvind Ytrehus, Marcel Ambroze, Martin Tomlinson	15
9	Lightweight cryptography for RFID devices 2008 ·(unknown), (unknown), Alexander Kholosha, Øyvind Ytrehus	3
10	Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets 2007 ·IEEE Transactions on Information Theory ·Eirik Rosnes, Øyvind Ytrehus	18
11	An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices 2007 ·Eirik Rosnes, Øyvind Ytrehus	8
12	On the design of bit-interleaved turbo-coded modulation with low error floors 2006 ·IEEE Transactions on Communications ·Eirik Rosnes, Øyvind Ytrehus	13
13	Turbo stopping sets: the uniform interleaver and efficient enumeration 2005 ·Eirik Rosnes, Øyvind Ytrehus	5
14	A New Class Of Nonbinary Codes Meeting The Griesmer Bound 2005 ·(unknown), Tor Helleseth, Øyvind Ytrehus	0
15	On maximum length convolutional codes under a trellis complexity constraint 2004 ·Journal of Complexity ·Eirik Rosnes, Øyvind Ytrehus	16
16	On algorithms for determination of turbo code weight distribution 2003 ·Eirik Rosnes, Øyvind Ytrehus	3
17	Improved algorithms for high rate turbo code weight distribution calculation 2003 ·Eirik Rosnes, Øyvind Ytrehus	15
18	On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels 2001 ·Discrete Mathematics ·(unknown), Øyvind Ytrehus	3
19	On the [162,8,80] codes 1997 ·IEEE Transactions on Information Theory ·(unknown), S.M. Dodunekov, Tor Helleseth, Øyvind Ytrehus	6
20	Trellis Codes for Precoded 1-D Partial-response Channels: Further Improved Search Techniques 1994 ·International Symposium on Information Theory and its Applications ·(unknown), Øyvind Ytrehus	2

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact