Now showing items 1-2 of 2
Computational Problems In Codes On Graphs
Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding ...
Experimental Studies On A New Class Of Combinatorial LDPC Codes
We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on ...