Sipser and Spielman proved distance of their expander codes [1]} through propagation: expansion of the underlying graph is used to “lift” the distance of the base code to the distance of the global code.
In our codes distance is shown via a similar argument.
