Now showing items 1-3 of 3
Goppa and Srivastava codes over finite rings
(Computational & Applied Mathematics, 2005-08-01) [Artigo]
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
(Computational and Applied Mathematics, 2011-08-31) [Artigo]
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 ...
CYCLIC CODES THROUGH B[X], B[X; 1/kp Z(0)] and B[X; 1/p(k) Z(0)]: A COMPARISON
(Journal of Algebra and Its Applications, 2012-08-01) [Artigo]
It is very well known that algebraic structures have valuable applications in the theory of error-correcting codes. Blake [Codes over certain rings, Inform. and Control 20 (1972) 396-404] has constructed cyclic codes over ...