Buscar
Mostrando ítems 1-10 de 26578
A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
(2013-09-01)
For a given binary BCH code Cn of length n = 2s-1 generated by a polynomial g(x)e{open}F2[x] of degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomial g(x1/2)e{open}F2[x1/2ℤ ≥ 0] of ...
A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
(2013-09-01)
For a given binary BCH code Cn of length n = 2s-1 generated by a polynomial g(x)e{open}F2[x] of degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomial g(x1/2)e{open}F2[x1/2ℤ ≥ 0] of ...
Novel serial code concatenation strategies for error fl oor mitigation of low-density parity-check and turbo product codesNouvelles stratégies de concaténation de codes séries pour la réduction du seuil d’erreur dans le contrôle de parité à faible densité et dans les turbo codes produits
(IEEE Canada, 2013-09)
This paper presents a novel multiple serial code concatenation (SCC) strategy to combat the error-floor problem in iterated sparse graph-based error correcting codes such as turbo product-codes (TPC) and low-density ...
Constructions of new families of nonbinary CSS codes
(Elsevier Science BvAmsterdamHolanda, 2010)
Bounding the trellis state complexity of algebraic geometric codes
(SpringerNew YorkEUA, 2004)