Buscar
Mostrando ítems 1-10 de 91425
A formalized optimum code search for q-ary trellis codes
(Institute of Electrical and Electronics Engineers (IEEE), 1997-01-01)
This paper gives a formalization for q-ary codes of the search algorithm [3] for optimum codes based on lattices and cosets [1]. With a more efficient and an automated algorithm it also has been possible to extend the ...
Encoding through generalized polynomial codes
(2011-08-31)
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 ...
Encoding through generalized polynomial codes
(2011-08-31)
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 ...
Quantum Error-correcting Codes From Algebraic Geometry Codes Of Castle Type
(SpringerNew York, 2016)
Cyclic codes through B[X;(a/b)Z_0, with (a/b) in Q^{+} and b=a+1, and Encoding
(2012)
Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and is the monoid S such that b = a + 1, where a is any positive integer. In this paper we constructed cyclic codes, BCH codes, alternant codes, ...
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 ...
Graphs, tessellations, and perfect codes on flat tori
(Ieee-inst Electrical Electronics Engineers IncPiscatawayEUA, 2004)
Efficient utilization of various network coding techniques in different wireless scenarios
(Springer Verlag, 2015)