Burst Erasures and the Mean-Square Error for Cyclic Frames

摘要

The general objective in this paper is the loss-insensitive transmission of vectors by linear, redundant encoding with the help of frames. Our specific goal is to find frames which minimize the mean-square reconstruction error for cyclic burst erasures with known burst-length statistics. Finding the best frames among the cyclic ones is reduced to a discrete optimization problem. We provide an upper and lower bound for the mean-square error and discuss a family of frames for which both bounds coincide while the upper bound is minimized.