English
Related papers

Related papers: A Physical-layer Rateless Code for Wireless Channe…

200 papers

Channel charting has emerged as a powerful tool for user equipment localization and wireless environment sensing. Its efficacy lies in mapping high-dimensional channel data into low-dimensional features that preserve the relative…

Signal Processing · Electrical Eng. & Systems 2025-09-17 Ge Chen , Panqi Chen , Lei Cheng

We propose a novel construction of product codes for high-density magnetic recording based on binary low-density parity check (LDPC) codes and binary image of Reed Solomon (RS) codes. Moreover, two novel algorithms are proposed to decode…

Information Theory · Computer Science 2012-01-06 Vo Tam Van , Seiichi Mita

In this paper, we first present the asymptotic performance of serially concatenated low-density generator-matrix (SCLDGM) codes for binary input additive white Gaussian noise channels using discretized density evolution (DDE). We then…

Information Theory · Computer Science 2024-10-30 Amrit Kharel , Lei Cao

In this paper, the performance limits and the computational complexity of the lattice sequential decoder are analyzed for the unconstrained additive white Gaussian noise channel. The performance analysis available in the literature for such…

Information Theory · Computer Science 2013-04-11 Walid Abediseid , Mohamed-Slim Alouini

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

A recent line of work has focused on the use of low-density generator matrix (LDGM) codes for lossy source coding. In this paper, wedevelop a generic technique for deriving lower bounds on the rate-distortion functions of binary linear…

Information Theory · Computer Science 2008-08-18 A. G. Dimakis , M. J. Wainwright , K. Ramchandran

This paper proposes a novel transmission strategy, referred to as layered BPSK, which allows two independent symbol streams to be layered at the transmitter on a non-orthogonal basis and isolated from each other at the receiver without…

Information Theory · Computer Science 2018-09-21 Bingli Jiao , Yuli Yang , Mingxi Yin

We consider distributed Luby transform (DLT) codes for efficient packet transmission in a multi-way relay network, where the links are modeled as erasure channels. Density evolution is applied for asymptotic performance analysis, and…

Information Theory · Computer Science 2014-10-02 Iqbal Hussain , Ming Xiao , Lars K. Rasmussen

Grant-free access schemes are candidates to support future massive multiple access applications owing to their capability to reduce control signaling and latency. As a promising class of grant-free schemes, coded random access schemes can…

Information Theory · Computer Science 2022-08-25 Lorenzo Valentini , Marco Chiani , Enrico Paolini

It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We…

Information Theory · Computer Science 2011-08-03 Vahid Aref , Rüdiger L. Urbanke

In this work, we consider efficient maximum-likelihood decoding of linear block codes for small-to-moderate block lengths. The presented approach is a branch-and-bound algorithm using the cutting-plane approach of Zhang and Siegel (IEEE…

Information Theory · Computer Science 2014-04-29 Michael Helmling , Eirik Rosnes , Stefan Ruzika , Stefan Scholl

Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In…

Discrete Mathematics · Computer Science 2016-06-06 Eimear Byrne , Akiko Manada

A rateless code encodes a finite length information word into an infinitely long codeword such that longer prefixes of the codeword can tolerate a larger fraction of errors. A rateless code achieves capacity for a family of channels if, for…

Information Theory · Computer Science 2014-06-03 Benny Applebaum , Liron David , Guy Even

A present challenge in wireless communications is the assurance of ultra-reliable and low-latency communication (URLLC). While the reliability aspect is well known to be improved by channel coding with long codewords, this usually implies…

Information Theory · Computer Science 2023-03-15 Sahar Allahkaram , Francisco A. Monteiro , Ioannis Chatzigeorgiou

We propose a new class of error correction codes for low-delay streaming communication. We consider an online setup where a source packet arrives at the encoder every $M$ channel uses, and needs to be decoded with a maximum delay of $T$…

Information Theory · Computer Science 2016-11-17 Ahmed Badr , Pratik Patil , Ashish Khisti , Wai-Tian Tan , John Apostolopoulos

Non-binary (NB) low-density parity-check (LDPC) codes are graph-based codes that are increasingly being considered as a powerful error correction tool for modern dense storage devices. The increasing levels of asymmetry incorporated by the…

Information Theory · Computer Science 2019-09-25 Ahmed Hareedy , Chinmayi Lanka , Nian Guo , Lara Dolecek

Batched sparse (BATS) code is a network coding solution for multi-hop wireless networks with packet loss. Achieving a close-to-optimal rate relies on an optimal degree distribution. Technical challenges arise from the sensitivity of this…

Information Theory · Computer Science 2024-05-15 Hoover H. F. Yin , Jie Wang , Sherman S. M. Chow

Conventional wireless techniques are becoming inadequate for beyond fifth-generation (5G) networks due to latency and bandwidth considerations. To improve the error performance and throughput of wireless communication systems, we propose…

Networking and Internet Architecture · Computer Science 2021-03-23 Amanat Kafizov , Ahmed Elzanaty , Lav R. Varshney , Mohamed-Slim Alouini

A message composed of packets is transmitted using erasure and channel coding over a fading channel with no feedback. For this scenario, the paper explores the trade-off between the redundancies allocated to the packet-level erasure code…

Information Theory · Computer Science 2016-02-03 Sudarsan V. S. Ranganathan , Tong Mu , Richard D. Wesel

In this paper, we present the concept of non-uniform channel polarization and a scheme for rate-compatible polar code construction for any codeword length using additive white Gaussian noise (AWGN) channels and the successive cancellation…

Information Theory · Computer Science 2019-11-19 Robert M. Oliveira , Rodrigo C. de Lamare