Everything about Zemor's decoding algorithm

🧭 Start here: a 6-step reading path

1. Read the overview: Zemor's decoding algorithmA 5-minute orientation
2. Go sideways: Quasirandom groupA closely related topic
3. Go sideways: Expander walk samplingA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• Quasirandom group In mathematics, a quasirandom group is a group that does not contain a large product-free[clarification needed] subset. Such groups are precisely those…
• Expander walk sampling In the mathematical discipline of graph theory, the expander walk sampling theorem intuitively states that sampling vertices in an expander graph by doing…
• Janson inequality In probability theory, Janson's inequality (also the Janson inequalities) is a collection of related inequalities that give exponential upper bounds on…
• Expander code In coding theory, expander codes form a class of error-correcting codes that are constructed from bipartite expander graphs. Along with Justesen codes…
• Maximal entropy random walk A maximal entropy random walk (MERW) is a popular type of biased random walk on a graph, in which transition probabilities are chosen accordingly to the…
• Watson's lemma In mathematics, Watson's lemma, proved by G. N. Watson (1918, p. 133), has significant application within the theory on the asymptotic behavior of integrals…
• Pseudorandom graph In graph theory, a graph is said to be a pseudorandom graph if it obeys certain properties that random graphs obey with high probability. There is no concrete…
• Granular material A granular material is a conglomeration of discrete solid, macroscopic particles characterized by a loss of energy whenever the particles interact (the…