These are the humble beginnings of an ambitious project - finite length analysis and optimization of iterative coding ensembles

Enter the parameters of ensemble; the program will determine a (typically tight) upper bound on the block error probability for the erasure channel which stems from stopping sets of size between vmin and vmax; it also determines a lower bound on the probability, call it pe_exp, that a randomly chosen code does not contain stopping sets of size vmin-1 or less; this error floor curve can be used to upper bound the performance of the ensemble assuming that an outer code can remove all erasures of size up to vmin-1 (solid line); alternatively, by multiplying this upper bound with 1/pe_exp we get an upper bound on the block error probability of the expurgated ensemble (dashed line)