Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,930,629 papers from all fields of science
Search
Sign In
Create Free Account
BCH code
Known as:
Bose-Chadhuri-Hocquenghem Codes
, Bose-Chaudhuri-Hocquenghem
, BCH
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
Alternant code
Berlekamp–Massey algorithm
Berlekamp–Welch algorithm
Block code
Expand
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…
Expand
Review
2013
Review
2013
Perspectives on ancient Greece : papers in celebration of the 60th anniversary of the Swedish Institute at Athens
Ann-Louise Schallin
2013
Corpus ID: 84831796
During the Norwegian-Greek excavations below the Classical temple of Athena Alea at Tegea in 1990– 1994, strata belonging to…
Expand
2009
2009
Improving the distance properties of turbo codes using a third component code: 3D turbo codes - [transactions letters]
C. Berrou
,
A. G. Amat
,
Youssouf Ould-Cheikh-Mouhamedou
,
Y. Saouter
IEEE Transactions on Communications
2009
Corpus ID: 7833271
Thanks to the probabilistic message passing performed between its component decoders, a turbo decoder is able to provide strong…
Expand
Highly Cited
2007
Highly Cited
2007
Understanding paramagnetic relaxation phenomena for water-soluble gadofullerenes
S. Laus
,
B. Sitharaman
,
+4 authors
A. Merbach
2007
Corpus ID: 12651621
Water-soluble, endohedral gadofullerenes exhibit considerably higher relaxivities than clinically used Gd3+-chelates and are…
Expand
2004
2004
Decoding Cyclic and BCH Codes up to Actual Minimum Distance Using Nonrecurrent Syndrome Dependence Relations
Cui-Liang Feng
,
S. M. I. Kenneth K. Tzeng
2004
Corpus ID: 385532
-The decoding capabilities of algebraic algorithms, mainly the Berlekamp-Massey algorithm, the Euclidean algorithm and our…
Expand
1997
1997
Application of Distance Spectrum Analysis to Turbo Code Performance Improvement
M. Oberg
,
P. Siegel
1997
Corpus ID: 13917031
We present a simple method to improve the performance of turbo codes. Distance spectrum analysis is used to identify information…
Expand
1996
1996
IDEALS AND FILTERS IN BCH-ALGEBRAS
C. M. Anwar
,
F. Hafiz
1996
Corpus ID: 116436294
1974
1974
The optimum mean-square estimate for decoding binary block codes
G. A. Wolf
,
G. Redinbo
IEEE Transactions on Information Theory
1974
Corpus ID: 7571175
By the use of abstract Fourier analysis on groups, the optimum mean-square-error decoding rule is developed for a fixed block…
Expand
1971
1971
Decoding beyond the BCH bound
C. Hartmann
1971
Corpus ID: 206731169
Abstraci-In this correspondence, a decoding algorithm to decode beyond the BCH bound is introduced. It gives a complete minimum…
Expand
1969
1969
Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)
R. Chien
,
B. Cunningham
,
I. B. Oldham
IEEE Transactions on Information Theory
1969
Corpus ID: 7694484