Buscar
Mostrando ítems 1-10 de 9871
Graphs, tessellations, and perfect codes on flat tori
(Ieee-inst Electrical Electronics Engineers IncPiscatawayEUA, 2004)
Linear codes over finite local rings in a chain
(2012)
For a positive integer $t$, let \begin{equation*} \begin{array}{ccccccccc} (\mathcal{A}_{0},\mathcal{M}_{0}) & \subseteq & (\mathcal{A}_{1},\mathcal{M}_{1}) & \subseteq & & \subseteq & (\mathcal{A}_{t-1},\mathcal{M}_{t-1}) ...
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 ...
Efficient utilization of various network coding techniques in different wireless scenarios
(Springer Verlag, 2015)
Constructions of new families of nonbinary CSS codes
(Elsevier Science BvAmsterdamHolanda, 2010)
A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
(2013-09-01)
For a given binary BCH code Cn of length n = 2s-1 generated by a polynomial g(x)e{open}F2[x] of degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomial g(x1/2)e{open}F2[x1/2ℤ ≥ 0] of ...
A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
(2013-09-01)
For a given binary BCH code Cn of length n = 2s-1 generated by a polynomial g(x)e{open}F2[x] of degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomial g(x1/2)e{open}F2[x1/2ℤ ≥ 0] of ...
Commutative group codes in R4, R6, R8 and R16-Approaching the bound
(2013-05-10)
Spherical codes in even dimensions n = 2m generated by a commutative group of orthogonal matrices can be determined by a quotient of m-dimensional lattices when the sublattice has an orthogonal basis. We discuss here the ...