Buscar
Mostrando ítems 1-10 de 355
Symbol-Wise Chase Decoding of q-ary Block Codes over BI-AWGN Channels
(Ieee-inst Electrical Electronics Engineers IncPiscatawayEUA, 2011)
Performance of a Simplified Soft-Distance decoding algorithm for LDPC codes over the Rayleigh fading channel
(Planta Piloto de Ingeniería Química, 2013-07)
In this paper, we investigate the performance of a Soft-Input soft-Output decoding algorithm for LDPC codes that uses Euclidean distance as its metric, in the Rayleigh fading channel. It is found that its Bit Error Rate ...
Alternant and BCH codes over certain rings
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2003-01-01)
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 ...
Alternant and BCH codes over certain rings
(Springer, 2003-01-01)
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 ...
Alternant and BCH codes over certain rings
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2003-01-01)
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 ...
Alternant and BCH codes over certain rings
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2003)
Alternant and BCH codes over certain rings
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2014)
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 ...