Topic
BCH code
About: BCH code is a research topic. Over the lifetime, 3081 publications have been published within this topic receiving 51294 citations. The topic is also known as: Bose–Chaudhuri–Hocquenghem codes & Bose-Chaudhuri-Hocquenghem codes.
Papers published on a yearly basis
Papers
More filters
Patent•
15 Jun 2011
TL;DR: In this article, a BCH code decoding method was proposed to promote power saving during decoding process of BCH codes in an optical communication field, where a plurality of error syndromes were calculated which correspond to continuous n([(d-1)/2]≤n≤d-2)) roots α, α,......, α(l≤u≤l+l+d-3, l≥u+n-1/n+n+d+d−2), α(d≥3) of a primitive element α
Abstract: PROBLEM TO BE SOLVED: To promote power saving during decoding process of a BCH code in an optical communication field.SOLUTION: Relating to a BCH code decoding method for a BCH code generated by a generating polynomial of GF(q) whose root is power α, α, α, ......, α(d≥3) of a primitive element α of GF(q), a plurality of error syndromes are calculated which correspond to continuous n([(d-1)/2]≤n≤(d-2)) roots α, α, ......, α(l≤u≤l+d-2, l≤u+n-1≤l+d-2). It is determined whether or not every one of the plurality of error syndromes is value "0". When its determination result is false, it is determined that there is an error in receiving words of BCH code, and a predetermined error correction process is performed. If the determination result is true, a non-error correction process is performed in which no error correction is performed.
24 May 2022
TL;DR: In this article , the authors proposed a blind estimation algorithm to estimate the codeword length, code dimension and generator polynomial of Bose-Chaudhuri-Hocquenghem (BCH) codes at the receiver over erroneous channel conditions assuming a non-cooperative scenario.
Abstract: Channel coding improves the error performance of digital communication systems. Blind parameter estimation of channel codes plays an important role in military communication systems. Further, it also provides some additional advantages in adaptive modulation and coding (AMC)-based systems, re- configurable receiver systems, etc. In this paper, we propose blind estimation algorithms to estimate the codeword length, code dimension, and generator polynomial of Bose-Chaudhuri- Hocquenghem (BCH) codes at the receiver over erroneous channel conditions assuming a non-cooperative scenario. The simulations are carried out on many test cases to validate the proposed blind estimation algorithms and the results are given to testify the algorithms. We infer that the probability of correct estimation of parameters increases with decrease in codeword length. Finally, it is also inferred that the proposed algorithm performs better than the existing algorithms reported in the literature.
TL;DR: In this article , an enhanced anchor decoding (AD) algorithm for staircase codes with hard reliability scores (HRSs) is proposed, which is based on the decoding results of the iterative bounded distance decoding (BDD) to assign the HRSs.
Abstract: In this letter, we propose an enhanced anchor decoding (AD) algorithm for staircase codes with hard reliability scores (HRSs). We use the following two observations on the decoding results of the iterative bounded distance decoding (BDD) to assign the HRSs. Firstly, the miscorrection probability increases with the number of erroneous bits detected by the BDD. Secondly, the miscorrection probability of an anchor is low when the affected codewords due to error corrections of this anchor are also anchors. Most miscorrections can be reliably detected and prevented by using HRSs. The simulation results show that, for a staircase code based on the two-error-correcting Bose-Chaudhuri-Hocquenghem (BCH) code, the enhanced AD algorithm performs 0.11 dB better than the AD algorithm at a bit error rate of 10−7.
TL;DR: In this paper , the authors considered the theory of the Gaussian field and extension field, and provided a comprehensive construction scheme for BCH codes over Gaussian fields, which achieved a better code rate and the number of code words.
Abstract: In this article, first we deliberate the theory of the Gaussian field and extension field of the Gaussian field. However, in the second phase, we provide a comprehensive construction scheme for BCH codes over the Gaussian field. The decoding of newly designed BCH codes is handled through a slightly amended modified Berlekamp-Massey algorithm. The coding gain is obtained by BCH codes over the Gaussian field. Accordingly, a better code rate and the number of code words are obtained as compared to the BCH codes over finite fields. Thus, this makes them a promising candidate for use in communication systems.
TL;DR: In this paper , a novel method of spectral decoding for systematic BCH codes has been proposed, which has a simple description and a small computational complexity, and has been shown to be efficient in many applications.
Abstract: A novel method of spectral decoding for systematic BCH codes has been proposed. This method has a simple description and a small computational complexity.