Buscar
Mostrando ítems 41-50 de 91425
Construction of perfect space-time codes
(2013-04-29)
In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over ℚ(ζ3), where the signal constellations are isomorphic ...
Construction of perfect space-time codes
(2013-04-29)
In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over ℚ(ζ3), where the signal constellations are isomorphic ...
Bounding the trellis state complexity of algebraic geometric codes
(SpringerNew YorkEUA, 2004)
Relating propelinear and binary G-linear codes
(Elsevier B.V., 2002-01-28)
In this paper we establish the connections between two different extensions of Z(4)-linearity for binary Hamming spaces, We present both notions - propelinearity and G-linearity - in the context of isometries and group ...
A BCH code and a sequence of cyclic codes
(2014)
This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the ...
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 ...
ANDRES BELLO AND THE JAPANESE CIVIL CODE?
(PONTIFICA UNIV CATOLICA DE CHILE FACULTAD DE DERECHO, 2012)
Although the influence of Andres Bello's Code in Latin America is completely out of question, few papers have been written on its reception out of the borders of it. This article studies the reception of some aspects of ...
Special subsets and optimum codes based on lattices and cosets
(1997-01-01)
This paper introduces the concept of special subsets when applied to generator matrices based on lattices and cosets as presented by Calder-bank and Sloane. By using the special subsets we propose a non exhaustive code ...