English
Related papers

Related papers: Two-stage coding over the Z-channel

200 papers

In this paper, we propose a physical-layer rateless code for wireless channels. A novel rateless encoding scheme is developed to overcome the high error floor problem caused by the low-density generator matrix (LDGM)-like encoding scheme in…

Information Theory · Computer Science 2013-06-25 Shuang Tian , Yonghui Li , Mahyar Shirvanimoghaddam , Branka Vucetic

There is a class of entropy-coding methods which do not substitute symbols by code words (such as Huffman coding), but operate on intervals or ranges. This class includes three prominent members: conventional arithmetic coding, range…

Information Theory · Computer Science 2025-07-04 Tilo Strutz , Nico Schreiber

In this paper will be presented new approach to entropy coding: family of generalizations of standard numeral systems which are optimal for encoding sequence of equiprobable symbols, into asymmetric numeral systems - optimal for freely…

Information Theory · Computer Science 2009-05-21 Jarek Duda

The problem of blind identification of channel codes at a receiver involves identifying a code chosen by a transmitter from a known code-family, by observing the transmitted codewords through the channel. Most existing approaches for…

Information Theory · Computer Science 2026-03-04 Pramod Singh , Prasad Krishnan , Arti Yardi

Consider two remote nodes (encoder and decoder), each with a binary sequence. The encoder's sequence $X$ differs from the decoder's sequence $Y$ by a small number of edits (deletions and insertions). The goal is to construct a message $M$,…

Information Theory · Computer Science 2020-10-28 Mahed Abroshan , Ramji Venkataramanan , Albert Guillen i Fabregas

The state-of-the-art error correcting codes are based on large random constructions (random graphs, random permutations, ...) and are decoded by linear-time iterative algorithms. Because of these features, they are remarkable examples of…

Disordered Systems and Neural Networks · Physics 2016-08-31 Silvio Franz , Michele Leone , Andrea Montanari , Federico Ricci-Tersenghi

A constant-rate encoder--decoder pair is presented for a fairly large family of two-dimensional (2-D) constraints. Encoding and decoding is done in a row-by-row manner, and is sliding-block decodable. Essentially, the 2-D constraint is…

Information Theory · Computer Science 2008-08-06 Ido Tal , Tuvi Etzion , Ron M. Roth

We study the following one-way asymmetric transmission problem, also a variant of model-based compressed sensing: a resource-limited encoder has to report a small set $S$ from a universe of $N$ items to a more powerful decoder (server). The…

Data Structures and Algorithms · Computer Science 2018-07-30 Alexandr Andoni , Javad Ghaderi , Daniel Hsu , Dan Rubenstein , Omri Weinstein

The next generation of wireless communications systems will employ new frequency bands such as those in the upper midband, millimeter-wave and sub-terahertz frequency bands. The high energy consumption of analog-to-digital converters…

Information Theory · Computer Science 2025-05-27 D. Melo , L. Landau , R. de Lamare

We investigate cat codes that can correct multiple excitation losses and identify two types of logical errors: bit-flip errors due to excessive excitation loss and dephasing errors due to quantum back-action from the environment. We show…

A quantum error-correcting code with a nonzero error threshold undergoes a mixed-state phase transition when the error rate reaches that threshold. We explore this phase transition for Haar-random quantum codes, in which the logical…

This paper investigates a joint source-channel secrecy problem for the Shannon cipher broadcast system. We suppose list secrecy is applied, i.e., a wiretapper is allowed to produce a list of reconstruction sequences and the secrecy is…

Information Theory · Computer Science 2017-07-25 Lei Yu , Houqiang Li , Weiping Li

We introduce the concept of an \ff-maximal error-detecting block code, for some parameter \ff{} between 0 and 1, in order to formalize the situation where a block code is close to maximal with respect to being error-detecting. Our…

Information Theory · Computer Science 2016-08-01 Stavros Konstantinidis , Nelma Moreira , Rogerio Reis

The task of finding a correctable encoding that protects against some physical quantum process is in general hard. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum…

Quantum Physics · Physics 2010-04-23 Marcus Silva , Easwar Magesan , David W. Kribs , Joseph Emerson

We study the multi-user Bayesian persuasion game between one encoder and two decoders, where the first decoder is better informed than the second decoder. We consider two perfect links, one to the first decoder only, and the other to both…

Information Theory · Computer Science 2021-09-09 Rony Bou Rouphael , Mael Le Treust

The problem of error-control in random linear network coding is considered. A ``noncoherent'' or ``channel oblivious'' model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer…

Information Theory · Computer Science 2008-03-25 Ralf Koetter , Frank Kschischang

This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the…

Information Theory · Computer Science 2014-02-05 Victoria Kostina , Sergio Verdú

In this paper, network error control coding is studied for robust and efficient multicast in a directed acyclic network with imperfect links. The block network error control coding framework, BNEC, is presented and the capability of the…

Information Theory · Computer Science 2008-09-25 Hossein Bahramgiri , Farshad Lahouti

In this paper we introduce a new class of codes for over-loaded synchronous wireless and optical CDMA systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be…

Information Theory · Computer Science 2008-10-18 P. Pad , F. Marvasti , K. Alishahi , S. Akbari

This paper considers insertion and deletion channels with the additional assumption that the channel input sequence is implicitly divided into segments such that at most one edit can occur within a segment. No segment markers are available…

Information Theory · Computer Science 2018-03-19 Mahed Abroshan , Ramji Venkataramanan , Albert Guillen i Fabregas