Uma construção de códigos BCH

Um código BCH C (respectivamente, um código BCH C 0 ) de comprimento n sobre o anel local Zp k (respectivamente, sobre o corpo Zp) é um ideal no anel Zpk [X] (Xn−1) (respectivamente, no anel Zp[X] (Xn−1) ), que ´e gerado por um polinômio mônico que divide Xn−1. Shankar [1] mostrou que as raízes de Xn−1 são as unidades do anel de Galois GR(p k , s) (respectivamente, corpo de Galois GF(p, s)) que é uma extensão do anel Zp k (respectivamente, do corpo Zp), onde s é o grau de um polinômio irredutível f(X) ∈ Zp k [X]. Neste estudo, assumimos que para si = b i , onde b é um primo e i é um inteiro não negativo tal que 0 ≤ i ≤ t, existem extensões de anéis de Galois correspondentes GR(p k , si) (respectivamente, extensões do corpo de Galois GF(p, si)) do anel Zp k (respectivamente, do corpo Zp). Assim, si = b i para i = 2 ou si = b i para i > 2. De modo análogo a [1], neste trabalho, apresentamos uma sequência de códigos BCH C0, C1, · · · , Ct−1C sobre Zp k de comprimentos n0, n1, · · · , nt−1, nt , e uma sequência de códigos BCH C 0 0 , C0 1 , · · · , C0 t−1 , C0 sobre Zp de comprimentos n0, n1, · · · , nt−1, nt , onde cada ni divide p si − 1. Palavras Chave: Anel de Galois, corpo de Galois, código BCH.

On BCH codes over arbitrary integer rings

Bose-C-Hocquenghem (BCH) atdes with symbols from an arbitrary fhite integer ring are derived in terms of their generator polynomials. The derivation is based on the factohation of x to the power (n) - 1 over the unit ring of an appropriate extension of the fiite integer ring. lke eomtruetion is thus shown to be similar to that for BCH codes over fink flelda.

The chemical resolution of racemic cis-2-hydroxymethyl-5(cytosine-1 '-yl)-1,3-oxathiolane (BCH-189)-one direct method to obtain lamivudine as anti-HIV and anti-HBV agent

Racemic cis-BCH-189 can be resolved to (-)-enantiomer (lamivudine) and (+)-enantiomer by esterification of cis-2-hydroxymethyl-5-(N-4(')-acetylcytosine-1'-yl)-1,3-oxathiolane and (+)-menthyl chloroformate in CH3CN with pyridine as base. The two diastereomers of ester were seperated by recrystallization in methanol at 0degreesC. Lamivudine was obtained by deprotection of (-)-diastereomer with high yield.

Synthesis of cis-(+/-)-2-hydroxymethyl-5-(cytosine-1 '-yl)-1,3-oxathiolane (BCH-189)

The target compound BCH-189 was synthesized with high yield via four steps from benzoyloxy acetylaldehyde and p-dithiane-2,5-diol as starting materials. The synthetic route is preferable to what literature reported.

Alternant and BCH codes over certain rings

Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms of parity-check matrices. The derivation is based on the factorization of x s - 1 over the unit group of an appropriate extension of the finite ring. An efficient decoding procedure which makes use of the modified Berlekamp-Massey algorithm to correct errors and erasures is presented. Furthermore, we address the construction of BCH codes over Zm under Lee metric.

Construction and decoding of BCH codes over finite commutative rings

BCH codes over arbitrary finite commutative rings with identity are derived in terms of their locator vector. The derivation is based on the factorization of xs -1 over the unit ring of an appropriate extension of the finite ring. We present an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, for these codes. The code construction and the decoding procedures are very similar to the BCH codes over finite integer rings. © 1999 Elsevier B.V. All rights reserved.

A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A BCH code and a sequence of cyclic codes

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.

Construction and decoding of BCH codes over chain of commutative rings

In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for a nonnegative integer t, let A0 ⊂ A1 ⊂···⊂ At−1 ⊂ At be a chain of unitary commutative rings, where each Ai is constructed by the direct product of appropriate Galois rings, and its projection to the fields is K0 ⊂ K1 ⊂···⊂ Kt−1 ⊂ Kt (another chain of unitary commutative rings), where each Ki is made by the direct product of corresponding residue fields of given Galois rings. Also, A∗ i and K∗ i are the groups of units of Ai and Ki, respectively. This correspondence presents a construction technique of generator polynomials of the sequence of Bose, Chaudhuri, and Hocquenghem (BCH) codes possessing entries from A∗ i and K∗ i for each i, where 0 ≤ i ≤ t. By the construction of BCH codes, we are confined to get the best code rate and error correction capability; however, the proposed contribution offers a choice to opt a worthy BCH code concerning code rate and error correction capability. In the second phase, we extend the modified Berlekamp-Massey algorithm for the above chains of unitary commutative local rings in such a way that the error will be corrected of the sequences of codewords from the sequences of BCH codes at once. This process is not much different than the original one, but it deals a sequence of codewords from the sequence of codes over the chain of Galois rings.

Simulación en ordenadores de una cadena completa de transmisión de mensajes binarios en códigos BCH, con decodificación para corrección de errores múltiples

La finalidad última do codificación y decodificación es conseguir que el mensaje reconstituido sea idéntico al original. Sin la teoría de códigos los mensajes binarios se caracterizan por vectores o también por polinomios con coeficientes pertenecientes al cuerpo dé Galois GF [0,l]. Sobre los conceptos de código, código lineal, código cíclico,generación polinómica de códigos, distancia, síndrome, relaciones con los elementos de un cuerpo finito, detección y corrección, etc., el mejor autor de referencia sigue siendo Peterson

Interleavers and BCH codes for coherent DQPSK systems with laser phase noise

The relatively high phase noise of coherent optical systems poses unique challenges for forward error correction (FEC). In this letter, we propose a novel semianalytical method for selecting combinations of interleaver lengths and binary Bose-Chaudhuri-Hocquenghem (BCH) codes that meet a target post-FEC bit error rate (BER). Our method requires only short pre-FEC simulations, based on which we design interleavers and codes analytically. It is applicable to pre-FEC BER ∼10-3, and any post-FEC BER. In addition, we show that there is a tradeoff between code overhead and interleaver delay. Finally, for a target of 10-5, numerical simulations show that interleaver-code combinations selected using our method have post-FEC BER around 2× target. The target BER is achieved with 0.1 dB extra signal-to-noise ratio.

Dimensioning BCH codes for coherent DQPSK systems with laser phase noise and cycle slips

Forward error correction (FEC) plays a vital role in coherent optical systems employing multi-level modulation. However, much of coding theory assumes that additive white Gaussian noise (AWGN) is dominant, whereas coherent optical systems have significant phase noise (PN) in addition to AWGN. This changes the error statistics and impacts FEC performance. In this paper, we propose a novel semianalytical method for dimensioning binary Bose-Chaudhuri-Hocquenghem (BCH) codes for systems with PN. Our method involves extracting statistics from pre-FEC bit error rate (BER) simulations. We use these statistics to parameterize a bivariate binomial model that describes the distribution of bit errors. In this way, we relate pre-FEC statistics to post-FEC BER and BCH codes. Our method is applicable to pre-FEC BER around 10-3 and any post-FEC BER. Using numerical simulations, we evaluate the accuracy of our approach for a target post-FEC BER of 10-5. Codes dimensioned with our bivariate binomial model meet the target within 0.2-dB signal-to-noise ratio.