Recursive reconstruction on periodic trees

A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjacent vertices to have the same label is 1 − . This model simulates noisy propagation of a bit from the root, and has significance both in communication theory and in biology. Our aim is to find an algorithm which decides for every set

• Type: Journal
• Year: 1998
• Where: RSA
• Authors: Elchanan Mossel
• Keywords: Periodic Tree Tn, RSA 1998, Tree Tn, finite Tree T