Low-Density Parity-Check Random Graph Code Generator

Generate a random code!
How to use the code generator
An introduction to random graph construction (primary source)
This applet constructs an (N,K) code randomly based on the principles of stopping sets using an iterative algorithm presented in the source given above. It can construct codes of different distances and degrees. The code is represented both by its bi-partite Tanner graph, which can be used in message passing algorithms for decoding and its parity-check matrix.
  • Code Parameters (N,K): Code will map K information bits to an N-bit code word (N variable bits), meaning there are M=N-K parity/check bits.
  • Check-bit Degree: Determines the number of check bits that each variable bit is used to calculate.
  • Min. Code Distance: Determines the lower bound on code distance - the number of bits that differ between all codewords. This also corresponds to the minimum stopping set size of the graph (see source).
  • Generate!: Constructs a new random code from the current settings.
NOTE: Requires Java 1.4.2 or later!