Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.05873

Information-Energy Regions in the Finite Block-Length Regime with Finite Channel Inputs

Sadaf Ul Zuhra·Samir M. Perlaza·H. Vincent Poor·Mikael Skoglund
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper characterizes the trade-offs between information and energy transmission over an additive white Gaussian noise channel in the finite block-length regime with finite sets of channel input symbols. These trade-offs are characterized using impossibility and achievability bounds on the information transmission rate, energy transmission rate, decoding error probability (DEP) and energy outage probability (EOP) for a finite block-length code. Given a set of channel input symbols, the impossibility results identify the tuples of information rate, energy rate, DEP and EOP that cannot be achieved by any code using the given set of channel inputs. A novel method for constructing a family of codes that satisfy a target information rate, energy rate, DEP and EOP is also proposed. The achievability bounds identify the set of tuples of information rate, energy rate, DEP and EOP that can be simultaneously achieved by the constructed family of codes. The proposed construction matches the impossibility bounds for the information rate, energy rate, and the EOP. However, for a given information rate, energy rate and EOP, the achieved DEP is higher than the impossibility bound due to the choice of the decoding sets made during the code construction.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sadaf Ul Zuhra, Samir M. Perlaza, H. Vincent Poor, Mikael Skoglund. 2023-05-24. Information-Energy Regions in the Finite Block-Length Regime with Finite Channel Inputs. https://arxiv.org/abs/2211.05873

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗