Recent content by ait.abd

Question already asked on http://math.stackexchange.com/questions/1310194/confusion-about-a-random-process?noredirect=1#comment2661260_1310194, but couldn't get an answer so reposting here...

I am reading the following paper: Soft-decision decoding of polar codes with Reed-Solomon kernels On the last line of the page 319 (page 3 of the pdf) the author says "and G is a Reed-Solomon kernel, which is in fact a DFT matrix". G is defined on the page 321 (page 5 of the pdf) with...

Got it! Thanks!

[SIZE="4"][FONT="Times New Roman"]Let X_1, X_2 \sim Exp(\mu) and Y = min(X_1, X_2) then find E[Y]. My attempt is as follows: $$E[Y] = E[Y/X_1<X_2]P(X_1<X_2) + E[Y/X_1>X_2]P(X_1>X_2) \\ = \frac{1}{2} (E[X_1/X_1<X_2] + E[X_2/X_1>X_2] ) \\ = \frac{1}{2} (1/\mu + 1/\mu) \\ = 1/\mu$$ But, we know...

Thanks chiro. But, wolfram online integrator doesn't work for this expression as it tries to compute the exact expression. I can perform numerical integration but I want answer in terms of $a$ and $b$. Numerical integration will calculate the answer for a particular $a$ and $b$.

can any approximation be made?

I want to calculate \int_a^b \frac{1}{\sqrt{2 \pi \sigma^2}} e^{(-(x-\mu)/\sigma^2)} log_2 (1 + e^{-x}) dx

So |x|-|y| \leq |x+y| \leq |x| + |y| and |x|-|y| \leq |x-y| \leq |x| + |y|. I think we can't say anything about the relationship between|x+y| and |x-y|, and in between ||x|-|y|| and |x|-|y|.

I know the following |x|-|y| \leq |x+y| \leq |x| + |y| where does |x-y| fit in the above equation?

Homework Statement H is a nxn matrix with elements in {0,1} G is a nxn matrix with elements in GF(2) m is a nx1 vector with elements in GF(2). How can we perceive the output of HGm where Gm multiplication is in GF(2) and H multiplication is a normal real multiplication. Actually I want...

Domain of mapping is S=\{\text{All } 2^k \text{ sequences of k-bits}\}. Range of the mapping is T=\{2^n-1 \text{ sequences of n-bits i.e. All sequences of n-bits excluding the all 1's sequence}\} By using I mean defining a mapping S to T. In case of linear mapping, the answer is...

I want a sequence of n bits without all 1's in the output. What is the minimum number of bits k given n that can be used in any linear or non-linear invertible mapping that will produce such a sequence at output. For example, consider n=3. I want to create a mapping that has all 2^3=8 minus 111...

What is the difference between martingale and markov chain. As it seems apparently, if a process is a martingale, then the future expected value is dependent on the current value of the process while in markov chain the probability of future value (not the expected value) is dependent on the...

I have a slight problem with the solution micromass hope you can clarify. I was looking at the statement of comparison tests that states that a_n, b_n > 0 for comparison test to be valid whereas in the solution above we can have negative individual terms as well? Is it so or I am looking at it...

Thanks micromass!