Skip to search formSkip to main contentSkip to account menu

BCH code

Known as: Bose-Chadhuri-Hocquenghem Codes, Bose-Chaudhuri-Hocquenghem, BCH 
In coding theory, the BCH codes form a class of cyclic error-correcting codes that are constructed using finite fields. BCH codes were invented in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
—We describe a novel and efficient method to reliably provision and re-generate a finite and exact sequence of bits, for use with… 
2009
2009
Thanks to the probabilistic message passing performed between its component decoders, a turbo decoder is able to provide strong… 
2004
2004
-The decoding capabilities of algebraic algorithms, mainly the Berlekamp-Massey algorithm, the Euclidean algorithm and our… 
2002
2002
We give a simplified and self-contained treatment of the theory of BCH−codes. This allows us to make use of various recursive… 
1997
1997
We present a simple method to improve the performance of turbo codes. Distance spectrum analysis is used to identify information… 
1974
1974
By the use of abstract Fourier analysis on groups, the optimum mean-square-error decoding rule is developed for a fixed block… 
1971
1971
Abstraci-In this correspondence, a decoding algorithm to decode beyond the BCH bound is introduced. It gives a complete minimum…