The cocycle lattice of binary matroids, II
暂无分享,去创建一个
Abstract We continue our previous study of the lattice (grid) generated by the incidence vectors of cocycles of a binary matroid and its dual lattice. We have already proved that every denominator in the dual lattice is a power of 2 and have characterized those binary matroids M for which the largest exponent k ( M ) is 1. In this paper, we characterize the matroids with k ( M ) = 2 and, for each constant k , give a polynomial time algorithm to decide whether k ( M ) ⩾ k .
[1] László Lovász,et al. Matching structure and the matching lattice , 1987, J. Comb. Theory, Ser. B.
[2] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[3] László Lovász,et al. The Cocycle Lattice of Binary Matroids , 1993, Eur. J. Comb..