Sciweavers

Share
77 search results - page 1 / 16
» Enumerating randoms
Sort
View
CORR
2008
Springer
70views Education» more  CORR 2008»
9 years 2 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
CORR
2007
Springer
136views Education» more  CORR 2007»
9 years 2 months ago
The analytic computability of the Shannon transform for a large class of random matrix channels
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
N. Raj Rao
DCC
1998
IEEE
9 years 2 months ago
Enumeration, Construction and Random Generation of Block Codes
We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
Harald Fripertinger
CORR
2010
Springer
81views Education» more  CORR 2010»
8 years 9 months ago
Enumerating randoms
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...
Bjørn Kjos-Hanssen, Frank Stephan, Jason Te...
ISAAC
2009
Springer
150views Algorithms» more  ISAAC 2009»
9 years 9 months ago
Random Generation and Enumeration of Bipartite Permutation Graphs
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, R...
books