Buscar
Mostrando ítems 1-10 de 7149
Efficient utilization of various network coding techniques in different wireless scenarios
(Springer Verlag, 2015)
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 ...
A formalized optimum code search for q-ary trellis codes
(Institute of Electrical and Electronics Engineers (IEEE), 2014)
A formalized optimum code search for q-ary trellis codes
(Institute of Electrical and Electronics Engineers (IEEE), 2014)
An alternative non-cooperative transmission scheme based on coded redundant information
(IEEE, 2017)
Some of the future wireless networks are related tothe provision of higher data rates and lower energy consumption.In contrast to the clear increasing spectrum demand, bandwidthis a limited resource. Cooperative ...
Hamming and Reed-Solomon codes over certain rings
(Springer, 2001-01-01)
In this work we present extensions of constructions of Hamming and Reed-Solomon codes over local finite commutative rings with identity obtained from algebraic integer rings of a number field. Also, we present efficient ...
Hamming and Reed-Solomon codes over certain rings
(Springer, 2001-01-01)
In this work we present extensions of constructions of Hamming and Reed-Solomon codes over local finite commutative rings with identity obtained from algebraic integer rings of a number field. Also, we present efficient ...
Goppa and Srivastava codes over finite rings
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2005-08-01)
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, ...