Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles

This publication has 22 references indexed in Scilit:

• On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
  IEEE Transactions on Information Theory, 2006
• LDPC Codes From Generalized Polygons
  IEEE Transactions on Information Theory, 2005
• Explicit Construction of Families of LDPC Codes With No$4$-Cycles
  IEEE Transactions on Information Theory, 2004
• Regular low-density parity-check codes from oval designs
  European Transactions on Telecommunications, 2003
• Regular low-density parity-check codes from oval designs
  European Transactions on Telecommunications, 2003
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
  IEEE Transactions on Information Theory, 2001
• Minimum-distance bounds by graph analysis
  IEEE Transactions on Information Theory, 2001
• Explicit construction of graphs with an arbitrary large girth and of large size
  Discrete Applied Mathematics, 1995
• A recursive approach to low complexity codes
  IEEE Transactions on Information Theory, 1981
• Low-density parity-check codes
  IEEE Transactions on Information Theory, 1962