A recursive approach to low complexity codes
From MaRDI portal
Publication:3931320
DOI10.1109/TIT.1981.1056404zbMath0474.94029OpenAlexW2133068391MaRDI QIDQ3931320
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1981.1056404
bipartite graphdecoding algorithmssubcodesprobabilistic informationdecodersencodersburst-error correctionconstructing long error-correcting codes
Related Items (89)
A new formula for the minimum distance of an expander code ⋮ A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8 ⋮ On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes ⋮ Spectral gap in random bipartite biregular graphs and applications ⋮ LDPC code design for nonuniform power-line channels ⋮ Geometric Constructions of Gallager Codes ⋮ Quantum Locally Testable Codes ⋮ An explicit method to generate some QC LDPC codes with girth 8 ⋮ The complexity of error-correcting codes ⋮ Linear-time list recovery of high-rate expander codes ⋮ Codes with girth 8 Tanner graph representation ⋮ Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles ⋮ LDPC codes generated by conics in the classical projective plane ⋮ Graphical Models and Message-Passing Algorithms: Some Introductory Lectures ⋮ On small world semiplanes with generalised Schubert cells ⋮ Symmetric unique neighbor expanders and good LDPC codes ⋮ LDPC codes from cubic semisymmetric graphs ⋮ A class of quantum low-density parity check codes by combining seed graphs ⋮ Unnamed Item ⋮ Bounds on the minimum code distance for nonbinary codes based on bipartite graphs ⋮ Explicit Concentrators from Generalized N-Gons ⋮ A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems ⋮ Constructions of QC LDPC codes based on integer sequences ⋮ Global eigenvalue fluctuations of random biregular bipartite graphs ⋮ Two classes of LDPC codes from the space of Hermitian matrices over finite fields ⋮ Extremal absorbing sets in low-density parity-check codes ⋮ Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes ⋮ Monotonic optimization based decoding for linear codes ⋮ On the second eigenvalue of random bipartite biregular graphs ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Super-simple \((v, 5, 2)\) directed designs and their smallest defining sets with application in LDPC codes ⋮ Analysis of the relation between properties of LDPC codes and the Tanner graph ⋮ Expander graphs and their applications ⋮ On the girth of voltage graph lifts ⋮ An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ On the search of smallest QC-LDPC code with girth six and eight ⋮ Some combinatorial aspects of constructing bipartite-graph codes ⋮ Solving sparse linear systems of equations over finite fields using bit-flipping algorithm ⋮ On codes from hypergraphs. ⋮ On the sizes of expander graphs and minimum distances of graph codes ⋮ Message-passing algorithms for inference and optimization ⋮ (7,K) GIRTH-8 QC-LDPC CODES WITH AN EXPLICIT CONSTRUCTION ⋮ Estimation and Marginalization Using the Kikuchi Approximation Methods ⋮ A semi-systolic decoder for the PDSC-73 error-correcting code ⋮ Regular graphs of large girth and arbitrary degree ⋮ Construction of LDPC convolutional codes via difference triangle sets ⋮ Construction of binary minimal product parity-check matrices ⋮ The Minimum Distance of Graph Codes ⋮ Vectorizing computations at decoding of nonbinary codes with small density of checks ⋮ On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\) ⋮ Codes with the identifiable parent property for multimedia fingerprinting ⋮ Symmetric LDPC codes and local testing ⋮ Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes ⋮ A new approach to constructing CSS codes based on factor graphs ⋮ Reduced complexity iterative decoding of 3D-product block codes based on genetic algorithms ⋮ Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth ⋮ Low-density parity-check codes based on Steiner systems and permutation matrices ⋮ Quasi-cyclic codes from a finite affine plane ⋮ Quotients of Gaussian graphs and their application to perfect codes ⋮ Symmetric LDPC Codes and Local Testing ⋮ Graph-based convolutional and block LDPC codes ⋮ On codewords in the dual code of classical generalised quadrangles and classical polar spaces ⋮ Codes on graphs: Recent progress ⋮ Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank ⋮ Channel decomposition for multilevel codes over multilevel and partial erasure channels ⋮ Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition ⋮ Cospectral bipartite graphs with the same degree sequences but with different number of large cycles ⋮ Low-complexity error correction of Hamming-code-based LDPC codes ⋮ On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right\) shortened Hamming codes and their dual-codes] ⋮ Recursive construction of $(J,L)$ QC LDPC codes with girth 6 ⋮ On the homogeneous algebraic graphs of large girth and their applications ⋮ A branch-cut-and-price algorithm for optimal decoding in digital communication systems ⋮ Bit-optimal decoding of codes whose Tanner graphs are trees ⋮ Photonic circuits for iterative decoding of a class of low-density parity-check codes ⋮ A combinatorial characterization of smooth LTCs and applications ⋮ Woven convolutional graph codes with large free distances ⋮ Decoding concatenated codes with inner convolutional codes ⋮ Analysis of Termatiko sets in measurement matrices ⋮ Expander graphs in pure and applied mathematics ⋮ Absorbing sets of codes from finite geometries ⋮ MB iterative decoding algorithm on systematic LDGM codes: performance evaluation ⋮ Erasure correction by low-density codes ⋮ The impact of multi-group multi-layer network structure on the performance of distributed consensus building strategies ⋮ Counting short cycles of (c,d)-regular bipartite graphs ⋮ Local correctability of expander codes ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity ⋮ Optimal codes as Tanner codes with cyclic component codes ⋮ ON THE CLASS OF ARRAY-BASED APM-LDPC CODES
This page was built for publication: A recursive approach to low complexity codes
