Design of capacity-approaching irregular low-density parity-check codes
From MaRDI portal
Recommendations
Cited in
(77)- On the hardness of sampling independent sets beyond the tree threshold
- Parallel versus sequential updating for belief propagation decoding
- On analyzing LDPC codes over multiantenna MC-CDMA system
- Channel decomposition for multilevel codes over multilevel and partial erasure channels
- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- Bit-optimal decoding of codes whose Tanner graphs are trees
- Protograph LDPC code design for asynchronous random access
- A performance analysis of quantum low-density parity-check codes for correcting correlated errors
- Moderate-density parity-check codes from projective bundles
- Graph-based convolutional and block LDPC codes
- A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio
- Pooling design and bias correction in DNA library screening
- On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\)
- On tensor products of CSS codes
- Study on the distribution law of random code structure of irregular ldpc codes and its application in eliminating short cycles
- Comprehensive high-speed reconciliation for continuous-variable quantum key distribution
- Performance of low density parity check codes as a function of actual and assumed noise levels
- Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
- Optimized design for accumulate rateless codes with iterative decoding number constraint
- An accurate density evolution analysis for a finite-state Markov channel
- Generalized crossover product accumulate codes
- Complete convergence of message passing algorithms for some satisfiability problems
- Entanglement-assisted quantum error-correcting codes constructed from irregular repeat accumulate codes
- Low density parity check convolutional codes derived from quasi-cyclic block codes
- Geometric constructions of Gallager codes
- Long distance quantum key distribution with continuous variables
- Basics of secrecy coding
- Expander graphs and their applications
- A class of quantum low-density parity check codes by combining seed graphs
- LDPC Codes for Fading Gaussian Broadcast Channels
- Low-density parity-check codes over gaussian channels with erasures
- Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes
- Binary intersymbol interference channels: gallager codes, density evolution, and code performance bounds
- Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity
- Design Methods for Irregular Repeat–Accumulate Codes
- Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
- Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints
- On Designing Good LDPC Codes for Markov Channels
- A spectral approach to analysing belief propagation for 3-colouring
- Optimization design of a class of generalized RA codes
- scientific article; zbMATH DE number 4102986 (Why is no real title available?)
- A recursive approach to low complexity codes
- scientific article; zbMATH DE number 1775410 (Why is no real title available?)
- Improved low-density parity-check codes using irregular graphs
- Efficient encoding of low-density parity-check codes
- Link-Level Aspects
- On the class of array-based APM-LDPC codes
- The theoretical capacity of the parity source coder
- Counting short cycles of \((c,d)\)-regular bipartite graphs
- Enhancing continuous variable quantum key distribution with a heralded hybrid linear amplifier
- Analysis of Bayesian inference algorithms by the dynamical functional approach
- Gallager error-correcting codes for binary asymmetric channels
- STUDY OF BIFURCATION BEHAVIOR OF LDPC DECODERS
- Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes
- scientific article; zbMATH DE number 5260071 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- Typical performance of regular low-density parity-check codes over general symmetric channels
- Estimation and Marginalization Using the Kikuchi Approximation Methods
- Codes on graphs: Recent progress
- Iterative decoding of LDPC codes: some bounds and properties
- Decoding turbo-like codes via linear programming
- A fast BER evaluation method for LDGM codes
- Probabilistic Amplitude Shaping
- Efficient information reconciliation in quantum key distribution systems using informed design of non-binary LDPC codes
- SCA-LDPC: a code-based framework for key-recovery side-channel attacks on post-quantum encryption schemes
- LDPC LCD codes from odd graphs
- Linear-time decoding from a constant fraction of errors for irregular expander codes
- When can an expander code correct (n) errors in O(n) time?
- An efficient algorithm for counting cycles in QC and APM LDPC codes
- Analysis of high-dimensional Gaussian labeled-unlabeled mixture model via message-passing algorithm
- Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis
- LDPC code design for nonuniform power-line channels
- EXIT analysis of M-algorithm based MIMO detectors and LDPC code design optimization
- Near-capacity coding for discrete multitone systems with impulse noise
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices
- Constructions of QC LDPC codes based on integer sequences
- Error-correcting codes and cryptography
This page was built for publication: Design of capacity-approaching irregular low-density parity-check codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544510)
