Bounds on the capacity of constrained two-dimensional (2-D) codes are prese
nted. The bounds of Calkin and Wilf apply to first-order symmetric constrai
nts. The bounds are generalized in a weaker form to higher order and nonsym
metric constraints. Results are given for constraints specified by run-leng
th limits or a minimum distance between pixels of a given value.