Buscar
Mostrando ítems 1-10 de 35
Goppa codes through polynomials of B[X;(1/2^2)Z_0] and its decoding principle
(2011)
In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight ...
Hamming and Reed-Solomon codes over certain rings
(Springer, 2001-01-01)
In this work we present extensions of constructions of Hamming and Reed-Solomon codes over local finite commutative rings with identity obtained from algebraic integer rings of a number field. Also, we present efficient ...
Construction and decoding of BCH codes over finite commutative rings
(1999-01-01)
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 ...
Hamming and Reed-Solomon codes over certain rings
(Springer, 2001-01-01)
In this work we present extensions of constructions of Hamming and Reed-Solomon codes over local finite commutative rings with identity obtained from algebraic integer rings of a number field. Also, we present efficient ...
Construction and decoding of BCH codes over finite commutative rings
(1999-01-01)
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 ...
Constructions and decoding of a sequence of BCH codes
(2012-01-01)
The BCH code C (respectively, C) of length n over a local ring Z pk (respectively, ℤp) is an ideal in the ring (Equation Presented) (respectively, (Equation Presented) which is generated by a monic polynomial that divides ...
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 ...