Results 121 to 130 of about 171 (152)
Some of the next articles are maybe not open access.
Channel Coding Rate in the Finite Blocklength Regime
IEEE Transactions on Information Theory, 2010This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight approximations of the maximal achievable rate for ...
H Vincent Poor +2 more
exaly +2 more sources
Covert Communications With Randomly Distributed Wardens in the Finite Blocklength Regime
IEEE Transactions on Vehicular Technology, 2022This paper investigates covert communications with finite blocklength in the presence of multiple randomly distributed wardens, which are modeled as a Poisson point process (PPP). Specifically, the protection area, which is guarded by the transmitter against the wardens, is introduced in order to enhance the covert communication performance. First, the
Zhongwu Xiang, Liwei Tao, Weiwei Yang
exaly +2 more sources
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.
Lalitha Sankar, Oliver Košut
exaly +2 more sources
Analysis of THz Communications in the Finite Blocklength Regime
2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2019The theory of finite blocklength coding provides powerful tools to approximate the maximum achievable rate for short blocklength coding. In this work, the normal approximation is applied for the transmission over the THz channel assuming a point-to-point single-carrier system. Here, a transmission with bit interleaved coded modulation (BICM) is assumed
Viktoria Schram, Wolfgang H. Gerstacker
openaire +1 more source
Source Coding with Unreliable Side Information in the Finite Blocklength Regime
2022 IEEE International Symposium on Information Theory (ISIT), 2022This paper studies a special case of the problem of source coding with side information. A single transmitter describes a source to a receiver that has access to a side information observation that is unavailable at the transmitter. While the source and true side information sequences are dependent, stationary, memoryless random processes, the side ...
Sun, Siming, Effros, Michelle
openaire +2 more sources
Impact of Fading Correlation and Finite-Blocklength Regimes on Secrecy
IEEE Transactions on Vehicular Technology, 2023This paper examines secrecy performance of a three-point system-where a main channel and a wiretap channel are present-under outdated channel state information (oCSI), correlated Rayleigh fading and finite-blocklength (FBL) regimes. A main channel and a wiretap channel experience oCSI severity, which impacts the system's average secrecy capacity (ASC ...
openaire +2 more sources
On the symmetric information rate of CPM in the finite blocklength regime
MILCOM 2015 - 2015 IEEE Military Communications Conference, 2015Continuous phase modulation (CPM) is a family of bandwidth-efficient signaling schemes with memory. In this paper we introduce a simulation-based method to compute a lower bound, namely the dependence testing (DT) bound, on the maximum achievable rate of general CPM schemes under finite blocklength, probability of error, and equiprobable input ...
Cenk Sahin, Erik S. Perrins
openaire +1 more source
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