Live briefing
Everything about Majority logic decoding
Method to decode repetition codes
In error detection and correction, majority logic decoding is a method to decode repetition codes, based on the assumption that the largest number of occurrences of a symbol was the transmitted symbol. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Majority logic decodingA 5-minute orientation
- Skim a recent paper: Sneak Path-Aware Reliability-Based Iterative Majority-Logic Decoding Algorithms for LDPC Codes in ReRAM SystemsInfluential work since 2022
- Pick up a classic book: ICICS 2017The most-reprinted book on the subject
- Read the landmark paper: Iterative decoding of one-step majority logic deductible codes based on belief propagationCited 125 times
- Go sideways: Binary symmetric channelA closely related topic
- Go sideways: Locally decodable codeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Iterative decoding of one-step majority logic deductible codes based on belief propagation
Two reliability-based iterative majority-logic decoding algorithms for LDPC codes
Pseudonoise Code Acquisition Using Majority Logic Decoding
A Low Complexity Decoding Algorithm for Majority-Logic Decodable Nonbinary LDPC Codes
Error Detection in Majority Logic Decoding of Euclidean Geometry Low Density Parity Check (EG-LDPC) Codes
On majority-logic decoding for duals of primitive polynomial codes
Comparisons Between Reliability-Based Iterative Min-Sum and Majority-Logic Decoding Algorithms for LDPC Codes
On majority-logic decoding of finite geometry codes
🆕 Influential since 2022
Sneak Path-Aware Reliability-Based Iterative Majority-Logic Decoding Algorithms for LDPC Codes in ReRAM Systems
Low Complexity Majority-Logic Decoding for LDPC-Coded PNC Systems
Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties
Majority logic decoding of affine Grassmann codes over nonbinary fields
📚 Books worth reading
ICICS 2017 · 2017- 📕Tech15projects.com · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- 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…
- Repetition code In coding theory, the repetition code is one of the most basic linear error-correcting codes. In order to transmit a message over a noisy channel that…
- 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…
- Shannon's source coding theorem In information theory, Shannon's source coding theorem (or noiseless coding theorem) establishes the statistical limits to possible data compression for…
- Bit error rate In digital transmission, the number of bit errors is the number of received bits of a data stream over a communication channel that have been altered due…
- 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…
- 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…