LDPC

swMATH3321MaRDI QIDQ15853FDOQ15853

Author name not available (Why is that?)

Cited In (82)

• Gallager error-correcting codes for binary asymmetric channels
• Algorithm of multithreshold decoding for Gaussian channels
• An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems
• Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
• Title not available (Why is that?)
• Codes on graphs: Recent progress
• Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers
• The cycle's structure of embedded graphs in surfaces
• The complexity of error-correcting codes
• Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers
• LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
• Soft iterative decoding algorithms for rateless codes in satellite systems
• Joint message-passing decoding of LDPC codes and partial-response channels
• High-rate LDPC codes from partially balanced incomplete block designs
• On codewords in the dual code of classical generalised quadrangles and classical polar spaces
• Modulation and coding for linear Gaussian channels
• Efficient encoding of low-density parity-check codes
• A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences
• Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
• Construction of LDPC convolutional codes via difference triangle sets
• Large weight code words in projective space codes
• LDPC codes associated with linear representations of geometries
• Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
• Time-varying periodic convolutional codes with low-density parity-check matrix
• The art of signaling: fifty years of coding theory
• Improved low-density parity-check codes using irregular graphs
• Sparse Solutions of Underdetermined Linear Systems
• Tutorial series on brain-inspired computing. V: Statistical mechanics of communication and computation
• Geometric Constructions of Gallager Codes
• Performance analysis of CCSDS file delivery protocol and erasure coding techniques in deep space environments
• Classes of codes from quadratic surfaces of \(PG(3,q)\)
• Title not available (Why is that?)
• High-throughput architectures for circular block-type low-density parity-check codes
• Tanner graphs for group block codes and lattices: construction and complexity
• Title not available (Why is that?)
• Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\)
• Algorithmic Learning Theory
• Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
• Improved equalization and joint iterative detection
• Promising performance of PA-coded SIMO FM-DCSK communication systems
• Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation
• Improved construction of LDPC convolutional codes with semi-random parity-check matrices
• A framework for adaptive scalable video coding using Wyner-Ziv techniques
• Analyzing the turbo decoder using the Gaussian approximation
• A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
• LDPC codes from cubic semisymmetric graphs
• A branch-cut-and-price algorithm for optimal decoding in digital communication systems
• Some low-density parity-check codes derived from finite geometries
• Title not available (Why is that?)
• Implementing gradient descent decoding
• Monotonic optimization based decoding for linear codes
• Pseudocodeword-free criterion for codes with cycle-free Tanner graph
• Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
• A class of quantum low-density parity check codes by combining seed graphs
• LDPC codes generated by conics in the classical projective plane
• Title not available (Why is that?)
• Title not available (Why is that?)
• LDPC codes constructed from cubic symmetric graphs
• Sphere-bound-achieving coset codes and multilevel coset codes
• Which Codes Have$4$-Cycle-Free Tanner Graphs?
• Small weight codewords in the LDPC codes arising from linear representations of geometries
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• On the search of smallest QC-LDPC code with girth six and eight
• Selected unsolved problems in coding theory.
• On analyzing LDPC codes over multiantenna MC-CDMA system
• ON THE CLASS OF ARRAY-BASED APM-LDPC CODES
• On the performance and implementation issues of interleaved single parity check turbo product codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new approach to constructing CSS codes based on factor graphs
• High-performance iterative Viterbi algorithm for conventional serial concatenated codes
• Finding shorter cycles in a weighted graph
• An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC
• The distribution of loop lengths in graphical models for turbo decoding
• Errata for "good error-correcting codes based on very sparse matrices"
• LDPC based time-frequency double differential space-time coding for multi-antenna OFDM systems
• Comprehensive high-speed reconciliation for continuous-variable quantum key distribution
• Title not available (Why is that?)
• 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
• Study of adaptive modulation and LDPC coding in multicarrier systems
• Near‐Capacity Variable‐Length Coding

This page was built for software: LDPC