Live briefing
Everything about BCH code
Error correction code
In coding theory, the Bose–Chaudhuri–Hocquenghem codes form a class of cyclic error-correcting codes that are constructed using polynomials over a finite field. BCH codes were invented in 1959 by French mathematician Alexis Hocquenghem, and independently in 1960 by Raj Chandra Bose and D. K. Ray-Chaudhuri. The name Bose–Chaudhuri–Hocquenghem arises from the initials of the inventors' surnames. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: BCH codeA 5-minute orientation
- Skim a recent paper: The q -Ary Antiprimitive BCH CodesInfluential work since 2022
- Pick up a classic book: On complexity of trellis structure of linear block codesThe most-reprinted book on the subject
- Read the landmark paper: BCH convolutional codesCited 76 times
- Go sideways: Reed–Solomon error correctionA closely related topic
- Go sideways: Forney algorithmA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
BCH convolutional codes
Turbo codes extended with outer BCH code
BCH Codes with Minimum Distance Proportional to Code Length
BCH cyclic codes
Fast Blind Recognition of BCH Code Based on Spectral Analysis and Probability Statistics
On the second generalized Hamming weight of the dual code of a double-error-correcting binary BCH code
BCH Code Selection and Iterative Decoding for BCH and LDPC Concatenated Coding System
Statistical Recognition Method of Binary BCH Code
🆕 Influential since 2022
đź“š Books worth reading
- 📕On complexity of trellis structure of linear block codesLin, Shu. · 1990
- 📕Good trellises for IC implementation of Viterbi decoders for linear block codesHari T. Moorthy · 1997
- 📕Testing and performance analysis of the multichannel error correction code decoderNitin J. Soni · 1997
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- 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…
- Forney algorithm In coding theory, the Forney algorithm (or Forney's algorithm) calculates the error values at known error locations. It is used as one of the steps in…
- 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…
- Resolvent cubic In algebra, a resolvent cubic is one of several distinct, although related, cubic polynomials defined from a monic polynomial of degree four: P(x)=x4+a3x3+a2x2+…
- 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…
- Primitive polynomial (field theory) In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite field GF(pm). This means…
- Polynomial code In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length)…
- Burst error-correcting code In coding theory, burst error-correcting codes employ methods of correcting burst errors, which are errors that occur in many consecutive bits rather than…