65 citations · 324 across the 49 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.IT2024
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…
cs.IT2024★ 1 cited
Building Resilience in Wireless Communication Systems With a Secret-Key Budget
Karl-Ludwig Besser, Rafael F. Schaefer, H. Vincent Poor
Resilience and power consumption are two important performance metrics for many modern communication systems, and it is therefore important to define, analyze, and optimize them. I…