Live briefing
Everything about Expander code
Type of error-correcting codes
In coding theory, expander codes form a class of error-correcting codes that are constructed from bipartite expander graphs. Along with Justesen codes, expander codes are of particular interest since they have a constant positive rate, positive relative distance, and alphabet size. In fact, the alphabet contains only two elements, so expander codes belong to the class of binary codes. Furthermore, expander codes can be both encoded and decoded in time proportional to the block length of the code. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Expander codeA 5-minute orientation
- Skim a recent paper: An expanded lexicon for the ubiquitin codeInfluential work since 2022
- Pick up a classic book: ChemistryThe most-reprinted book on the subject
- Read the landmark paper: Expanding the Genetic Code of Escherichia coliCited 1,431 times
- Go sideways: Zemor's decoding algorithmA closely related topic
- Go sideways: Counting lemmaA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Expanding the Genetic Code of Escherichia coli
Expander codes
On expander codes
Expander chunked codes
Expander codes
Improving the Alphabet-Size in Expander-Based Code Constructions
Eigenvalue Interlacing of Bipartite Graphs and Construction of Expander Code using Vertex-split of a Bipartite Graph
Analyzing Ta-Shma’s Code via the Expander Mixing Lemma
🆕 Influential since 2022
An expanded lexicon for the ubiquitin code
CosmoLattice: A modern code for lattice simulations of scalar and gauge field dynamics in an expanding universe
Strong blocking sets and minimal codes from expander graphs
Improved Decoding of Expander Codes
A new formula for the minimum distance of an expander code
đź“š Books worth reading
ChemistryTheodore L. Brown, H. Eugene Lemay · 1977
FreakonomicsSteven D. Levitt, Stephen J. Dubner · 2005- 📕National Internal Revenue Code of 1997Philippines. · 1950
Coding theory and cryptographyDarrel R. Hankerson, D.C. Hankerson · 2000
The Rules of ParentingRichard Craze · 2007
Beautiful CodeAndy Oram, Greg Wilson · 2007
Criminal law in CanadaSimon N. Verdun-Jones · 2007
The Rules of LoveRichard Craze · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Zemor's decoding algorithm In coding theory, Zemor's algorithm, designed and developed by Gilles Zémor, is a recursive low-complexity approach to code construction. It is an improvement…
- Counting lemma The counting lemmas this article discusses are statements in combinatorics and graph theory. The first one extracts information from ϵ {\displaystyle \epsilon…
- Möbius energy In mathematics, the Möbius energy of a knot is a particular knot energy, i.e., a functional on the space of knots. It was discovered by Jun O'Hara, who…
- Pentagramma mirificum Pentagramma mirificum (Latin for "miraculous pentagram") is a star polygon on a sphere, composed of five great circle arcs, all of whose internal angles…
- 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…
- 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…
- Independence dominating set In graph theory, an independence dominating set for a graph G = ( V , E ) {\displaystyle G=(V,E)} is a subset D ⊆ V {\displaystyle D\subseteq V} that dominates…
- Folded Reed–Solomon code In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping m {\displaystyle m} Reed–Solomon codewords over…