- Full text PDF available (2)
We give a short survey of several techniques to construct codes on GF(q) that approach the capacity of the q-ary symmetric channel. The q-ary symmetric channel represents the next level of difficulty after the binary erasure channel (BEC). Since the channel is more complex than the BEC, one may hope that codes and decoding algorithms that approach the… (More)
Recently an increasing amount of research is devoted to the question of how the most influential nodes (seeds) can be found effectively in a complex network. There are a number of measures proposed for this purpose, for instance, high-degree centrality measure reflects the importance of the network topology and has a reasonable runtime performance to find a… (More)
In this paper we will investigate the performance of Raptor codes using Gallager's majority decoding algorithm on the binary symmetric channels. We obtain equations which relate the error probability to the outputnode degree distribution and then we design good degree distributions using the differential evolution (DE) method
Let T be a linear opeartor and D be a matrix. So by its diagonal matrix, we get a lot of informations about T , namely we can almost answer any question about T. In this paper we introduce an efficient algorithm that characterizes whether a given matrix is diagonalizable in the field F or not (where F is the real field R or the complex field C).