English
Related papers

Related papers: Spectral Shape of Check-Hybrid GLDPC Codes

200 papers

This paper is concerned with linear superposition systems in which all components of the superimposed signal are coded with an identical binary low-density parity-check (LDPC) code.

Information Theory · Computer Science 2019-09-23 Shancheng Zhao , Xiao Ma , Baoming Bai

We study operators on a singular manifold, here of conical or edge type, and develop a new general approach of representing asymptotics of solutions to elliptic equations close to the singularities. The idea is to construct so-called…

Analysis of PDEs · Mathematics 2011-03-02 H. -J. Flad , G. Harutyunyan , B. -W. Schulze

This paper is concerned with the design of capacity approaching ensembles of Low-Densiy Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources where the data is encoded independently at each source through a…

Information Theory · Computer Science 2017-01-30 Mohamad Khas Mohamadi , Hamid Saeedi , Reza Asvadi

The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing…

Information Theory · Computer Science 2017-10-11 Allison Beemer , Salman Habib , Christine A. Kelley , Joerg Kliewer

We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in…

Combinatorics · Mathematics 2018-01-17 Konstantinos Panagiotou , Leon Ramzews

This doctoral thesis undertakes an in-depth exploration of limiting shape theorems across diverse mathematical structures, with a specific focus on subadditive processes within finitely generated groups exhibiting polynomial growth rates,…

Probability · Mathematics 2024-08-22 Lucas R. de Lima

In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Bohwan Jun , Pilwoong Yang , Jong-Seon No , Dong-Joon Shin

We use a complete pseudoparticle operator representation to study the explicit form of the finite-frequency conductivity for the Hubbard chain. Our study reveals that the spectral weight is mostly concentrated at the \omega =0 Drude peak…

Condensed Matter · Physics 2008-02-03 J. M. P. Carmelo , N. M. R. Peres , D. K. Campbell

In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian…

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

We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…

Information Theory · Computer Science 2022-12-16 Heide Gluesing-Luerssen , Alberto Ravagnani

We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel. We propose an efficient…

Information Theory · Computer Science 2016-11-15 Amina Piemontese , Alexandre Graell i Amat , Giulio Colavolpe

In this paper, we present a new method for explicitly constructing regular low-density parity-check (LDPC) codes based on $\mathbb{S}_{n}(\mathbb{F}_{q})$, the space of $n\times n$ symmetric matrices over $\mathbb{F}_{q}$. Using this…

Combinatorics · Mathematics 2016-05-26 Meng Zhao , Changli Ma , Qi Wang

In this paper, we present the first results obtained using $\sim$ 50 ks observations of the bright low-mass X-ray binary (LMXB) GX 17+2 with Large Area X-ray Proportional Counter (LAXPC) onboard {\it AstroSat}. The source traced out a…

High Energy Astrophysical Phenomena · Physics 2020-03-11 V. K. Agrawal , Anuj Nandi , M. C. Ramadevi

We propose new grouping methods for group shuffled (GS) decoding of both regular and irregular low-density parity check cods. These methods are independent of the check-to-variable message formula used. Integer-valued metrics for measuring…

Information Theory · Computer Science 2018-04-03 Tofar C. -Y. Chang , Yu T. Su

This paper presents a partially parallel low-density parity-check (LDPC) decoder designed for the 5G New Radio (NR) standard. The design is using a multi-block parallel architecture with a flooding schedule. The decoder can support any code…

Signal Processing · Electrical Eng. & Systems 2021-03-12 Sina Pourjabar , Gwan S. Choi

A joint scheme for the channel coding and spectrum spreading communication system is proposed in this paper. The Bit Error Rate (BER) performance of the joint proposed scheme is evaluated and compared with the case of channel coding scheme…

Information Theory · Computer Science 2021-08-24 Hadi Khodaei Jooshin , Mahdi Nangir

We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is equivariant to the quasi-cyclic automorphisms and therefore…

Information Theory · Computer Science 2022-08-17 Marvin Geiselhart , Moustafa Ebada , Ahmed Elkelesh , Jannis Clausius , Stephan ten Brink

This paper considers density evolution for lowdensity parity-check (LDPC) and multi-edge type low-density parity-check (MET-LDPC) codes over the binary input additive white Gaussian noise channel. We first analyze three singleparameter…

Information Theory · Computer Science 2016-05-17 Sachini Jayasooriya , Mahyar Shirvanimoghaddam , Lawrence Ong , Gottfried Lechner , Sarah J. Johnson

We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman et al. succeeds in…

Information Theory · Computer Science 2016-11-15 Constantinos Daskalakis , Alexandros G. Dimakis , Richard M. Karp , Martin J. Wainwright
‹ Prev 1 4 5 6 7 8 10 Next ›