Live briefing
Everything about Justesen code
Error-correcting code
In coding theory, Justesen codes form a class of error-correcting codes that have a constant rate, constant relative distance, and a constant alphabet size. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Justesen codeA 5-minute orientation
- Pick up a classic book: Uniform commercial codeThe most-reprinted book on the subject
- Read the landmark paper: A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rateCited 38 times
- Go sideways: Concatenated error correction codeA closely related topic
- Go sideways: Wozencraft ensembleA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
Sphere packings constructed from BCH and Justesen codes
A modification of the constructive asymptotically good codes of Justesen for low rates
A generalization of justesen codes
Justesen construction for polynomial redundant residue codes
Justesen-Type Modified Expander Codes and Their Decoding Algorithm
📚 Books worth reading
Uniform commercial codeJames J. White, Robert S. Summers · 1988
Two-dimensional information theory and codingJørn Justesen · 2009
A course in error-correcting codesJorn Justesen, Jom Justesen · 2004
Handbook of the law under the uniform commercial codeJames J. White · 1972
Uniform commercial codeJames J. White, Robert S. Summers · 2006- 📕Some constructions of long error-correcting codesJoern Justesen · 1975
Two-dimensional information theory and codingJørn Justesen · 2010- 📕Two-dimensional information theory and codingJørn Justesen · 2010
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Concatenated error correction code In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code and an outer code. They were conceived…
- Wozencraft ensemble In coding theory, the Wozencraft ensemble is a set of linear codes in which most of codes satisfy the Gilbert-Varshamov bound. It is named after John Wozencraft…
- Gilbert–Varshamov bound for linear codes The Gilbert–Varshamov bound for linear codes is related to the general Gilbert–Varshamov bound, which gives a lower bound on the maximal number of elements…
- Block code In coding theory, block codes are a large and important family of error-correcting codes that encode data in blocks. There is a vast number of examples…
- Locally testable code A locally testable code is a type of error-correcting code for which it can be determined if a string is a word in that code by looking at a small (frequently…
- Zyablov bound In coding theory, the Zyablov bound is a lower bound on the rate r {\displaystyle r} and relative distance δ {\displaystyle \delta } that are achievable…
- Hadamard code The Hadamard code is an error-correcting code named after the French mathematician Jacques Hadamard that is used for error detection and correction when…
- Small-bias sample space In theoretical computer science, a small-bias sample space (also known as ϵ {\displaystyle \epsilon } -biased sample space, ϵ {\displaystyle \epsilon }…