.png){kind=icon}
.png){kind=icon}
Return
Optimal Code Length Estimates From Dependent Samples With Bounds on the Estimation Error
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2016.2606106.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Modern communication networks require robust and adaptive communication protocols to optimize various performance metrics, such as latency and energy efficiency. Adaptive communication protocols require real-time estimation of critical system parameters, amongst which the average length of an optimal source code is of key importance, when data compression is involved. In this letter, we prove finite-sample estimates-along with their confidence levels-of the worst case average length of an optimal source code over a channel transmitting dependent data. More specifically, this is achieved by establishing a concentration inequality for the estimation of entropy of the source. Data dependence is modeled through stationary mixing. Evaluation of the proposed bounds is computationally efficient and can be used for real-time estimation.
Keywords:
Optimal source code
entropy estimation
mixing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W