DocumentCode
3355341
Title
The space of solutions of coupled XORSAT formulae
Author
Hassani, S. Hamed ; Macris, Nicolas ; Urbanke, Rudiger
Author_Institution
Sch. of Comput. & Commun. Sci., EPFL, Lausanne, Switzerland
fYear
2013
fDate
7-12 July 2013
Firstpage
2453
Lastpage
2457
Abstract
The XOR-satisfiability (XORSAT) problem deals with a system of n Boolean variables and m clauses. Each clause is a linear Boolean equation (XOR) of a subset of the variables. A K-clause is a clause involving K distinct variables. In the random K-XORSAT problem a formula is created by choosing m K-clauses uniformly at random from the set of all possible clauses on n variables. The set of solutions of a random formula exhibits various geometrical transitions as the ratio m/n varies. We consider a coupled K-XORSAT ensemble, consisting of a chain of random XORSAT models that are spatially coupled across a finite window along the chain direction. We observe that the threshold saturation phenomenon takes place for this ensemble and we characterize various properties of the space of solutions of such coupled formulae.
Keywords
Boolean algebra; computability; random processes; set theory; Boolean variables; K-clause; XOR-satisfiability problem; chain direction; coupled XORSAT formulae; finite window; geometrical transitions; linear Boolean equation; random K-XORSAT problem; random formula; threshold saturation phenomenon; variable subset; Clustering algorithms; Couplings; Equations; Geometry; Information theory; Mathematical model; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location
Istanbul
ISSN
2157-8095
Type
conf
DOI
10.1109/ISIT.2013.6620667
Filename
6620667
Link To Document