Buscar
Mostrando ítems 1-10 de 92
Goppa and Srivastava codes over finite rings
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2005-08-01)
Goppa and Srivastava codes over arbitrary local finite commutative rings with identity are constructed in terms of parity-cleck matrices. An efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, ...
Goppa and Srivastava codes over finite rings
(2005-01-01)
Goppa and Srivastava codes over arbitrary local finite commutative rings with identity are constructed in terms of parity-cleck matrices. An efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, ...
Goppa and Srivastava codes over finite rings
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2005-08-01)
Goppa and Srivastava codes over arbitrary local finite commutative rings with identity are constructed in terms of parity-cleck matrices. An efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, ...
Goppa and Srivastava codes over finite rings
(Springer, 2005-01-01)
Goppa and Srivastava codes over arbitrary local finite commutative rings with identity are constructed in terms of parity-cleck matrices. An efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, ...
Encoding through generalized polynomial codes
(2011-08-31)
This paper introduces novel constructions of cyclic codes using semigroup rings instead of polynomial rings. These constructions are applied to define and investigate the BCH, alternant, Goppa, and Srivastava codes. This ...
Encoding through generalized polynomial codes
(2011-08-31)
This paper introduces novel constructions of cyclic codes using semigroup rings instead of polynomial rings. These constructions are applied to define and investigate the BCH, alternant, Goppa, and Srivastava codes. This ...
Goppa and Srivastava codes over finite rings
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2005)
Goppa and Srivastava codes over finite rings
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2014)
A Note on Linear Codes over Semigroup Rings
(2011)
In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes through the semigroup ring B[X; 1 3Z0] instead of the polynomial ring B[X; Z0], where B is a finite commutative ring with ...