41 citations · 121 across the 13 of their papers we have counts for
12 papers · 1 filter
The Deterministic Broadcast Channel Revisited: A Bipartite Graph Approach
Yiyu Qiu, Wei Chen, H. Vincent Poor
The general broadcast channel (BC) has attracted considerable attention because it is a central problem in network or multi-user information theory. The deterministic BC (det-BC),…
Confusions and Erasures of Error-Bounded Block Decoders with Finite Blocklength
Bin Han, Yao Zhu, Rafael F. Schaefer +4
This paper investigates two distinct types of block errors - undetected errors (confusions) and erasures - in additive white Gaussian noise (AWGN) channels with error-bounded block…
Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels
Holger Boche, Andrea Grigorescu, Rafael F. Schaefer +1
This paper studies the computability of the secrecy capacity of fast-fading wiretap channels from an algorithmic perspective, examining whether it can be computed algorithmically o…
Finite Blocklength Performance of Capacity-achieving Codes in the Light of Complexity Theory
Holger Boche, Andrea Grigorescu, Rafael F. Schaefer +1
Since the work of Polyanskiy, Poor and Verdú on the finite blocklength performance of capacity-achieving codes for discrete memoryless channels, many papers have attempted to find…
Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels
Holger Boche, Andrea Grigorescu, Rafael F. Schaefer +1
This paper explores the computational complexity involved in determining the capacity of the band-limited additive colored Gaussian noise (ACGN) channel and its capacity-achieving…
Reliability and Latency Analysis for Wireless Communication Systems with a Secret-Key Budget
Karl-Ludwig Besser, Rafael F. Schaefer, H. Vincent Poor
We consider a wireless communication system with a passive eavesdropper, in which a transmitter and legitimate receiver generate and use key bits to secure the transmission of thei…
Algorithmic Computability and Approximability of Capacity-Achieving Input Distributions
Holger Boche, Rafael F. Schaefer, H. Vincent Poor
The capacity of a channel can usually be characterized as a maximization of certain entropic quantities. From a practical point of view it is of primary interest to not only comput…
Secure Broadcasting Using Independent Secret Keys
Rafael F. Schaefer, Ashish Khisti, H. Vincent Poor
The problem of secure broadcasting with independent secret keys is studied. The particular scenario is analyzed in which a common message has to be broadcast to two legitimate rece…
On Secure Computation Over the Binary Modulo-2 Adder Multiple-Access Wiretap Channel
Mario Goldenbaum, Holger Boche, H. Vincent Poor
In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver…
Finite-Blocklength Bounds for Wiretap Channels
Wei Yang, Rafael F. Schaefer, H. Vincent Poor
This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds…
Capacity Region Continuity of the Compound Broadcast Channel with Confidential Messages
Andrea Grigorescu, Holger Boche, Rafael F. Schaefer +1
The compound broadcast channel with confidential messages (BCC) generalizes the BCC by modeling the uncertainty of the channel. For the compound BCC, it is only known that the actu…
On the Continuity of the Secrecy Capacity of Compound and Arbitrarily Varying Wiretap Channels
Holger Boche, Rafael F. Schaefer, H. Vincent Poor
The wiretap channel models secure communication between two users in the presence of an eavesdropper who must be kept ignorant of transmitted messages. The performance of such a sy…