2001 · 240 citations · 8 references
ComputingComputer ScienceAlgorithmsCryptographyData StructuresChannel CodingCoding TheoryError Control CodingError-correcting CodesGraph AlgorithmsBch CodesCodes Over Finite FieldsCyclic CodesLdpc CodesLinear CodesPrime RingsQuasi-cyclic CodesSimulation Studies
A class of graphs is designed using subgroups of the multiplicative group of a prime field GF(p). Instances where (p-1) is divisible by 3 and 5 are used to construct quasi-cyclic LDPC codes with bit degree 3 and parity degree 5, among them a [155,64,20] code. While the girth of a graph in this class cannot be greater than twelve, for many practical lengths the graphs have a relatively large girth and a lowdensity of short cycles. Simulation studies show that at short to moderate lengths these codes performance meets or surpasses that of randomly generated regular (3,5) LDPC codes when used with sum-product algorithm decoders. I.
8
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text
Codes and Decoding on General Graphs
N. Wiberg · 1996 · 919 citations