The Vertex-Cut Bound and its applications

Abstract

We introduce the vertex-cut bound as a tool for analyzing the constraint complexity of realizations of a given code on an arbitrary graph. We then use this bound to obtain non-trivial lower bounds on the constraint complexity of such realizations. Our bounds enable us to show, for example, that codes that are good from an error-correcting standpoint cannot have cycle-free realizations with low constraint complexity.