Buscar
Mostrando ítems 1-10 de 151
A decoding procedure which improves code rate and error corrections
(2012)
Corresponding to $C_{0}[n,n-r]$, a binary cyclic code generated by a primitive irreducible polynomial $p(X)\in \mathbb{F}_{2}[X]$ of degree $r=2b$, where $b\in \mathbb{Z}^{+}$, we can constitute a binary cyclic code ...
Lattice constellations and codes from quadratic number fields
(2001-05-01)
We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a ...
Lattice constellations and codes from quadratic number fields
(2001-05-01)
We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a ...
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 ...