Supporting Code for Transversal Gates for Highly Asymmetric qLDPC Codes

This is a mathematica notebook to accompany the paper "Transversal Gates for Highly Asymmetric qLDPC Codes" in which a construction is given such that transversal gates can be applied to codes from the balanced product and hypergraph product families. The code distances are necessarily limited, but this is the first time that the no-go theorem of Burton & Browne has been circumvented.