Abstract
We provide an overview of the quantum lego formalism, a method for constructing and analyzing large quantum error correcting codes from smaller ones using techniques from tensor networks, and provide some examples of how to realize popular codes through this formalism. We also show that the quantum weight enumerators of codes constructed via quantum lego can often be computed efficiently, providing an exact computation of the code distance.