Woven Graph Codes over Hyper Graphs

Constructions of woven graph codes based on constituent block and convolutional codes are studied. The constructions are based on s-partite s-uniform hypergraphs, where s depends only on the code rate. Product-type lower bounds on the minimum and free distances for woven graph codes with block and convolutional constituent codes, respectively, are given. Examples of woven hypergraph codes with large free distances are presented.