Live briefing
Everything about Sequential decoding
Limited memory technique for decoding free codes
Recognised by John Wozencraft, sequential decoding is a limited memory technique for decoding tree codes. Sequential decoding is mainly used as an approximate decoding algorithm for long constraint-length convolutional codes. This approach may not be as accurate as the Viterbi algorithm but can save a substantial amount of computer memory. It was used to decode a convolutional code in 1968 Pioneer 9 mission. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Sequential decodingA 5-minute orientation
- Skim a recent paper: Decoding the EEG patterns induced by sequential finger movement for brain-computer interfacesInfluential work since 2022
- Pick up a classic book: Neural Information ProcessingThe most-reprinted book on the subject
- Read the landmark paper: Fast Sequential Decoding Algorithm Using a StackCited 363 times
- Go sideways: MIMOA closely related topic
- Go sideways: Generalized minimum-distance decodingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Fast Sequential Decoding Algorithm Using a Stack
Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding
Multiuser signal detection using sequential decoding
Parallel versus sequential updating for belief propagation decoding
Sequential Decoding of Polar Codes
Convolutional codes III. Sequential decoding
Hybrid ARQ error control using sequential decoding
Sequential Decoding - The Computation Problem*
🆕 Influential since 2022
Decoding the EEG patterns induced by sequential finger movement for brain-computer interfaces
Neural Correlate and Movement Decoding of Simultaneous-and-Sequential Bimanual Movements Using EEG Signals
Causal Language Model Aided Sequential Decoding With Natural Redundancy
Application of Guessing to Sequential Decoding of Polarization-Adjusted Convolutional (PAC) Codes
Parallel or sequential? Decoding conceptual and phonological/phonetic information from MEG signals during language production
📚 Books worth reading
Neural Information ProcessingTingwen Huang · 2012
Mathematical structures for computer scienceJudith L. Gersting · 1982
Digital systems testing and testable designMiron Abramovici · 1990
Practical Electronics for InventorsPaul Scherz · 2000- 📕Sequential decodingJohn M. Wozencraft · 1961
- 📕A hybrid M-algorithm/sequential decoder for convolutional and Trellis codesFu-Quan Wang · 1990
Linguistic structure predictionNoah A. Smith · 2011
Data structures & algorithms in JavaRobert Lafore · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- MIMO MIMO (/ˈmaɪmoʊ, ˈmiːmoʊ/), or multiple-input multiple-output, is a wireless technology that multiplies the capacity of a radio link using multiple transmit…
- Generalized minimum-distance decoding In coding theory, generalized minimum-distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using…
- Shannon–Fano–Elias coding In information theory, Shannon–Fano–Elias coding is a precursor to arithmetic coding, in which probabilities are used to determine codewords. It is named…
- Binary symmetric channel A binary symmetric channel (or BSCp) is a common communications channel model used in coding theory and information theory. In this model, a transmitter…
- List decoding In coding theory, list decoding is an alternative to unique decoding of error-correcting codes for large error rates. The notion was proposed by Elias…
- 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…
- Noisy-channel coding theorem In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise…
- Parallel all-pairs shortest path algorithm A central problem in algorithmic graph theory is the shortest path problem. Hereby, the problem of finding the shortest path between every pair of nodes…