Everything about Forney algorithm

🧭 Start here: a 6-step reading path

1. Read the overview: Forney algorithmA 5-minute orientation
2. Pick up a classic book: Codes, graphs, and systemsThe most-reprinted book on the subject
3. Go sideways: BCH codeA closely related topic
4. Go sideways: Reed–Solomon error correctionA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

• Codes, graphs, and systemsG. David Forney, Richard E. Blahut · 2002

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• BCH code In coding theory, the Bose–Chaudhuri–Hocquenghem codes (BCH codes) form a class of cyclic error-correcting codes that are constructed using polynomials…
• Reed–Solomon error correction In information theory and coding theory, Reed–Solomon codes are a group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomon…
• Chien search In abstract algebra, the Chien search, named after Robert Tienwen Chien, is a fast algorithm for determining roots of polynomials defined over a finite…
• Cyclic code In coding theory, a cyclic code is a block code, where the circular shifts of each codeword gives another word that belongs to the code. They are error-correcti…
• Berlekamp–Massey algorithm The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear-feedback shift register (LFSR) for a given binary output sequence. The…
• 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…
• Quantum Fourier transform In quantum computing, the quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier…
• Fictitious domain method In numerical analysis, the fictitious domain method (FD) is a numerical technique designed to solve partial differential equations on complex geometries…