A recursive approach to low complexity codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- On the homogeneous algebraic graphs of large girth and their applications
- MB iterative decoding algorithm on systematic LDGM codes: performance evaluation
- Erasure correction by low-density codes
- Complexity of constructing codes with specified correction properties
- A semi-systolic decoder for the PDSC-73 error-correcting code
- Decoding concatenated codes with inner convolutional codes
- On codes from hypergraphs.
- Improved decoding and error floor analysis of staircase codes
- Channel decomposition for multilevel codes over multilevel and partial erasure channels
- Bit-optimal decoding of codes whose Tanner graphs are trees
- Monotonic optimization based decoding for linear codes
- Comments on ``Integer SEC-DED codes for low power communications
- Analysis of the relation between properties of LDPC codes and the Tanner graph
- Some combinatorial aspects of constructing bipartite-graph codes
- A branch-cut-and-price algorithm for optimal decoding in digital communication systems
- Analysis of Termatiko sets in measurement matrices
- On the search of smallest QC-LDPC code with girth six and eight
- Construction of LDPC convolutional codes via difference triangle sets
- Low-density parity-check codes based on Steiner systems and permutation matrices
- Graph-based convolutional and block LDPC codes
- 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
- Absorbing sets of codes from finite geometries
- Local correctability of expander codes
- Optimal codes as Tanner codes with cyclic component codes
- On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- 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
- Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
- On the sizes of expander graphs and minimum distances of graph codes
- A new approach to constructing CSS codes based on factor graphs
- Quasi-cyclic codes from a finite affine plane
- A coding scheme that increases the code rate
- An explicit method to generate some QC LDPC codes with girth 8
- Codes with girth 8 Tanner graph representation
- On small world semiplanes with generalised Schubert cells
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Performance limits of compound codes with symbol-based iterative decoding
- A combinatorial characterization of smooth LTCs and applications
- The impact of multi-group multi-layer network structure on the performance of distributed consensus building strategies
- Algorithms of constructing linear and robust codes based on wavelet decomposition and its application
- The minimum distance of graph codes
- Recursive code scales for moving converters
- Expander graphs in pure and applied mathematics
- Explicit Concentrators from Generalized N-Gons
- Symmetric unique neighbor expanders and good LDPC codes
- Photonic circuits for iterative decoding of a class of low-density parity-check codes
- Geometric constructions of Gallager codes
- Quantum locally testable codes
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- Expander graphs and their applications
- A class of quantum low-density parity check codes by combining seed graphs
- Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
- Low-rate turbo-Hadamard codes
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- scientific article; zbMATH DE number 4047592 (Why is no real title available?)
- scientific article; zbMATH DE number 4102986 (Why is no real title available?)
- scientific article; zbMATH DE number 3552378 (Why is no real title available?)
- Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes
- Some decomposable codes: the |a+x|b+x|a+b+x| construction
- Dynamic programming and the graphical representation of error-correcting codes
- Concatenated tree codes: a low-complexity, high-performance approach
- Regular graphs of large girth and arbitrary degree
- Symmetric LDPC codes and local testing
- A reduction in the search space of QC-LDPC codes with girth 8
- On the class of array-based APM-LDPC codes
- Counting short cycles of \((c,d)\)-regular bipartite graphs
- Low-density parity-check codes achieve list-decoding capacity
- The complexity of error-correcting codes
- \((7,K)\) girth-8 QC-LDPC codes with an explicit construction
- Vectorizing computations at decoding of nonbinary codes with small density of checks
- LDPC codes from cubic semisymmetric graphs
- Recursive construction of \((J,L)\) QC LDPC codes with girth 6
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
- Codes with the identifiable parent property for multimedia fingerprinting
- Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank
- 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
- Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
- Estimation and Marginalization Using the Kikuchi Approximation Methods
- A new formula for the minimum distance of an expander code
- Spectral gap in random bipartite biregular graphs and applications
- Codes on graphs: Recent progress
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems
- 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
- 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
- Good quantum LDPC codes with linear time decoders
- NLTS Hamiltonians from good quantum codes
- Phase transitions of structured codes of graphs
- Strong blocking sets and minimal codes from expander graphs
- Message-passing algorithms for inference and optimization
- Combinatorial constructions of optimal low-power error-correcting cooling codes
- Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method
- LDPC LCD codes from odd graphs
This page was built for publication: A recursive approach to low complexity codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3931320)
