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)

Related topics

Related topics

36 relations
Alternant codeBerlekamp–Massey algorithmBerlekamp–Welch algorithmBlock code

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Lossless Image Compression Technique Using Combination Methods
The development of multimedia and digital imaging has led to high quantity of data required to represent modern imagery. This… 
2009
2009
Improving the distance properties of turbo codes using a third component code: 3D turbo codes - [transactions letters]
Thanks to the probabilistic message passing performed between its component decoders, a turbo decoder is able to provide strong… 
Highly Cited
2007
Highly Cited
2007
Understanding paramagnetic relaxation phenomena for water-soluble gadofullerenes
Water-soluble, endohedral gadofullerenes exhibit considerably higher relaxivities than clinically used Gd3+-chelates and are… 
Highly Cited
2006
Highly Cited
2006
Road-Junction Traffic Signal Timing Optimization by an adaptive Particle Swarm Algorithm
The purpose of this paper is to investigate the application of particle swarm optimization (PSO) algorithm in solving the traffic… 
Highly Cited
2003
Highly Cited
2003
Low-density parity check codes and iterative decoding for long-haul optical communication systems
A forward-error correction (FEC) scheme based on low-density parity check (LDPC) codes and iterative decoding using belief… 
Highly Cited
2001
Highly Cited
2001
Error-resilient coding of 3-D graphic models via adaptive mesh segmentation
Current coding techniques for 3-D graphic models mainly focus on coding efficiency, which makes them extremely sensitive to… 
Highly Cited
1993
Highly Cited
1993
A New Procedure for Decoding Cyclic and Bch Codes Up to Actual Minimum Distance
  • G. FengK. Tzeng
  • Proceedings. IEEE International Symposium on…
  • 1993
  • Corpus ID: 8850472
In this paper, a new procedure for decoding cyclic and BCH codes up to their actual minimum distance is presented. Previous… 
Highly Cited
1983
Highly Cited
1983
MacPitts: An Approach to Silicon Compilation
S ilrCon collpilat ionl a ncsw techniclue 1'o0 integratecd i.li t CeIsi11 that hats I-CCCIetlV Undercrone initeinsc dcclo0n1vtC… 
1973
1973
Shortened BCH codes (Corresp.)
By shortening certain binary primitive BCH codes, we derive a number of linear error-correcting codes with minimum distances… 
Highly Cited
1965
Highly Cited
1965
On decoding binary Bose-Chadhuri- Hocquenghem codes
The solution of Newton's identities over a field of characteristic two is the key step in decoding Bose-Chaudhuri-Hocquenghem… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)