Johan Östman

591 total citations
18 papers, 349 citations indexed

About

Johan Östman is a scholar working on Electrical and Electronic Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Johan Östman has authored 18 papers receiving a total of 349 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Electrical and Electronic Engineering, 11 papers in Computer Networks and Communications and 2 papers in Artificial Intelligence. Recurrent topics in Johan Östman's work include Wireless Communication Security Techniques (12 papers), Advanced MIMO Systems Optimization (8 papers) and Cooperative Communication and Network Coding (7 papers). Johan Östman is often cited by papers focused on Wireless Communication Security Techniques (12 papers), Advanced MIMO Systems Optimization (8 papers) and Cooperative Communication and Network Coding (7 papers). Johan Östman collaborates with scholars based in Sweden, Spain and Italy. Johan Östman's co-authors include Giuseppe Durisi, Tobias Koch, Wei Yang, Yury Polyanskiy, Alejandro Lancho, Luca Sanguinetti, Rahul Devassy, Guido Carlo Ferrante, Gonzalo Vazquez-Vilar and Elif Uysal‐Biyikoglu and has published in prestigious journals such as IEEE Transactions on Communications, IEEE Transactions on Wireless Communications and IEEE Transactions on Information Forensics and Security.

In The Last Decade

Johan Östman

16 papers receiving 345 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Johan Östman Sweden 9 306 172 28 28 20 18 349
Alejandro Lancho Sweden 9 209 0.7× 113 0.7× 25 0.9× 17 0.6× 27 1.4× 25 258
Lei Yuan China 14 278 0.9× 132 0.8× 22 0.8× 83 3.0× 7 0.3× 40 323
Jesus O. Lacruz Spain 13 311 1.0× 185 1.1× 32 1.1× 57 2.0× 15 0.8× 29 358
Oscar Castañeda United States 11 326 1.1× 127 0.7× 27 1.0× 50 1.8× 14 0.7× 29 351
Manyuan Shen United States 11 490 1.6× 263 1.5× 13 0.5× 26 0.9× 21 1.1× 24 532
E.K.S. Au Hong Kong 8 482 1.6× 273 1.6× 29 1.0× 57 2.0× 9 0.5× 23 505
Kyusung Shim South Korea 11 231 0.8× 165 1.0× 27 1.0× 38 1.4× 23 1.1× 38 309
Kexin Xiao China 12 511 1.7× 131 0.8× 18 0.6× 111 4.0× 16 0.8× 21 531
Shengchu Wang China 9 328 1.1× 120 0.7× 10 0.4× 54 1.9× 19 0.9× 16 359
Kazuaki Takeda Japan 10 370 1.2× 261 1.5× 8 0.3× 28 1.0× 8 0.4× 51 386

Countries citing papers authored by Johan Östman

Since Specialization
Citations

This map shows the geographic impact of Johan Östman'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 Johan Östman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Johan Östman more than expected).

Fields of papers citing papers by Johan Östman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Johan Östman. 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 Johan Östman. The network helps show where Johan Östman may publish in the future.

Co-authorship network of co-authors of Johan Östman

This figure shows the co-authorship network connecting the top 25 collaborators of Johan Östman. A scholar is included among the top collaborators of Johan Östman 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 Johan Östman. Johan Östman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

18 of 18 papers shown
1.
Östman, Johan, et al.. (2025). FedGT: Identification of Malicious Clients in Federated Learning With Secure Aggregation. IEEE Transactions on Information Forensics and Security. 20. 2577–2592. 7 indexed citations
2.
Östman, Johan, et al.. (2024). Poisoning Attacks on Federated Learning for Autonomous Driving. Linköping electronic conference proceedings. 208. 11–18. 1 indexed citations
3.
Gómez, Pablo, et al.. (2024). PAseos Simulates the Environment for Operating Multiple Spacecraft. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing. 17. 17398–17411. 2 indexed citations
4.
Östman, Johan, Alejandro Lancho, Giuseppe Durisi, & Luca Sanguinetti. (2022). URLLC with Massive MIMO: Analysis and Design at Finite Blocklength. CINECA IRIS Institutial research information system (University of Pisa). 56 indexed citations
5.
Lancho, Alejandro, Johan Östman, & Giuseppe Durisi. (2021). On Joint Detection and Decoding in Short-Packet Communications. e-Archivo (Carlos III University of Madrid). 5 indexed citations
6.
Lancho, Alejandro, Johan Östman, Giuseppe Durisi, & Luca Sanguinetti. (2021). A Finite-Blocklength Analysis for URLLC with Massive MIMO. e-Archivo (Carlos III University of Madrid). 1–5. 8 indexed citations
7.
Lancho, Alejandro, Johan Östman, Giuseppe Durisi, Tobias Koch, & Gonzalo Vazquez-Vilar. (2020). Saddlepoint Approximations for Short-Packet Wireless Communications. IEEE Transactions on Wireless Communications. 19(7). 4831–4846. 31 indexed citations
8.
Östman, Johan, Rahul Devassy, Giuseppe Durisi, & Erik G. Ström. (2019). On the Nonasymptotic Performance of Variable-Length Codes with Noisy Stop Feedback. Chalmers Research (Chalmers University of Technology). 1–5.
9.
Östman, Johan, Rahul Devassy, Giuseppe Durisi, & Elif Uysal‐Biyikoglu. (2019). Peak-Age Violation Guarantees for the Transmission of Short Packets over Fading Channels. OpenMETU (Middle East Technical University). 109–114. 17 indexed citations
10.
Lancho, Alejandro, Johan Östman, Tobias Koch, & Gonzalo Vazquez-Vilar. (2019). Finite-Blocklength Approximations for Noncoherent Rayleigh Block-Fading Channels. Chalmers Research (Chalmers University of Technology). 815–819.
11.
Lancho, Alejandro, Johan Östman, Giuseppe Durisi, Tobias Koch, & Gonzalo Vazquez-Vilar. (2019). Saddlepoint Approximations for Noncoherent Single-Antenna Rayleigh Block-Fading Channels. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). 612–616. 4 indexed citations
12.
Ferrante, Guido Carlo, Johan Östman, Giuseppe Durisi, & Kittipong Kittichokechai. (2018). Pilot-Assisted Short Packet Transmission over Memoryless Block-Fading Channels. Chalmers Research (Chalmers University of Technology). 12 indexed citations
13.
Östman, Johan, Rahul Devassy, Guido Carlo Ferrante, & Giuseppe Durisi. (2018). Low-Latency Short-Packet Transmissions: Fixed Length or HARQ?. Chalmers Research (Chalmers University of Technology). 1–6. 18 indexed citations
14.
Marco, Piergiuseppe Di, et al.. (2017). Evaluating IPv6 Connectivity for IEEE 802.15.4 and Bluetooth Low Energy. Chalmers Research (Chalmers University of Technology). 1–6. 7 indexed citations
15.
Östman, Johan, et al.. (2016). Low-latency Ultra Reliable 5G Communications: Finite-Blocklength Bounds and Coding Schemes. elib (German Aerospace Center). 15 indexed citations
16.
Devassy, Rahul, Giuseppe Durisi, Johan Östman, et al.. (2015). Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels With No A Priori CSI. IEEE Transactions on Communications. 63(10). 3621–3632. 12 indexed citations
17.
Durisi, Giuseppe, Tobias Koch, Johan Östman, Yury Polyanskiy, & Wei Yang. (2015). Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels. IEEE Transactions on Communications. 64(2). 618–629. 151 indexed citations
18.
Durisi, Giuseppe, Tobias Koch, Johan Östman, Yury Polyanskiy, & Wei Yang. (2014). Short-Packet Communications with Multiple Antennas: Transmit Diversity, Spatial Multiplexing, and Channel Estimation Overhead.. 3 indexed citations

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

Rankless by CCL
2026