Low-density parity-check codes based on finite geometries: a rediscovery and new results

DOI10.1109/18.959255zbMath1015.94015OpenAlexW2114869758MaRDI QIDQ4544717

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

zbMATH Keywords

cyclic code projective geometry Euclidean geometry low-density parity-check codes quasi-cyclic code iterative decoding finite geometry LDPC codes bit flipping decoding column splitting row-splitting

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Coding theorems (Shannon theory) (94A24) Finite geometry and special incidence structures (51E99)

Related Items (51)

On the completability of incomplete orthogonal Latin rectangles ⋮ Minimum distances of three families of low-density parity-check codes based on finite geometries ⋮ Improving a power line communications standard with LDPC codes ⋮ Quasi-cyclic LDPC codes of column-weight two using a search algorithm ⋮ Geometric Constructions of Gallager Codes ⋮ STUDY OF BIFURCATION BEHAVIOR OF LDPC DECODERS ⋮ Conics arising from internal points and their binary codes ⋮ Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles ⋮ LDPC codes from the Hermitian curve ⋮ LDPC codes generated by conics in the classical projective plane ⋮ A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences ⋮ On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\) ⋮ On the stopping distance of LDPC codes based on symplectic space over finite fields ⋮ OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING ⋮ Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation ⋮ On tensor products of CSS codes ⋮ Two classes of LDPC codes from the space of Hermitian matrices over finite fields ⋮ Large weight code words in projective space codes ⋮ Some combinatorial aspects of constructing bipartite-graph codes ⋮ On sets without tangents and exterior sets of a conic ⋮ Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\) ⋮ On analyzing LDPC codes over multiantenna MC-CDMA system ⋮ Regular LDPC codes from semipartial geometries ⋮ Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation ⋮ Construction of LDPC convolutional codes via difference triangle sets ⋮ Bent vectorial functions and linear codes from o-polynomials ⋮ LDPC codes from \(\mu\)-geodetic graphs obtained from block designs ⋮ A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices ⋮ Eigenvalues and expansion of bipartite graphs ⋮ Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth ⋮ On generator matrices and parity check matrices of generalized integer codes ⋮ Low-density parity-check codes based on Steiner systems and permutation matrices ⋮ Quasi-cyclic codes from a finite affine plane ⋮ Some low-density parity-check codes derived from finite geometries ⋮ On codewords in the dual code of classical generalised quadrangles and classical polar spaces ⋮ Codes on graphs: Recent progress ⋮ Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition ⋮ LDPC based time-frequency double differential space-time coding for multi-antenna OFDM systems ⋮ Conics arising from external points and their binary codes ⋮ Small weight codewords in the LDPC codes arising from linear representations of geometries ⋮ Pseudocodeword-free criterion for codes with cycle-free Tanner graph ⋮ Linear representations of finite geometries and associated LDPC codes ⋮ Implementing gradient descent decoding ⋮ LDPC codes from Singer cycles ⋮ Small stopping sets in Steiner triple systems ⋮ Analysis of Termatiko sets in measurement matrices ⋮ Absorbing sets of codes from finite geometries ⋮ Moderate-density parity-check codes from projective bundles ⋮ On generator and parity-check polynomial matrices of generalized quasi-cyclic codes ⋮ OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING ⋮ High-rate LDPC codes from partially balanced incomplete block designs

Uses Software

LDPC

This page was built for publication: Low-density parity-check codes based on finite geometries: a rediscovery and new results