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.
2019
2019
A Class of Narrow-Sense BCH Codes
BCH codes are an important class of cyclic codes which have applications in satellite communications, DVDs, disk drives, and two… 
2018
2018
Parameters of LCD BCH codes with two lengths
In this paper, we study LCD BCH codes over the finite field GF \begin{document}$(q)$\end{document} with two types of lengths… 
Highly Cited
2016
Highly Cited
2016
Two Families of LCD BCH Codes
Historically, LCD cyclic codes were referred to as reversible cyclic codes, which had applications in data storage. Due to a… 
Highly Cited
2016
Highly Cited
2016
Multiple watermarking technique for securing online social network contents using Back Propagation Neural Network
Highly Cited
2009
Highly Cited
2009
Fast BCH Syndrome Coding for Steganography
This paper presents an improved data hiding technique based on BCH (n,k,t) syndrome coding. The proposed data hiding method… 
Highly Cited
2006
Highly Cited
2006
A 4Gb 2b/cell NAND Flash Memory with Embedded 5b BCH ECC for 36MB/s System Read Throughput
A 4Gb 2b/cell NAND flash memory designed in a 90nm CMOS technology incorporates a 25MHz BCH ECC architecture, correcting up to 5… 
Highly Cited
2003
Highly Cited
2003
A New Algorithm for Decoding Reed-Solomon Codes
A new algorithm is developed for decoding Reed-Solomon codes. It uses fast Fourier transforms and computes the message symbols… 
1990
1990
On a class of primitive BCH-codes
The author introduces a special class of primitive BCH codes, the minimal BCH (MB) codes. It is proved that an MB code has as… 
Highly Cited
1975
Highly Cited
1975
The algebraic decoding of Goppa codes
An interesting class of linear error-correcting codes has been found by Goppa [3], [4]. This paper presents algebraic decoding… 
Highly Cited
1972
Highly Cited
1972
Generalizations of the BCH Bound
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)