Relation Between Parity-Check Matrixes and Cycles of Associated Tanner Graphs

This correspondence presents an approach to the representation of cycles of Tanner graphs on associated parity-check matrices. Several equivalent conditions for the girth of a Tanner graph to be 2k are proposed. An algorithm to determine girth of associated Tanner graphs of parity-check matrices is proposed, also with an algorithm to count shortest cycles.