We investigate the lazy burning process for Latin squares by studying their associated
hypergraphs. In lazy burning, a set of vertices in a hypergraph is initially burned, and that …

We give a framework that generalizes LDPC code constructions using transversal designs
or related structures such as mutually orthogonal Latin squares. Our constructions offer a …