Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 1,062 papers for “BCH code”
International Maritime Organization · 2009
The Code for the Construction and Equipment of Ships Carrying Dangerous Chemicals in Bulk (BCH Code) presents amendments to the Code to reflect the 2007 revision of MARPOL Annex II and other amendments related to:Survey and certificationMaterials of constructionFire protectionPersonnel protectionCertificate of fitness for the carriage of dangerous chemicals in bulk.
Cited by 0
Guojin Liu, Yanfang Zha, Hua Zhao et al. · 2010
This paper presents a new method of group counterchange of BCH code. In this method, the relationship between syndrome vector and the vector of supervision matrix is correspondence. The new method simplifies the process of BCH encoding and decoding. So it can be used in encoding and decoding information which is over K-bits. The new method not only makes the process of decoding and correcting of BCH code easier and faster, but also educes the BER (bit error rate) of system. At the same time, it can be implemented on Cyclone-III.
Cited by 1
Shan-Yuan Ho, Daniel J. Kleitman · Discrete Applied Mathematics · 2012
Cited by 3
Du Yatao, Zhi Zhong, Hailong Zhang et al. · Information Technology Journal · 2010
Cited by 3
Jiafeng Wang, Yang Yue, Jun Yao · Communications and Network · 2011
In this paper, a statistical recognition method of the binary BCH code is proposed. The method is applied to both primitive and non-primitive binary BCH code. The block length is first recognized based on the cyclic feature under the condition of the frame length known. And then candidate polynomials are achieved which meet the restrictions. Among the candidate polynomials, the most optimal polynomial is selected based on the minimum rule of the weights sum of the syndromes. Finally, the best polynomial was factorized to get the generator polynomial recognized. Simulation results show that the method has strong capability of anti-random bit error. Besides, the algorithm proposed is very simple, so it is very practical for hardware im-plementation.
Cited by 19Open access
Jiajie Huang · Journal of Physics Conference Series · 2022
Abstract In the communication field, channel coding was proposed to increase the data transmission rate and the transmitted data’s reliability. Error correction is an essential part of channel coding to improve data reliability. The Bose-Chaudhuri-Hocquenghem (BCH) code is one of the most efficient error-correcting codes. In this paper, a BCH coding method, and several methods to implement BCH decoding are introduced, and these decoding methods are compared with each other. Based on the principles of BCH codes, this study addresses two factors that may impact the performance of BCH codes, the redundancy bit length, and the minimum distance, as well as the relationship between them. This paper composes four flow charts and investigates the redundant bit lengths and minimum distances that may affect the performance of BCH codes during transmission. This paper is potentially beneficial for more extensive applications of BCH codes such as magnetic, optical storage systems, and new generations’ digital communication systems.
Cited by 1Open access
Minseo Kim, Jongsun Park · 2022 19th International SoC Design Conference (ISOCC) · 2022
With the aggressive scaling of DRAM process technology, the reliability degradation has become a critical issue, which inevitably increases the demand for more powerful error correction code (ECC) than conventional Hamming code. Although double error correction (DEC) BCH code needs less parity bits than other DEC codes, it cannot detect the errors larger than 3 bits. In this paper, we present a novel BCH code combined with cyclic redundancy check (CRC) code which can effectively detect multi-bit errors. By employing the CRC code, the proposed BCH code corrects double errors with a 3-bit error detection probability of 84%. In addition, by reusing the BCH encoder as CRC encoder and decoder in the proposed BCH, the area overhead of the proposed BCH is only 7.8<sup>%</sup> compared to the conventional BCH code.
Cited by 3
Toshinobu Kaneko · The Journal of the Institute of Television Engineers of Japan · 1991
0)a1,a2,
Cited by 0Open access
Mat Zali, Saliba · UTPedia (Universiti Teknologi Petronas) · 2009
In digital world, all information is in term of 0 and 1. Even the information such as sound, video, graphic or text is in term of 0 and 1. If the information is transmitting through a noisy channel, there is a risk for error to occur. Error correcting code was invented to solve this problem. For this project, the performance evaluation between Low Density Parity Check (LDPC) and Bode-Chaudhuri-Hocquenghem (BCH) in wireless channel is presented. The Addictive White Gaussian Channel (AWGN) is used to represent the wireless channel. A black and white image was used as the data. Peak Signal to Noise Ratio (PSNR) was used to measure the quality of the reconstructed image. If the PSNR value is between 30 dB and 50 dB, the quality of the output image is considered good. As the PSNR value increases, the quality of output image gets better.
Cited by 0
Wei Wang · Advances in intelligent and soft computing · 2012
Cited by 1
Javier Cuevas Ordaz, Patrick Adde, Sylvie Kerouédan et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2003
International audience
Cited by 2
Tariq Shah, Mubashar Khan, Antonio Aparecido de Andrade · International Journal of Algebra · 2014
This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has length 2m−1(n + 1)n and is generated by a generalized polynomial g(x 1 2m ) ∈ F2[x, 1 2m Z≥0] of degree 2mr. Furthermore, C0 n is embedded in Cm 2m−1(n+1)n and Cm 2m−1(n+1)n is embedded in Cm+1 2m(n+1)n for each m ≥ 1. By a newly proposed algorithm, codewords of the binary BCH code C0 n can be transmitted with high code rate and decoded by the decoder of any member of the family {Cm 2m−1(n+1)n}m≥1 of binary cyclic codes, having the same code rate.
Cited by 0Open access
Satoshi Noguchi, Xiao‐Nan Lu, Masakazu Jimbo et al. · SIAM Journal on Discrete Mathematics · 2021
BCH codes are among the best practical cyclic codes widely used in consumer electronics, communication systems, and storage devices. However, not much is known about BCH codes with large minimum distance. In this paper, we consider narrow-sense BCH codes of length $n = \frac{q^m-1}{N}$ with designed distance $\delta = \frac{s}{q-1}n$ proportional to $n$, where $N$ divides $\frac{q^m-1}{q-1}$ and $1 \le s \le q-1$. We determine both their dimensions and minimum distances. In particular, when $N=1$, the codes are primitive, with minimum distance $d=\frac{s}{q-1}(q^m-1)$ and dimension $k = (q-s)^m$. The general result on code dimensions is achieved by applying generating functions and inverse discrete Fourier transforms to an enumeration problem.
Cited by 21
Qi Xing Shang, Cong Zhang · Advanced materials research · 2014
This paper mainly introduces the basic principles of BCH code, which is a type of error control codes. The error control system is an important method to improve the communication transmission system. Communication system that containing BPSK modulation is built by MATLAB and through simulating and analyzing the performance of BCH communication systems, it was discovered that the BCH code transmission characteristic has significant gain. This paper provides the theory basis for the projects that contain BCH code.
Cited by 0
Ruixue Wang, Haiyang Qin, Xuena Zheng et al. · Third International Symposium on Computer Engineering and Intelligent Communications (ISCEIC 2022) · 2023
This paper describes a scheme for the ECC Error Correction IP. The common circuit is extracted based on the traditional BCH (Bose, Ray-Chaudhuri, Hocquenghem) codes innovatively, which make the logic gate requirement reduced by 33%; at the same time, the interleaving idea is used for multi-channel ECC error correction, which can correct 4-bit adjacent errors at most; the p-channel parallel chien search circuit is used to replace the serial search circuit to reduce the error correction delay; the time-sharing error correction makes the reading and writing transparent to ECC error correction process. The simulation and tape show that the design can effectively ensure the correctness of DRAM internal data without affecting its access speed.
Cited by 0Open access
Lijuan XING, Zhuo LI · SHILAP Revista de lepidopterología · 2021
Quantum-error-correcting code can overcome quantum decoherence efficiently, which is the key technology to realize quantum computers.A series of quantum BCH code was proposed based on classical codes.First, a general way of well-chosen cyclotomic coset was introduced.A sufficient condition was given to calculate the number of elements in cyclotomic coset.Then, a series of quantum BCH (Bose-Chaudhuri-Hocquenghem) code over finite field F<sub>q</sub> was constructed by CSS (Calderbank-Shor-Steane) construction and Steane construction.The results were extended to finite field F<sub>q</sub><sup>2</sup> with Hermitian construction.Compared with the results in literature,the range of introduced cyclotomic coset is more wide, and the new quantum BCH code has higher dimensions and better lower bounds on minimum distances.Furthermore, a family of quantum maximum distance separable (quantum MDS) code over any finite fields is constructed.
Cited by 0Open access
Evgeniy A. Mytsko, Andrey N. Malchukov, I. Novogilov et al. · 2016
Fast decoder of BCH code (31, 16, 7) which based on matrix algorithm of syndromes computation and parallel data processing was developed. Functional blocks of developed device based on block-based design were described. Device testing with coding and decoding modes and 50 MHz frequency was conducted.
Cited by 1
Irma Safitri, Rizki Rivai Ginanjar, Yosa Yunawan · 2019
Cited by 1Open access
Al-Qudah, Muhammed · OpenMETU (Middle East Technical University) · 2019
Cited by 0
Shinfeng D. Lin, Shicheng Liu · 2004
In this article, a BCH code-based audio watermarking approach performed in the cepstrum domain is proposed. The technique takes advantage of the attack-invariant feature of the cepstrum domain and the error-correction capability of BCH code to increase the robustness of audio watermarking. In addition, the watermarked audio has very high perceptual quality. A blind watermark detection technique is developed to identify the embedded watermark under various types of attacks. Experiment results demonstrate that the proposed technique outperforms the existing audio watermarking techniques against most of the asynchronous attacks.
Cited by 1