secondary flow investigation could be regarded as an important issue in open channel flow, in spite of its lower quantity compared to the base flow in the water course. it should be given special consideration because of the influence on some hydraulic factors in open channel, specifically in compound channels. in compound channels' due to the difference in the flow velocity of the main ch...

We describe certain extremalities for Gallager’s E0 function evaluated under the uniform input distribution for binary input discrete memoryless channels. The results characterize the extremality of the E0(ρ) curves of the binary erasure channel and the binary symmetric channel among all the E0(ρ) curves that can be generated by the class of binary discrete memoryless channels whose E0(ρ) curve...

Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on the effective rate-distortion function of LDGM codes for the binary symmetric source, showing that they quickly approach the rate-distortion function as the degree increases. We also compare and contrast the standard LDGM constr...

The time-dependent transition between a diabatic interaction potential in the entrance channel and an adiabatic potential during the fusion process is investigated within the two-center shell model. A large hindrance is obtained for the motion to smaller elongations of near symmetric dinuclear systems. The comparison of the calculated energy thresholds for the complete fusion in different relev...

-Several new results on binary ( d , k ) codes are given. First, a new derivation for the capacity of these codes based upon information theoretic principles is given. Based upon this result the spectrum of a ( d , k ) code is computed. Finally, the problem of computing the capacity of the binary symmetric channel under the condition that the input sequences satisfy the ( d , k ) constraint is ...

We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems establish that there exist codes from this ensemble, with all degrees remaining bounded independently of block length, that are simultaneously optimal as bot...