Optimal linear transmission by loss-insensitive packet encoding

Bodmann Bodmann, 2005, Frames, graphs and erasures, Linear Algebra Appl., 404, 118, 10.1016/j.laa.2005.02.016 Casazza, 2003, Equal-norm tight frames with erasures, Adv. Comput. Math., 18, 387, 10.1023/A:1021349819855 Casazza, 2004, Frames of subspaces, vol. 345, 87 Casazza Godsil, 1992, Distance regular covers of the complete graph, J. Combin. Theory Ser. B, 56, 205, 10.1016/0095-8956(92)90019-T Godsil Goyal, 2001, Quantized frame expansions with erasures, Appl. Comput. Harmon. Anal., 10, 203, 10.1006/acha.2000.0340 Goyal, 1998, Quantized overcomplete expansions in Rn: Analysis, synthesis, and algorithms, IEEE Trans. Inform. Theory, 44, 16, 10.1109/18.650985 Holmes, 2004, Optimal frames for erasures, Linear Algebra Appl., 377, 31, 10.1016/j.laa.2003.07.012 Kadison, 2002, The Pythagorean theorem. I. The finite case, Proc. Natl. Acad. Sci., 99, 4178, 10.1073/pnas.032677199 Kovačević, 2002, Filter bank frame expansions with erasures, IEEE Trans. Inform. Theory, 48, 1439, 10.1109/TIT.2002.1003832 Kalra Lemmens, 1973, Equi-isoclinic subspaces of Euclidean spaces, Indag. Math., 35, 98, 10.1016/1385-7258(73)90042-5 P. Oswald, Frames and space splittings in Hilbert spaces, Lecture notes, Part 1, Bell Labs, 1997 M. Püschel and J. Kovačević, Real, tight frames with maximal robustness to erasures, in: Proc. Data Compr. Conf., Snowbird, UT, March 2005, pp. 63–72 Strohmer, 2003, Grassmannian frames with applications to coding and communication, Appl. Comput. Harmon. Anal., 14, 257, 10.1016/S1063-5203(03)00023-X Sun Tropp, 2005, Designing structured tight frames via alternating projection, IEEE Trans. Inform. Theory, 51, 188, 10.1109/TIT.2004.839492 Welch, 1974, Lower bounds on the maximum cross correlation of signals, IEEE Trans. Inform. Theory, 20, 397, 10.1109/TIT.1974.1055219 Xia, 2005, Achieving the Welch bound with difference sets, IEEE Trans. Inform. Theory, 51, 1900, 10.1109/TIT.2005.846411