English
Related papers

Related papers: Low-Complexity Decoder for Overloaded Uniquely Dec…

200 papers

Locally Decodable Codes (LDCs) are error-correcting codes $C\colon\Sigma^n\rightarrow \Sigma^m,$ encoding \emph{messages} in $\Sigma^n$ to \emph{codewords} in $\Sigma^m$, with super-fast decoding algorithms. They are important mathematical…

Information Theory · Computer Science 2026-03-03 Alexander R. Block , Jeremiah Blocki , Kuan Cheng , Elena Grigorescu , Xin Li , Yu Zheng , Minshen Zhu

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

Sparse code multiple access (SCMA), as a codebook-based non-orthogonal multiple access (NOMA) technique, has received research attention in recent years. The codebook design problem for SCMA has also been studied to some extent since…

Information Theory · Computer Science 2022-05-03 Chinwei Huang , Borching Su , Tingyi Lin , Yenming Huang

This paper reviews the potential channel decoding techniques for ultra-reliable low-latency communications (URLLC). URLLC is renowned for its stringent requirements including ultra-reliability, low end-to-end transmission latency, and…

Information Theory · Computer Science 2022-12-26 Chentao Yue , Vera Miloslavskaya , Mahyar Shirvanimoghaddam , Branka Vucetic , Yonghui Li

Despite the NP hardness of acquiring minimum distance $d_m$ for linear codes theoretically, in this paper we propose one experimental method of finding minimum-weight codewords, the weight of which is equal to $d_m$ for LDPC codes. One…

Information Theory · Computer Science 2007-10-09 Guangwen Li , Guangzeng Feng

We study uniquely decodable codes and list decodable codes in the high-noise regime, specifically codes that are uniquely decodable from $\frac{1-\varepsilon}{2}$ fraction of errors and list decodable from $1-\varepsilon$ fraction of…

Information Theory · Computer Science 2024-11-06 Xin Li , Songtao Mao

The goal of the paper is to study specific properties of nonbinary low-density parity-check (NB LDPC) codes when used in coded modulation systems. The paper is focused on the practically important NB LDPC codes over extensions of the Galois…

Information Theory · Computer Science 2022-05-25 Irina E. Bocharova , Boris D. Kudryashov , Evgenii P. Ovsyannikov , Vitaly Skachek

Data center networks (DCNs) require a low-cost, low-power optical transceiver to handle increased traffic from generative artificial intelligence, video streaming services, and more. Improving the required signal-to-noise ratio (RSNR) by…

Signal Processing · Electrical Eng. & Systems 2025-09-09 Takeshi Kakizaki , Masanori Nakamura , Fukutaro Hamaoka , Shuto Yamamoto , Etsushi Yamazaki

The theoretic results of MIMO capacity tell us that the higher the number of antennas are employed, the higher the transmission rate is. This makes MIMO systems with hundreds of antennas very attractive but one of the major problems that…

Information Theory · Computer Science 2012-04-19 Puripong Suthisopapan , Anupap Meesomboon , Kenta Kasai , Virasit Imtawil

In this letter, we present a hybrid iterative decoder for non-binary low density parity check (LDPC) codes over binary erasure channel (BEC), based on which the recursion of the erasure probability is derived to design non-binary LDPC codes…

Signal Processing · Electrical Eng. & Systems 2020-03-04 Yang Yu , Wen Chen , Lili Wei

An ultra-high throughput low-density parity check (LDPC) decoder with an unrolled full-parallel architecture is proposed, which achieves the highest decoding throughput compared to previously reported LDPC decoders in the literature. The…

In this paper, we derive a maximum likelihood (ML) decoder of the differential data in a decode-and-forward (DF) based cooperative communication system utilizing uncoded transmissions. This decoder is applicable to complex-valued unitary…

Information Theory · Computer Science 2012-04-12 Manav R. Bhatnagar

In this paper, we develop an efficient decoder via the proximal alternating direction method of multipliers (proximal-ADMM) technique for nonbinary linear block codes in the Galois field. Its main contents are as follows: first, exploiting…

Information Theory · Computer Science 2020-10-20 Yongchao Wang , Jing Bai

Ternary channels can be used to model the behavior of some memory devices, where information is stored in three different levels. In this paper, error correcting coding for a ternary channel where some of the error transitions are not…

Information Theory · Computer Science 2011-05-31 Nicolas Bitouze , Alexandre Graell i Amat , Eirik Rosnes

In this letter, we explore the performance limits of short polar codes and find that the maximum likelihood (ML) performance of a simple CRC-polar concatenated scheme can approach the finite blocklength capacity. Then, in order to approach…

Information Theory · Computer Science 2019-10-09 Jinnan Piao , Kai Niu , Jincheng Dai , Chao Dong

Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques such as low…

Signal Processing · Electrical Eng. & Systems 2020-02-28 Fan Wei , Wen Chen

A new method for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel is presented. The proposed method termed belief-propagation--list erasure decoding…

Information Theory · Computer Science 2017-05-29 Irina E. Bocharova , Boris D. Kudryashov , Vitaly Skachek , Yauhen Yakimenka

We consider the decoding of bit interleaved coded modulation (BICM) applied to multiband OFDM for practical scenarios where only a noisy (possibly very bad) estimate of the channel is available at the receiver. First, a decoding metric…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

Quantum computers hold the potential to surpass classical computers in solving complex computational problems. However, the fragility of quantum information and the error-prone nature of quantum operations make building large-scale,…

In this paper, we propose a systematic low density generator matrix (LDGM) code ensemble, which is defined by the Bernoulli process. We prove that, under maximum likelihood (ML) decoding, the proposed ensemble can achieve the capacity of…

Information Theory · Computer Science 2020-01-10 Suihua Cai , Wenchao Lin , Xinyuanmeng Yao , Baodian Wei , Xiao Ma
‹ Prev 1 3 4 5 6 7 10 Next ›