【摘 要】
：
We construct optimum binary spreading sequences of Markov chains in terms of bit error probabilities in asynchronous spread-spectrum multiple-access(SSMA)co
【机 构】
：
GraduateSchoolofNaturalScienceandTechnology,KanazawaUniversity
【出 处】
：
分形与图上的分析研讨会(AFG2016)
论文部分内容阅读
We construct optimum binary spreading sequences of Markov chains in terms of bit error probabilities in asynchronous spread-spectrum multiple-access(SSMA)communication systems based on discretized β-transformations.
其他文献
We determine the spectrality of digit set D relating to a spectral self-affine measure μM,D.
In this talk we shall consider the intersection of a Cantor set with its translation,its Hausdorff dimension and self-similarity.
Revisiting the founding paper of Kahane and Peyriere on the Mandelbrot multiplicative cascade,we attempt to introduce some kind of variant model linked to o
The talk is based on joint work with Xin Wei and Zhiying Wen.A connected compact subset E of Rn is said to be a strict Whitney set if there exists a real-va
The Assouad dimension was introduced by Assouad in the 1970s,In the talk,we will first review some basic properties of Assouad dimension.
The map(cartgraph)gives a geometrical correspondance between the sphere and the plain,and sometimes suggests sequence of Origami instructions for purpose of
We study higher order tangents and higher order Laplacians on p.c.f.self-similar sets with fully symmetric structures.
This is a joint work with Prof.S.Kotani(Osaka Univ.).We consider the 1d Schr(o)dinger operator with random potential decaying of order α.
We observe that some self-similar measures defined by finite or infinite iterated function systems with overlaps satisfy certain "bounded measure type condi
Let K be Bedford-McMullen self-affine carpets generated by IF-S Tij(x,y)=(x+j/n,y+i/m),where 2 ≤ m≤ n are integers,and(i,j)∈ D(∈){0,1,…,n-1}×{0,1,…,m