Results 141 to 150 of about 2,366 (166)
Some of the next articles are maybe not open access.
Converse bounds for assorted codes in the finite blocklength regime
2013 IEEE International Symposium on Information Theory, 2013We study converse bounds for unequal error protection codebooks with k > 1 different classes of codewords. We dub these unequal error protection codes “assorted codes”. We extend a finite blocklength converse bound due to Polyanskiy-Poor-Verdu to apply to assorted codes and use this extension to obtain a refined asymptotic expansion for the performance
Yanina Shkel +2 more
openaire +1 more source
Interleaved Concatenated Coding for Secrecy in the Finite Blocklength Regime
IEEE Signal Processing Letters, 2016We propose a systematic concatenated coding scheme based on the combination of interleaving with powerful channel codes and jamming for wireless secrecy under the practical assumption of codes in the finite blocklength regime. The basic idea lies in generating a short random key that is used to shuffle/interleave information at the source, Alice.
João P. Vilela +4 more
openaire +1 more source
Capacity Results for Discrete Memoryless Channels in the Finite Blocklength Regime
2019 IEEE Information Theory Workshop (ITW), 2019We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
Yasutada Oohama
exaly +2 more sources
Universal fixed-to-variable source coding in the finite blocklength regime
2013 IEEE International Symposium on Information Theory, 2013A universal source coding problem is considered in the finite blocklength regime for stationary memoryless sources. A new coding scheme is presented that encodes based on the type class size and the empirical support set of the sequence. It is shown that there is no loss in dispersion relative to the case when the source distribution is known.
Oliver Košut, Lalitha Sankar
exaly +2 more sources
Covert communication with beamforming over MISO channels in the finite blocklength regime
Science China Information Sciences, 2021This paper considers beamforming techniques for covert communication over multiple input single output (MISO) channels with finite blocklength. We first show that the optimal input distribution for covert communication over complex Gaussian channels is circular symmetric complex Gaussian.
Xinchun Yu, Yuan Luo 0003, Wen Chen 0001
openaire +1 more source
Resource Allocation for AoI-Constrained V2V Communication in Finite Blocklength Regime
2020 IEEE Wireless Communications and Networking Conference (WCNC), 2020The freshness of information is an important indicator for critical message exchange in vehicle-to-vehicle (V2V) communications. In this paper, we study a resource allocation problem to minimize the long-term power consumption under age of information (AoI) constraints in the finite blocklength (FBL) regime.
Shuai Gao, Meixia Tao
openaire +1 more source
Fixed-length lossy compression in the finite blocklength regime: Gaussian source
2011 IEEE Information Theory Workshop, 2011For an i.i.d. Gaussian source with variance σ2, we show that it is necessary to spend ½ ln σ2/d + 1/□2n Q−1(e) + O (ln n/n) nats per sample in order to reproduce n source samples within mean-square error d with probability at least 1 — e, where Q−1 (·) is the inverse of the standard Gaussian complementary cdf.
Victoria Kostina, Sergio Verdú
openaire +2 more sources
Type II wiretap channel with an active eavesdropper in finite blocklength regime
2016 IEEE Wireless Communications and Networking Conference, 2016In this paper we consider a wiretap channel II with an active eavesdropper. Aggarwal et al (2009) were the first who studied the Ozarow-Wyner's binary wiretap channel II in the presence of an active eavesdropper. They derived achievable secrecy rates for two modification models where the eavesdropper can erase/replace the bits he observes.
Anna Frank +2 more
openaire +1 more source
2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2019
We consider a mobile edge computing network supporting low-latency and ultra reliable services. Task off-loading from the user to the edge server is operated under a truncated retransmission process, i.e., the allowed retransmission times are finite.
Yao Zhu 0001 +3 more
openaire +1 more source
We consider a mobile edge computing network supporting low-latency and ultra reliable services. Task off-loading from the user to the edge server is operated under a truncated retransmission process, i.e., the allowed retransmission times are finite.
Yao Zhu 0001 +3 more
openaire +1 more source
Resource Allocation for Multicarrier Communication in the Finite Blocklength Regime
IEEE Wireless Communications Letters, 2023Liqing Shan +3 more
openaire +1 more source