Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2206.11395

Joint Coding of URLLC and eMBB in Wyner's Soft-Handoff Network in the Finite Blocklength Regime

Homa Nikbakht·Michèle Wigger·Shlomo Shamai·Jean-Marie Gorce·H. Vincent Poor
View original source ↗Read source document ↗Export metadata ↓

Abstract

Wyner's soft-handoff network is considered where transmitters simultaneously send messages of enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC) services. Due to the low-latency requirements, the URLLC messages are transmitted over fewer channel uses compared to the eMBB messages. To improve the reliability of the URLLC transmissions, we propose a coding scheme with finite blocklength codewords that exploits dirty-paper coding (DPC) to precancel the interference from eMBB transmissions. Rigorous bounds are derived for the error probabilities of eMBB and URLLC transmissions achieved by our scheme. Numerical results illustrate that they are lower than for standard time-sharing.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Homa Nikbakht, Michèle Wigger, Shlomo Shamai, Jean-Marie Gorce, H. Vincent Poor. 2022-06-22. Joint Coding of URLLC and eMBB in Wyner's Soft-Handoff Network in the Finite Blocklength Regime. https://arxiv.org/abs/2206.11395

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↗