scholarly journals An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures

2021 ◽  
pp. 1-1
Author(s):  
Elad Domanovitz ◽  
Silas L. Fong ◽  
Ashish Khisti
Keyword(s):  
Explicit Rate

A strong approximation for some non-stationary complex Gaussian processes

1981 ◽  
Vol 18 (2) ◽  
pp. 390-402 ◽  
Author(s):  
Peter Breuer
Keyword(s):  
Rate Of Convergence ◽  
Gaussian Processes ◽  
Strong Approximation ◽  
Approximation Theorem ◽  
Explicit Rate ◽  
Complex Valued ◽  
Strong Approximation Theorem

A strong approximation theorem is proved for some non-stationary complex-valued Gaussian processes and an explicit rate of convergence is achieved. The result answers a problem raised by S. Csörgő.

An adaptive inverse controller for explicit rate congestion control with guaranteed stability and fairness

2003 ◽  
Vol 76 (1) ◽  
pp. 24-47 ◽  
Author(s):  
Kenneth P. Laberteaux ◽  
Charles E. Rohrs ◽  
Panos J. Antsaklis
Keyword(s):  
Congestion Control ◽  
Guaranteed Stability ◽  
Explicit Rate

scholarly journals On the Hausdorff Dimension of Bernoulli Convolutions

2018 ◽  
Vol 2020 (19) ◽  
pp. 6569-6595 ◽  
Author(s):  
Shigeki Akiyama ◽  
De-Jun Feng ◽  
Tom Kempton ◽  
Tomas Persson
Keyword(s):  
Hausdorff Dimension ◽  
Rate Of Convergence ◽  
Finite Time ◽  
Time Algorithm ◽  
Bernoulli Convolution ◽  
Bernoulli Convolutions ◽  
Explicit Rate ◽  
Products Of Matrices

Abstract We give an expression for the Garsia entropy of Bernoulli convolutions in terms of products of matrices. This gives an explicit rate of convergence of the Garsia entropy and shows that one can calculate the Hausdorff dimension of the Bernoulli convolution $\nu _{\beta }$ to arbitrary given accuracy whenever $\beta $ is algebraic. In particular, if the Garsia entropy $H(\beta )$ is not equal to $\log (\beta )$ then we have a finite time algorithm to determine whether or not $\operatorname{dim_H} (\nu _{\beta })=1$.

Sign in / Sign up

Export Citation Format

Share Document