Maximality of the cycle code of a graph

The cycle code of a graph is the binary linear span of the characteristic vectors of circuits. We characterize the graphs whose cycle codes are maximal for the packing problem, based on characterizing the graphs whose girth is at least 12(n−c) +1 where n and c are the numbers of vertices and connected components.