English
Related papers

Related papers: Density Evolution for Asymmetric Memoryless Channe…

200 papers

Based on the extended binary image of non-binary LDPC codes, we propose a method for generating extra redundant bits, such as to decreases the coding rate of a mother code. The proposed method allows for using the same decoder, regardless…

Information Theory · Computer Science 2011-03-15 Lam Pham Sy , Valentin Savin , David Declercq

We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the…

Information Theory · Computer Science 2014-02-17 Stefan Schwandter , Alexandre Graell i Amat , Gerald Matz

This work considers the design of short non-binary low-density parity-check (LDPC) codes over finite fields of order m, for channels with phase noise. In particular, m-ary differential phase-shift keying (DPSK) modulated code symbols are…

Information Theory · Computer Science 2019-08-09 Tudor Ninacs , Balázs Matuz , Gianluigi Liva , Giulio Colavolpe

We show in this work that reinforcement learning can be successfully applied to decoding short to moderate length sparse graph-based channel codes. Specifically, we focus on low-density parity check (LDPC) codes, which for example have been…

Information Theory · Computer Science 2020-10-20 Salman Habib , Allison Beemer , Joerg Kliewer

Conditional density estimation (CDE) is the task of estimating the probability of an event conditioned on some inputs. A neural network (NN) can also be used to compute the output distribution for continuous-domain, which can be viewed as…

Machine Learning · Computer Science 2021-12-30 Bing Chen , Mazharul Islam , Jisuo Gao , Lin Wang

A non-adaptive quantitative group testing (GT) scheme based on sparse codes-on-graphs in combination with low-complexity peeling decoding was introduced and analyzed by Karimi et al.. In this work, we propose a variant of this scheme based…

Information Theory · Computer Science 2024-04-18 Mgeni Makambi Mashauri , Alexandre Graell i Amat , Michael Lentmaier

Learning probabilistic models that can estimate the density of a given set of samples, and generate samples from that density, is one of the fundamental challenges in unsupervised machine learning. We introduce a new generative model based…

Machine Learning · Computer Science 2020-06-11 Siavash A. Bigdeli , Geng Lin , Tiziano Portenier , L. Andrea Dunbar , Matthias Zwicker

The bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity, if there is a non-zero fraction of degree-two bit nodes. However, the degree-two bit nodes preclude the possibility…

Information Theory · Computer Science 2013-05-22 Asit Kumar Pradhan , Arunkumar Subramanian , Andrew Thangaraj

Unsupervised anomaly detection stands as an important problem in machine learning, with applications in financial fraud prevention, network security and medical diagnostics. Existing unsupervised anomaly detection algorithms rarely perform…

Machine Learning · Computer Science 2026-02-04 Pritam Kar , Rahul Bordoloi , Olaf Wolkenhauer , Saptarshi Bej

Here we have proposed two decoding strategies of low-density parity-check (LDPC) codes over Markov noise channels with bit flipping noise. The sum-product algorithm used for decoding LDPC codes over memoryless channels is extended to…

Signal Processing · Electrical Eng. & Systems 2019-12-20 Mohit Kumar

We consider spatially coupled code ensembles over a multiple access channel. Convolutional LDPC ensembles are one instance of spatially coupled codes. It was shown recently that, for transmission over the binary erasure channel, this…

Information Theory · Computer Science 2011-02-15 Shrinivas Kudekar , Kenta Kasai

We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems…

Information Theory · Computer Science 2007-07-13 Martin J. Wainwright , Emin Martinian

We propose an accurate and lightweight convolutional neural network for stereo estimation with depth completion. We name this method fully-convolutional deformable similarity network with depth completion (FCDSN-DC). This method extends…

Computer Vision and Pattern Recognition · Computer Science 2022-09-15 Dominik Hirner , Friedrich Fraundorfer

Ensuring extremely high reliability in channel coding is essential for 6G networks. The next-generation of ultra-reliable and low-latency communications (xURLLC) scenario within 6G networks requires frame error rate (FER) below $10^{-9}$.…

Information Theory · Computer Science 2024-11-18 Hee-Youl Kwak , Dae-Young Yun , Yongjune Kim , Sang-Hyo Kim , Jong-Seon No

In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector…

Information Theory · Computer Science 2009-11-13 Tadashi Wadayama

A method for estimating the performance of low-density parity-check (LDPC) codes decoded by hard-decision iterative decoding algorithms on binary symmetric channels (BSC) is proposed. Based on the enumeration of the smallest weight error…

Information Theory · Computer Science 2007-07-13 Hua Xiao , Amir H. Banihashemi

This paper investigates how diffusion generative models leverage (unknown) low-dimensional structure to accelerate sampling. Focusing on two mainstream samplers -- the denoising diffusion implicit model (DDIM) and the denoising diffusion…

Machine Learning · Statistics 2025-06-18 Jiadong Liang , Zhihan Huang , Yuxin Chen

Because of their capacity-approaching performance, graph-based codes have a wide range of applications, including communications and storage. In these codes, unequal error protection (UEP) can offer performance gains with limited rate loss.…

Information Theory · Computer Science 2021-01-25 Beyza Dabak , Ahmed Hareedy , Alexei Ashikhmin , Robert Calderbank

In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative…

Information Theory · Computer Science 2014-11-18 Lai Wei , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

Over discrete memoryless channels (DMC), linear decoders (maximizing additive metrics) afford several nice properties. In particular, if suitable encoders are employed, the use of decoding algorithm with manageable complexities is…

Information Theory · Computer Science 2008-10-01 Emmanuel Abbe , Lizhong Zheng