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.
2022
2022
Biometric verification of humans by means of hand geometry
  • M. Faúndez-Zanuy
  • Proceedings 39th Annual International Carnahan…
  • 2022
  • Corpus ID: 18935170
This paper describes a hand geometry biometric identification system. We have acquired a database of 22 people, 10 acquisitions… 
Highly Cited
2011
Highly Cited
2011
Near Shannon Limit and Low Peak to Average Power Ratio Turbo Block Coded OFDM
In this paper, we present an advanced solution for the long standing problem of large peak to average power ratio (PAPR) in… 
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
2007
Highly Cited
2007
An Analytical Model for Energy Efficiency of Error Control Schemes in Sensor Networks
This paper analyzes the energy efficiency of wireless sensor networks using different error control schemes. An analytical model… 
2002
2002
Structural characterisation, EPR and magnetic properties of f–f and f–d lanthanide(III) phenolic cryptates
The Schiff base axial macrobicyclic ligand L1 forms 4f–4f and 4f–3d cryptates with formula [Gd2(L1 − 3H)(NO3)2](NO3)·1.5H2O (1… 
1999
1999
New serial architecture for the Berlekamp-Massey algorithm
We propose a new efficient serial architecture to implement the Berlekamp-Massey (1968, 1969) algorithm, which is frequently used… 
1998
1998
Construction of digital nets from BCH -codes
We establish a link between the theory of error-correcting codes and the theory of (t, m, s)-nets. This leads to the fundamental… 
1971
1971
Coding Theory and the Mathieu Groups
1971
1971
Decoding beyond the BCH bound
Abstraci-In this correspondence, a decoding algorithm to decode beyond the BCH bound is introduced. It gives a complete minimum… 
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)