@article {Kuba2001a,
	title = {Reconstruction of discrete sets with absorption},
	journal = {Linear Algebra and its Applications},
	volume = {339},
	year = {2001},
	pages = {171-194},
	abstract = {<p>The uniqueness problem is considered when binary matrices are to be reconstructed from their absorbed row and column sums. Let the absorption coefficient n be selected such that en = (1+5^0.5)/2. Then it is proved that if a binary matrix is non-uniquely determined, then it contains a special pattern of 0s and 1s called composition of alternatively corner-connected components. In a previous paper [Discrete Appl. Math. (submitted)] we proved that this condition is also sufficient, i.e., the existence of such a pattern in the binary matrix is necessary and sufficient for its non-uniqueness. <tt> </tt></p>},
	doi = {10.1016/S0024-3795(01)00486-4},
	url = {http://www.sciencedirect.com/science/article/B6V0R-44CHW26-C/2/e4cd2b3dc91dbb828db15e331a6230cc},
	author = {Attila Kuba and Maurice Nivat}
}
