- LDPC: Graph generation from an ensemble
Generate random instances of a given LDPC ensemble and visualize the corresponding Tanner graph.
- LDPC: Encoding complexity
Perform a greedy “lower triangulation” on the adjacency matrix of a random code instance of a given LDPC ensemble. The encoding complexity is proportional to the square of the “gap.” In the depicted figure the gap is the height at which the “diagonal” hits the vertical axis of the matrix.
- LDPC: Decoding over the BEC
Visualization of the peeling decoder for transmission over the BEC.
- LDPC: Finite-length scaling and error floor for BEC
Compute a finite length approximation of the error probability curve based on the scaling approach.
- LDPC: Another scaling demo for BEC
Visualization of the scaling phenomenon of the error probability curve.
- LDPC: Maxwell decoder
Maxwell decoder for the BEC: allows you to compute the MAP and the BP thresholds of a given degree distribution.
- LDPC: Gaussian multiple-access channels: iterative decoding
Visualization of iterative decoding for transmission over a multi-access channel.
- PolarCodes: Web Applet for Polar Codes
Polar coding is a novel capacity-achieving channel coding scheme. This applet shows the functionality of the code and explains the successive cancellation decoding scheme.
- PolarCodes: Overview and parameters trade-offs
This tutorial gives an overview of Polar Codes and presents trade-offs between parameters.
- Xitip: Information theoretic inequalities prover
Xitip is a software tool to prove Information theoretic inequalities. The tool will check the correctness of any valid information inequality. A valid information inequality refers to a linear inequality involving measures such as (single, conditional or joint ) entropy and mutual informations. Optional information theoretic constraints (such as Markov chains, independence, deterministic functionals) can be provided.
- LDPC: LDPC Simulator