default search action
Johan Östman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Pablo Gómez, Johan Östman, Vinutha Magal Shreenath, Gabriele Meoni
:
PAseos Simulates the Environment for Operating Multiple Spacecraft. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 17: 17398-17411 (2024) - [c17]Edvin Listo Zec, Johan Östman, Olof Mogren, Daniel Gillblad:
Efficient Node Selection in Private Personalized Decentralized Learning. NLDL 2024: 244-250 - [c16]Khac-Hoang Ngo, Johan Östman, Giuseppe Durisi, Alexandre Graell i Amat:
Secure Aggregation Is Not Private Against Membership Inference Attacks. ECML/PKDD (6) 2024: 180-198 - [c15]Sonakshi Garg, Hugo Jönsson, Gustav Kalander, Axel Nilsson, Bhhaanu Pirange, Viktor Valadi, Johan Östman:
Poisoning Attacks on Federated Learning for Autonomous Driving. SCAI 2024: 11-18 - [i26]Javad Aliakbari, Johan Östman, Alexandre Graell i Amat:
FedStruct: Federated Decoupled Learning over Interconnected Graphs. CoRR abs/2402.19163 (2024) - [i25]Khac-Hoang Ngo, Johan Östman, Giuseppe Durisi, Alexandre Graell i Amat:
Secure Aggregation is Not Private Against Membership Inference Attacks. CoRR abs/2403.17775 (2024) - [i24]Sonakshi Garg, Hugo Jönsson, Gustav Kalander, Axel Nilsson, Bhhaanu Pirange, Viktor Valadi, Johan Östman:
Poisoning Attacks on Federated Learning for Autonomous Driving. CoRR abs/2405.01073 (2024) - [i23]Khac-Hoang Ngo, Johan Östman, Alexandre Graell i Amat:
Local Mutual-Information Differential Privacy. CoRR abs/2405.07596 (2024) - [i22]Liv Björkdahl, Oskar Pauli, Johan Östman, Chiara Ceccobello
Towards Holistic Disease Risk Prediction using Small Language Models. CoRR abs/2408.06943 (2024) - [i21]Fabian Krüger, Johan Östman, Lewis H. Mervin, Igor V. Tetko, Ola Engkvist:
Publishing Neural Networks in Drug Discovery Might Compromise Training Data Privacy. CoRR abs/2410.16975 (2024) - 2023
- [c14]Rickard Brännvall, Helena Linge, Johan Östman:
Can the use of privacy enhancing technologies enable federated learning for health data applications in a Swedish regulatory context? SAIS 2023: 58-67 - [i20]Johan Östman, Ather Gattami, Daniel Gillblad:
Decentralized Online Bandit Optimization on Directed Graphs with Regret Bounds. CoRR abs/2301.11802 (2023) - [i19]Edvin Listo Zec, Johan Östman, Olof Mogren, Daniel Gillblad:
Private Node Selection in Personalized Decentralized Learning. CoRR abs/2301.12755 (2023) - [i18]Pablo Gómez, Johan Östman, Vinutha Magal Shreenath, Gabriele Meoni:
PAseos Simulates the Environment for Operating multiple Spacecraft. CoRR abs/2302.02659 (2023) - [i17]Johan Östman, Pablo Gómez, Vinutha Magal Shreenath, Gabriele Meoni:
Decentralised Semi-supervised Onboard Learning for Scene Classification in Low-Earth Orbit. CoRR abs/2305.04059 (2023) - [i16]Marvin Xhemrishi, Johan Östman, Antonia Wachter-Zeh, Alexandre Graell i Amat:
Balancing Privacy and Security in Federated Learning with FedGT: A Group Testing Framework. CoRR abs/2305.05506 (2023) - 2021
- [j8]Johan Östman
Short-Packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback. IEEE Trans. Wirel. Commun. 20(1): 214-227 (2021) - [j7]Johan Östman
URLLC With Massive MIMO: Analysis and Design at Finite Blocklength. IEEE Trans. Wirel. Commun. 20(10): 6387-6401 (2021) - [c13]Alejandro Lancho, Johan Östman, Giuseppe Durisi:
On Joint Detection and Decoding in Short-Packet Communications. GLOBECOM 2021: 1-6 - [c12]Alejandro Lancho, Johan Östman, Giuseppe Durisi, Luca Sanguinetti:
A Finite-Blocklength Analysis for URLLC with Massive MIMO. ICC 2021: 1-5 - [i15]Alejandro Lancho, Johan Östman, Giuseppe Durisi:
On Joint Detection and Decoding in Short-Packet Communications. CoRR abs/2109.13669 (2021) - 2020
- [j6]Alejandro Lancho
Saddlepoint Approximations for Short-Packet Wireless Communications. IEEE Trans. Wirel. Commun. 19(7): 4831-4846 (2020) - [i14]Johan Östman, Alejandro Lancho, Giuseppe Durisi, Luca Sanguinetti:
URLLC with Massive MIMO: Analysis and Design at Finite Blocklength. CoRR abs/2009.10550 (2020)
2010 – 2019
- 2019
- [j5]Johan Östman
Short Packets Over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission? IEEE Trans. Commun. 67(2): 1521-1536 (2019) - [c11]Marvin Xhemrishi, Mustafa Cemil Coskun, Gianluigi Liva, Johan Östman, Giuseppe Durisi:
List Decoding of Short Codes for Communication over Unknown Fading Channels. ACSSC 2019: 810-814 - [c10]Alejandro Lancho, Johan Östman, Tobias Koch, Gonzalo Vazquez-Vilar:
Finite-Blocklength Approximations for Noncoherent Rayleigh Block-Fading Channels. ACSSC 2019: 815-819 - [c9]Johan Östman, Alejandro Lancho, Giuseppe Durisi:
Short-Packet Transmission over a Bidirectional Massive MIMO link. ACSSC 2019: 1399-1403 - [c8]Johan Östman, Rahul Devassy, Giuseppe Durisi, Elif Uysal
Peak-Age Violation Guarantees for the Transmission of Short Packets over Fading Channels. INFOCOM Workshops 2019: 109-114 - [c7]Alejandro Lancho, Johan Östman, Giuseppe Durisi, Tobias Koch, Gonzalo Vazquez-Vilar:
Saddlepoint Approximations for Noncoherent Single-Antenna Rayleigh Block-Fading Channels. ISIT 2019: 612-616 - [c6]Johan Östman, Rahul Devassy, Giuseppe Durisi, Erik G. Ström:
On the Nonasymptotic Performance of Variable-Length Codes with Noisy Stop Feedback. ITW 2019: 1-5 - [i13]Mustafa Cemil Coskun, Gianluigi Liva, Johan Östman, Giuseppe Durisi:
Low-Complexity Joint Channel Estimation and List Decoding of Short Codes. CoRR abs/1901.05409 (2019) - [i12]Johan Östman, Rahul Devassy, Giuseppe Durisi, Elif Uysal-Biyikoglu:
Peak-Age Violation Guarantees for the Transmission of Short Packets over Fading Channels. CoRR abs/1903.06771 (2019) - [i11]Alejandro Lancho, Johan Östman, Giuseppe Durisi, Tobias Koch, Gonzalo Vazquez-Vilar:
Saddlepoint Approximations for Rayleigh Block-Fading Channels. CoRR abs/1904.10442 (2019) - [i10]Johan Östman, Rahul Devassy, Giuseppe Durisi, Erik G. Ström:
Short-packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback. CoRR abs/1909.01049 (2019) - [i9]Johan Östman, Alejandro Lancho, Giuseppe Durisi:
Short-Packet Transmission over a Bidirectional Massive MIMO link. CoRR abs/1912.00718 (2019) - 2018
- [c5]Guido Carlo Ferrante, Johan Östman, Giuseppe Durisi, Kittipong Kittichokechai:
Pilot-assisted short-packet transmission over multiantenna fading channels: A 5G case study. CISS 2018: 1-6 - [c4]Johan Östman, Rahul Devassy, Guido Carlo Ferrante, Giuseppe Durisi:
Low-Latency Short-Packet Transmissions: Fixed Length or HARQ? GLOBECOM Workshops 2018: 1-6 - [i8]Guido Carlo Ferrante, Johan Östman, Giuseppe Durisi, Kittipong Kittichokechai:
Pilot-Assisted Short-Packet Transmission over Multiantenna Fading Channels: A 5G Case Study. CoRR abs/1801.10552 (2018) - [i7]Johan Östman, Rahul Devassy, Guido Carlo Ferrante, Giuseppe Durisi:
Low-Latency Short-Packet Transmissions: Fixed Length or HARQ? CoRR abs/1809.06560 (2018) - 2017
- [c3]Johan Östman, Giuseppe Durisi, Erik G. Ström:
Finite-blocklength bounds on the maximum coding rate of rician fading channels with applications to pilot-assisted transmission. SPAWC 2017: 1-5 - [c2]Patrik Trelsmo, Piergiuseppe Di Marco, Per Skillermark, Roman Chirikov, Johan Östman:
Evaluating IPv6 Connectivity for IEEE 802.15.4 and Bluetooth Low Energy. WCNC Workshops 2017: 1-6 - [i6]Johan Östman, Giuseppe Durisi, Erik G. Ström:
Finite-Blocklength Bounds on the Maximum Coding Rate of Rician Fading Channels with Applications to Pilot-Assisted Transmission. CoRR abs/1705.02816 (2017) - [i5]Johan Östman, Giuseppe Durisi, Erik G. Ström, Mustafa Cemil Coskun, Gianluigi Liva:
Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission? CoRR abs/1712.06387 (2017) - 2016
- [j4]Giuseppe Durisi
Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels. IEEE Trans. Commun. 64(2): 618-629 (2016) - [i4]Johan Östman, Giuseppe Durisi, Erik G. Ström, Jingya Li
Low-latency Ultra Reliable 5G Communications: Finite-Blocklength Bounds and Coding Schemes. CoRR abs/1611.08714 (2016) - 2015
- [j3]Mats Ekström, Johan Östman
Information, Interaction, and Creative Production. Commun. Res. 42(6): 796-818 (2015) - [j2]Rahul Devassy, Giuseppe Durisi
Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels With No A Priori CSI. IEEE Trans. Commun. 63(10): 3621-3632 (2015) - [i3]Rahul Devassy, Giuseppe Durisi, Johan Östman, Wei Yang, Tome Eftimov, Zoran Utkovski:
Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels with no a Priori CSI. CoRR abs/1501.01957 (2015) - 2014
- [c1]Johan Östman, Wei Yang, Giuseppe Durisi
Diversity versus multiplexing at finite blocklength. ISWCS 2014: 702-706 - [i2]Johan Östman, Wei Yang, Giuseppe Durisi, Tobias Koch:
Diversity versus Multiplexing at Finite Blocklength. CoRR abs/1406.7315 (2014) - [i1]Giuseppe Durisi, Tobias Koch, Johan Östman, Yury Polyanskiy, Wei Yang:
Short-Packet Communications with Multiple Antennas: Transmit Diversity, Spatial Multiplexing, and Channel Estimation Overhead. CoRR abs/1412.7512 (2014) - 2012
- [j1]Johan Östman
Information, expression, participation: How involvement in user- generated content relates to democratic engagement among young people. New Media Soc. 14(6): 1004-1021 (2012)
Coauthor Index
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-11-28 20:27 CET 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: