Igor Bjelakovic
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Igor Bjelakovic has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Holger Boche
Technical University of Munich
4 shared publications - Matthias Frey
Department of Electrical and Electronic Engineering, The University of Melbourne, Parkville, VIC, Australia
4 shared publications - Slawomir Stanczak
Technische Universitt Berlin, Berlin, Germany
3 shared publications - Jingge Zhu
The University of Melbourne
2 shared publications Rafael F. Wyrembelski
Heinrich-Hertz-Lehrstuhl für Informationstheorie und theoretische Informationstechnik, Technische Universität Berlin, Berlin, Germany
2 shared publicationsArleta Szkoła
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
1 shared publication
Latest Publications
- 14 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (5) , 3644-3665
Simultaneous Computation and Communication Over MAC
We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability. Analog transmitters hold sequences of analog values. Some functions of these distributed values (but not the values themselves) need to be conveyed to the receiver, subject to a fidelity criterion such as mean squared error (MSE) or a certain maximum error with given confidence. For the case in which the computed function for the analog transmitters is a sum of values in $[-1,1]$ , we derive inner and outer bounds for the tradeoff of digital and analog rates of communication under peak and average power constraints for digital transmitters and a peak power constraint for analog transmitters. We then extend the achievability result to a class of functions that includes all linear and some non-linear functions. This extended scheme works over fading channels as long as full channel state information is available at the transmitter. The practicality of our proposed communication scheme is shown in channel simulations that use a version of the scheme based on low density parity check (LDPC) coding. We evaluate the system performance for different block lengths and Gaussian as well as non-Gaussian noise distributions.
- 14 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (5) , 3644-3665
Simultaneous Computation and Communication Over MAC
We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability. Analog transmitters hold sequences of analog values. Some functions of these distributed values (but not the values themselves) need to be conveyed to the receiver, subject to a fidelity criterion such as mean squared error (MSE) or a certain maximum error with given confidence. For the case in which the computed function for the analog transmitters is a sum of values in $[-1,1]$ , we derive inner and outer bounds for the tradeoff of digital and analog rates of communication under peak and average power constraints for digital transmitters and a peak power constraint for analog transmitters. We then extend the achievability result to a class of functions that includes all linear and some non-linear functions. This extended scheme works over fading channels as long as full channel state information is available at the transmitter. The practicality of our proposed communication scheme is shown in channel simulations that use a version of the scheme based on low density parity check (LDPC) coding. We evaluate the system performance for different block lengths and Gaussian as well as non-Gaussian noise distributions.
- 17 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (4) , 2662-2697
Semantic Security With Infinite-Dimensional Quantum Eavesdropping Channel
We propose a new proof method for direct coding theorems for wiretap channels where the eavesdropper has access to a quantum version of the transmitted signal on an infinite-dimensional Hilbert space and the legitimate parties communicate through a classical channel or a classical input, quantum output (cq) channel. The transmitter input can be subject to an additive cost constraint, which specializes to the case of an average energy constraint. This method yields errors that decay exponentially with increasing block lengths. Moreover, it provides a guarantee of a quantum version of semantic security, which is an established concept in classical cryptography and physical layer security. Therefore, it complements existing works which either do not prove the exponential error decay or use weaker notions of security. The main part of this proof method is a direct coding result on channel resolvability which states that there is only a doubly exponentially small probability that a standard random codebook does not solve the channel resolvability problem for the cq channel. Semantic security has strong operational implications meaning essentially that the eavesdropper cannot use its quantum observation to gather any meaningful information about the transmitted signal. We also discuss the connections between semantic security and various other established notions of secrecy.
- 17 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (4) , 2662-2697
Semantic Security With Infinite-Dimensional Quantum Eavesdropping Channel
We propose a new proof method for direct coding theorems for wiretap channels where the eavesdropper has access to a quantum version of the transmitted signal on an infinite-dimensional Hilbert space and the legitimate parties communicate through a classical channel or a classical input, quantum output (cq) channel. The transmitter input can be subject to an additive cost constraint, which specializes to the case of an average energy constraint. This method yields errors that decay exponentially with increasing block lengths. Moreover, it provides a guarantee of a quantum version of semantic security, which is an established concept in classical cryptography and physical layer security. Therefore, it complements existing works which either do not prove the exponential error decay or use weaker notions of security. The main part of this proof method is a direct coding result on channel resolvability which states that there is only a doubly exponentially small probability that a standard random codebook does not solve the channel resolvability problem for the cq channel. Semantic security has strong operational implications meaning essentially that the eavesdropper cannot use its quantum observation to gather any meaningful information about the transmitted signal. We also discuss the connections between semantic security and various other established notions of secrecy.
- Open Access
- 3 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 25-30
Advancements in UWB: Paving the Way for Sovereign Data Networks in Healthcare Facilities
Ultra-Wideband (UWB) technology re-emerges as a groundbreaking ranging technology with its precise micro-location capabilities and robustness. This paper highlights the security dimensions of UWB technology, focusing in particular on the intricacies of device fingerprinting for authentication, examined through the lens of state-of-the-art deep learning techniques. Furthermore, we explore various potential enhancements to the UWB standard that could realize a sovereign UWB data network. We argue that UWB data communication holds significant potential in healthcare and ultra-secure environments, where the use of the common unlicensed 2.4 GHz band-centric wireless technology is limited or prohibited. A sovereign UWB network could serve as an alternative, providing secure localization and short-range data communication in such environments.
- 3 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 25-30
Open AccessAdvancements in UWB: Paving the Way for Sovereign Data Networks in Healthcare Facilities
Ultra-Wideband (UWB) technology re-emerges as a groundbreaking ranging technology with its precise micro-location capabilities and robustness. This paper highlights the security dimensions of UWB technology, focusing in particular on the intricacies of device fingerprinting for authentication, examined through the lens of state-of-the-art deep learning techniques. Furthermore, we explore various potential enhancements to the UWB standard that could realize a sovereign UWB data network. We argue that UWB data communication holds significant potential in healthcare and ultra-secure environments, where the use of the common unlicensed 2.4 GHz band-centric wireless technology is limited or prohibited. A sovereign UWB network could serve as an alternative, providing secure localization and short-range data communication in such environments.
- Open Access
A Learning-Based Approach to Approximate Coded Computation
Lagrange coded computation (LCC) is essential to solving problems about matrix polynomials in a coded distributed fashion; nevertheless, it can only solve the problems that are representable as matrix polynomials. In this paper, we propose AICC, an AI-aided learning approach that is inspired by LCC but also uses deep neural networks (DNNs). It is appropriate for coded computation of more general functions. Numerical simulations demonstrate the suitability of the proposed approach for the coded computation of different matrix functions that are often utilized in digital signal processing.
Open AccessA Learning-Based Approach to Approximate Coded Computation
Lagrange coded computation (LCC) is essential to solving problems about matrix polynomials in a coded distributed fashion; nevertheless, it can only solve the problems that are representable as matrix polynomials. In this paper, we propose AICC, an AI-aided learning approach that is inspired by LCC but also uses deep neural networks (DNNs). It is appropriate for coded computation of more general functions. Numerical simulations demonstrate the suitability of the proposed approach for the coded computation of different matrix functions that are often utilized in digital signal processing.
- Open Access
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 560-564
MAC resolvability: First and second order results
Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel (MAC) from the perspective of resolvability. We then refine the approach in order to obtain some novel results on the second-order achievable rates.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 560-564
Open AccessMAC resolvability: First and second order results
Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel (MAC) from the perspective of resolvability. We then refine the approach in order to obtain some novel results on the second-order achievable rates.
- Open Access
- 2 September 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 58 (10) , 2984-2994
Optimal Coding Strategies for Bidirectional Broadcast Channels Under Channel Uncertainty
Bidirectional relaying is a promising approach to improve the performance in wireless networks such as sensor, ad-hoc, and even cellular systems. Bidirectional relaying applies to three-node networks, where a relay establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. First, the two nodes transmit their messages to the relay which decodes them. Then, the relay broadcasts a reencoded message in such a way that both nodes can decode their intended message using their own message as side information. We consider uncertainty in the channel state information (CSI) and assume that all nodes only know that the channel over which the transmission takes place is from a pre-specified set of channels. In this work, we concentrate on the second phase, which is called the compound bidirectional broadcast channel. We present a robust coding strategy which enables reliable communication under channel uncertainty and show that this strategy actually achieves the compound capacity. Further, we analyze scenarios where either the receivers or the transmitter have perfect CSI. We show that CSI at the receivers does not affect the maximal achievable rates, while CSI at the transmitter improves the capacity region. A numerical example and a game-theoretic interpretation complete this work.
- 2 September 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 58 (10) , 2984-2994
Open AccessOptimal Coding Strategies for Bidirectional Broadcast Channels Under Channel Uncertainty
Bidirectional relaying is a promising approach to improve the performance in wireless networks such as sensor, ad-hoc, and even cellular systems. Bidirectional relaying applies to three-node networks, where a relay establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. First, the two nodes transmit their messages to the relay which decodes them. Then, the relay broadcasts a reencoded message in such a way that both nodes can decode their intended message using their own message as side information. We consider uncertainty in the channel state information (CSI) and assume that all nodes only know that the channel over which the transmission takes place is from a pre-specified set of channels. In this work, we concentrate on the second phase, which is called the compound bidirectional broadcast channel. We present a robust coding strategy which enables reliable communication under channel uncertainty and show that this strategy actually achieves the compound capacity. Further, we analyze scenarios where either the receivers or the transmitter have perfect CSI. We show that CSI at the receivers does not affect the maximal achievable rates, while CSI at the transmitter improves the capacity region. A numerical example and a game-theoretic interpretation complete this work.
- 1 May 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15503607,p. 1-6
List Decoding for Bidirectional Broadcast Channels with Unknown Varying Channels
The concept of bidirectional relaying shows the potential to improve the performance in wireless networks such as sensor, ad-hoc, and even cellular systems. It applies to three-node networks, where a relay node establishes a bidirectional communication between two other nodes. In the first phase of a decode-and-forward protocol, the two nodes transmit their messages to a relay node, which decodes them. In the succeeding bidirectional broadcast phase, the relay broadcasts a re-encoded composition of them so that both nodes can decode the other's message using their own message as side information. We assume that the transmission is affected by unknown varying channels. Unfortunately, the unknown variation of the channel can lead to channels which completely prohibit any reliable communication. In this work, we analyze the bidirectional broadcast phase under list decoding and show that this decoding technique can improve the performance significantly in the sense that it allows to transmit reliably in scenarios where usual decoding schemes fail.
- 1 May 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15503607,p. 1-6
List Decoding for Bidirectional Broadcast Channels with Unknown Varying Channels
The concept of bidirectional relaying shows the potential to improve the performance in wireless networks such as sensor, ad-hoc, and even cellular systems. It applies to three-node networks, where a relay node establishes a bidirectional communication between two other nodes. In the first phase of a decode-and-forward protocol, the two nodes transmit their messages to a relay node, which decodes them. In the succeeding bidirectional broadcast phase, the relay broadcasts a re-encoded composition of them so that both nodes can decode the other's message using their own message as side information. We assume that the transmission is affected by unknown varying channels. Unfortunately, the unknown variation of the channel can lead to channels which completely prohibit any reliable communication. In this work, we analyze the bidirectional broadcast phase under list decoding and show that this decoding technique can improve the performance significantly in the sense that it allows to transmit reliably in scenarios where usual decoding schemes fail.
- 1 December 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 269-272
On the capacity of bidirectional relaying with unknown varying channels
One key feature to improve the performance of future wireless communication systems will be the use of relays. In this work, we consider the bidirectional relay channel, where a relay node establishes a bidirectional communication between two nodes, and study coding strategies for the case of unknown varying channels. In the first phase of a decode-and-forward protocol the two nodes transmit their messages to the relay node, which decodes them. In the succeeding bidirectional broadcast phase the relay broadcasts a re-encoded composition of them so that both nodes can decode the intended message using their own message from the previous phase as side information. We assume that the whole communication is affected by unknown varying channels. For both phases we present the capacity regions and characterize the impact of channel uncertainty on the achievable rates. Thereby, it shows that the unknown variation can lead to channels which completely prohibit a reliable communication.
- 1 December 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 269-272
On the capacity of bidirectional relaying with unknown varying channels
One key feature to improve the performance of future wireless communication systems will be the use of relays. In this work, we consider the bidirectional relay channel, where a relay node establishes a bidirectional communication between two nodes, and study coding strategies for the case of unknown varying channels. In the first phase of a decode-and-forward protocol the two nodes transmit their messages to the relay node, which decodes them. In the succeeding bidirectional broadcast phase the relay broadcasts a re-encoded composition of them so that both nodes can decode the intended message using their own message from the previous phase as side information. We assume that the whole communication is affected by unknown varying channels. For both phases we present the capacity regions and characterize the impact of channel uncertainty on the achievable rates. Thereby, it shows that the unknown variation can lead to channels which completely prohibit a reliable communication.
- Open Access
- 1 July 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1208-1212
On the boundedness of the support of optimal input measures for Rayleigh fading channels
We consider transmission over a wireless multiple antenna communication system operating in a Rayleigh flat fading environment with no channel state information at the receiver and the transmitter. We show that, subject to the average power constraint, the support of the capacity achieving input distribution is bounded. Moreover, we show by a simple example concerning the identity theorem (or uniqueness theorem) from the complex analysis in several variables that some of the existing results in the field are not rigorous.
- 1 July 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1208-1212
Open AccessOn the boundedness of the support of optimal input measures for Rayleigh fading channels
We consider transmission over a wireless multiple antenna communication system operating in a Rayleigh flat fading environment with no channel state information at the receiver and the transmitter. We show that, subject to the average power constraint, the support of the capacity achieving input distribution is bounded. Moreover, we show by a simple example concerning the identity theorem (or uniqueness theorem) from the complex analysis in several variables that some of the existing results in the field are not rigorous.
- Open Access
- 15 February 2008
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 279 (2) , 559-584
Typical Support and Sanov Large Deviations of Correlated States
- 15 February 2008
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 279 (2) , 559-584
Open AccessTypical Support and Sanov Large Deviations of Correlated States