Advanced search
Start date
Betweenand


Goppa and Srivastava codes over finite rings

Full text
Author(s):
de Andrade, Antonio Aparecido ; Palazzo, Reginaldo, Jr.
Total Authors: 2
Document type: Journal article
Source: COMPUTATIONAL & APPLIED MATHEMATICS; v. 24, n. 2, p. 14-pg., 2005-01-01.
Abstract

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, is proposed for Goppa codes. (AU)

FAPESP's process: 02/07473-7 - Geometrically uniform codes in homogeneous spaces
Grantee:Sueli Irene Rodrigues Costa
Support Opportunities: Research Projects - Thematic Grants