Live briefing
Everything about Singleton bound
Upper bound in coding theory
In coding theory, the Singleton bound, named after the American mathematician Richard Collom Singleton (1928–2007), is a relatively crude upper bound on the size of an arbitrary block code with block length, size and minimum distance. It is also known as the Joshibound proved by Joshi (1958) and even earlier by Komamiya. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Singleton boundA 5-minute orientation
- Skim a recent paper: Single-atom co sites confined in layered double hydroxide for selective generation of surface-bound radicals via peroxymonosulfate activationInfluential work since 2022
- Pick up a classic book: SystemVerilog for VerificationThe most-reprinted book on the subject
- Read the landmark paper: Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton BoundCited 40 times
- Go sideways: Linear codeA closely related topic
- Go sideways: Decoding methodsA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound
Critical Pairs for the Product Singleton Bound
Entanglement-assisted quantum communication beating the quantum Singleton bound
An Upper Bound of Singleton Type for Componentwise Products of Linear Codes
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
On subsystem codes beating the quantum Hamming or Singleton bound
Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound
Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions
🆕 Influential since 2022
Single-atom co sites confined in layered double hydroxide for selective generation of surface-bound radicals via peroxymonosulfate activation
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes
Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
AG Codes Have No List-Decoding Friends: Approaching the Generalized Singleton Bound Requires Exponential Alphabets
Generalized Singleton Type Upper Bounds
đź“š Books worth reading
SystemVerilog for VerificationChris Spear · 2006
Complex ethics consultations · 2008- 📕Linear codes with performance close to the Singleton boundJonas Olsson · 1999
The effects of Upward Bound students' use of advance organizers as an aid to reading comprehension of selected expository materialRoy Singleton · 1979- 📕More Than Temptation (Singleton) (Volume 3)Taige Crenshaw · 2014
- 📕The Shakspeare gallery · 1792
Discrete MathmaticsR. K. Bisht, H. S. Dhami · 2015
Handbook of research on teaching literacy through the communicative and visual artsDr. James Flood, Shirley Brice Heath · 2005
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Linear code In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword. Linear codes are traditionally…
- Decoding methods In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods of mapping…
- 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…
- Locally recoverable code Locally recoverable codes are a family of error correction codes that were introduced first by D. S. Papailiopoulos and A. G. Dimakis and have been widely…
- Locally decodable code A locally decodable code (LDC) is an error-correcting code that allows a single bit of the original message to be decoded with high probability by only…
- Hamming bound In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also…
- Plotkin bound In the mathematics of coding theory, the Plotkin bound, named after Morris Plotkin, is a limit (or bound) on the maximum possible number of codewords in…
- 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…