English
Related papers

Related papers: Polar Coding for Efficient Transport Layer Multica…

200 papers

This paper presents polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is…

Information Theory · Computer Science 2016-11-15 Marco Mondelli , S. Hamed Hassani , Igal Sason , Rüdiger Urbanke

We propose a novel coupling technique for the design of polar codes of length N, making them decodable through a sliding window of size M < N. This feature allows to reduce the computational complexity of the decoder, an important…

Information Theory · Computer Science 2021-05-06 Valerio Bioglio , Carlo Condo , Ingmar Land

The space limitation and the channel acquisition prevent Massive MIMO from being easily deployed in a practical setup. Motivated by current deployments of LTE-Advanced, the use of multi-polarized antennas can be an efficient solution to…

Information Theory · Computer Science 2015-01-13 Jaehyun Park , Bruno Clerckx

Quantum Key Distribution (QKD) enables two parties to establish a common secret key that is information-theoretically secure by transmitting random bits that are encoded as qubits and sent over a quantum channel, followed by classical…

In this paper, we propose a new polar code construction by employing kernels of different sizes in the Kronecker product of the transformation matrix, thus generalizing the original construction by Arikan. The proposed multi-kernel polar…

Information Theory · Computer Science 2020-01-15 Valerio Bioglio , Frederic Gabry , Ingmar Land , Jean-Claude Belfiore

Over the past decade, polar codes have received significant traction and have been selected as the coding method for the control channel in fifth-generation (5G) wireless communication systems. However, conventional polar codes are reliant…

Information Theory · Computer Science 2023-05-09 Hossein Rezaei , Elham Abbasi , Nandana Rajatheva , Matti Latva-aho

In this chapter, we show how the use of differential coding and the presence of phase slips in the transmission channel affect the total achievable information rates and capacity of a system. By means of the commonly used QPSK modulation,…

Information Theory · Computer Science 2017-04-18 Laurent Schmalen , Stephan ten Brink , Andreas Leven

A commonly assumed drawback of multi-level coding, compared to a bit-interleaved coded modulation, is its high latency: Indeed, the levels must be decoded sequentially. In this paper, we consider polar codes to code each level. We show that…

Information Theory · Computer Science 2022-06-02 Vincent Corlay

An efficient analog network coding transmission protocol is proposed in this letter for a MIMO two way cellular network. Block signal alignment is first proposed to null the inter-user interference for multi-antenna users, which makes the…

Information Theory · Computer Science 2013-08-19 Ming Gan , Zhiguo Ding , Xuchu Dai

Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of…

Information Theory · Computer Science 2017-05-10 Alexios Balatsoukas-Stimming , Pascal Giard , Andreas Burg

Communication is a core enabler for multi-robot systems (MRS), providing the mechanism through which robots exchange state information, coordinate actions, and satisfy safety constraints. While many MRS autonomy algorithms assume reliable…

Robotics · Computer Science 2026-03-19 Anil Zaher , Kiril Solovey , Alejandro Cohen

A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which…

Information Theory · Computer Science 2013-07-12 Peter Trifonov , Vera Miloslavskaya

Tailoring polar code construction for decoding algorithms beyond successive cancellation has remained a topic of significant interest in the field. However, despite the inherent nested structure of polar codes, the use of sequence models in…

Information Theory · Computer Science 2024-01-31 Sravan Kumar Ankireddy , S Ashwin Hebbar , Heping Wan , Joonyoung Cho , Charlie Zhang

The successive cancellation list decoding algorithm for polar codes yields near-optimal decoding performance at the cost of high implementation complexity. The successive cancellation stack algorithm has been shown to provide similar…

Information Theory · Computer Science 2018-09-12 Harsh Aurora , Warren J. Gross

In this work, we present a concatenated repetition-polar coding scheme that is aimed at applications requiring highly unbalanced unequal bit-error protection, such as the Beam Interlock System of the Large Hadron Collider at CERN. Even…

Information Theory · Computer Science 2017-12-04 Alexios Balatsoukas-Stimming , Tomasz Podzorny , Jan Uythoven

The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This setting is of particular interest for applications requiring…

Information Theory · Computer Science 2020-09-14 Joachim Neu , Mustafa Cemil Coşkun , Gianluigi Liva

We design polar codes for empirical coordination and strong coordination in two-node networks. Our constructions hinge on the fact that polar codes enable explicit low-complexity schemes for soft covering. We leverage this property to…

Information Theory · Computer Science 2018-06-08 Remi A. Chou , Matthieu Bloch , Joerg Kliewer

This work considers optimizing LDPC codes in the physical-layer network coded two-way relay channel using noncoherent FSK modulation. The error-rate performance of channel decoding at the relay node during the multiple-access phase was…

Information Theory · Computer Science 2015-02-23 Terry Ferrett , Matthew C. Valenti

We study faulty successive cancellation decoding of polar codes for the binary erasure channel. To this end, we introduce a simple erasure-based fault model and we show that, under this model, polarization does not happen, meaning that…

Information Theory · Computer Science 2015-02-10 Alexios Balatsoukas-Stimming , Andreas Burg

For finite length polar codes, channel polarization leaves a significant number of channels not fully polarized. Adding a Cyclic Redundancy Check (CRC) to better protect information on the semi-polarized channels has already been…

Information Theory · Computer Science 2016-11-14 A. Elkelesh , M. Ebada , S. Cammerer , S. ten Brink
‹ Prev 1 8 9 10 Next ›