Low-density parity-check codes based on finite geometries: a rediscovery and new results
From MaRDI portal
Publication:4544717
DOI10.1109/18.959255zbMATH Open1015.94015OpenAlexW2114869758MaRDI QIDQ4544717FDOQ4544717
Authors: Yu Kou, Shu Lin, Marc Fossorier 
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.959255
Recommendations
- Some low-density parity-check codes derived from finite geometries
- scientific article; zbMATH DE number 2063211
- Galois geometries and low-density parity-check codes
- Minimum distances of three families of low-density parity-check codes based on finite geometries
- New Classes of Partial Geometries and Their Associated LDPC Codes
- Information geometry and low density parity check codes
- Linear representations of finite geometries and associated LDPC codes
- LDPC codes associated with linear representations of geometries
- Low-Density Parity-Check Lattices: Construction and Decoding Analysis
- scientific article; zbMATH DE number 1795249
Euclidean geometryprojective geometrycyclic codequasi-cyclic codeiterative decodinglow-density parity-check codesfinite geometry LDPC codesbit flipping decodingcolumn splittingrow-splitting
Coding theorems (Shannon theory) (94A24) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Finite geometry and special incidence structures (51E99)
Cited In (69)
- Conics arising from internal points and their binary codes
- OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING
- STUDY OF BIFURCATION BEHAVIOR OF LDPC DECODERS
- High stopping-distance LDPC product codes based on Hamming and finite geometry codes.
- On the stopping distance of LDPC codes based on symplectic space over finite fields
- LDPC based time-frequency double differential space-time coding for multi-antenna OFDM systems
- Asymptotically good generalized quasi-cyclic codes over finite chain rings
- On tensor products of CSS codes
- Construction of short block length,high rate low-density parity-check codes based on cyclic difference families
- Optimal folding of data flow graphs based on finite projective geometry using vector space partitioning
- Moderate-density parity-check codes from projective bundles
- Title not available (Why is that?)
- Eigenvalues and expansion of bipartite graphs
- On the completability of incomplete orthogonal Latin rectangles
- Absorbing sets of codes from finite geometries
- Codes on graphs: Recent progress
- Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights
- Improving a power line communications standard with LDPC codes
- Quasi-cyclic LDPC codes of column-weight two using a search algorithm
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
- High-rate LDPC codes from partially balanced incomplete block designs
- On codewords in the dual code of classical generalised quadrangles and classical polar spaces
- Minimum distances of three families of low-density parity-check codes based on finite geometries
- A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences
- 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
- A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices
- Conics arising from external points and their binary codes
- Regular LDPC codes from semipartial geometries
- Regular and irregular progressive edge-growth tanner graphs
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- LDPC codes: A group algebra formulation
- Galois geometries and low-density parity-check codes
- Low-density parity-check codes based on Steiner systems and permutation matrices
- Title not available (Why is that?)
- Quasi-cyclic codes from a finite affine plane
- Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\)
- Linear representations of finite geometries and associated LDPC codes
- LDPC codes from Singer cycles
- Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation
- On generator matrices and parity check matrices of generalized integer codes
- Small stopping sets in Steiner triple systems
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition
- On generator and parity-check polynomial matrices of generalized quasi-cyclic codes
- Some low-density parity-check codes derived from finite geometries
- Implementing gradient descent decoding
- Some combinatorial aspects of constructing bipartite-graph codes
- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Low-density parity-check codes and the related performance analysis methods
- LDPC codes generated by conics in the classical projective plane
- On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\)
- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
- Two classes of LDPC codes from the space of Hermitian matrices over finite fields
- Low-Density Parity-Check Lattices: Construction and Decoding Analysis
- On sets without tangents and exterior sets of a conic
- On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
- Analysis of Termatiko sets in measurement matrices
- LDPC codes from the Hermitian curve
- Bent vectorial functions and linear codes from o-polynomials
- The construction of low-density parity-check codes based on protograph
- Codes on finite geometries
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Information geometry and low density parity check codes
- Geometric constructions of Gallager codes
- On analyzing LDPC codes over multiantenna MC-CDMA system
Uses Software
This page was built for publication: Low-density parity-check codes based on finite geometries: a rediscovery and new results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544717)
