Optimal linear transmission by loss-insensitive packet encoding

Applied and Computational Harmonic Analysis

Volumn 22, Issue 3, 2007, Pages 274-285

  Bodmann, Bernhard G ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Codes; Erasures; Error bounds; Frames

Indexed keywords

DATA REDUCTION; DATA TRANSFER; HILBERT SPACES; PACKET LOSS;

LINEAR COEFFICIENTS; PACKET ENCODING;

SIGNAL ENCODING;

EID: 34047093951     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2006.07.003     Document Type: Article

References (21)

1. *-encoding. quant-ph/0605235
2. Bodmann B.G., and Paulsen V.I. Frames, graphs and erasures. Linear Algebra Appl. 404 (2005) 118-146
3. Casazza P.G., and Kovačević J. Equal-norm tight frames with erasures. Adv. Comput. Math. 18 (2003) 387-430
4. Casazza P.G., and Kutyniok G. Frames of subspaces. Wavelets, Frames and Operator Theory. Contemp. Math. vol. 345 (2004), Amer. Math. Soc., Providence, RI 87-113
5. Casazza P.G., Kutyniok G., and Li S. Fusion frames and distributed processing. math.FA/0605374
6. Godsil C.D., and Hensel A.D. Distance regular covers of the complete graph. J. Combin. Theory Ser. B 56 (1992) 205-238
7. Godsil C., and Roy A. Equiangular lines, mutually unbiased bases and spin models. quant-ph/0511004
8. Goyal V.K., Kovačević J., and Kelner J.A. Quantized frame expansions with erasures. Appl. Comput. Harmon. Anal. 10 3 (2001) 203-233
9. n: Analysis, synthesis, and algorithms. IEEE Trans. Inform. Theory 44 1 (1998) 16-31
10. Holmes R.B., and Paulsen V.I. Optimal frames for erasures. Linear Algebra Appl. 377 (2004) 31-51
11. Kadison R.V. The Pythagorean theorem. I. The finite case. Proc. Natl. Acad. Sci. 99 (2002) 4178-4184
12. Kovačević J., Dragotti L., and Goyal V. Filter bank frame expansions with erasures. IEEE Trans. Inform. Theory 48 6 (2002) 1439-1450
13. Kalra D. Complex equiangular cyclic frames and erasures. math/0602342
14. Lemmens P.W.H., and Seidel J.J. Equi-isoclinic subspaces of Euclidean spaces. Indag. Math. 35 (1973) 98-107
15. P. Oswald, Frames and space splittings in Hilbert spaces, Lecture notes, Part 1, Bell Labs, 1997
16. 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
17. Strohmer T., and Heath R. Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14 (2003) 257-275
18. Sun W. G-frames and G-Riesz bases. math.FA/0508104
19. Tropp J.A., Dhillon I.S., Heath Jr. R.W., and Strohmer T. Designing structured tight frames via alternating projection. IEEE Trans. Inform. Theory 51 1 (2005) 188-209
20. Welch L. Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inform. Theory 20 3 (1974) 397-399
21. Xia P., Zhou Sh., and Giannakis G.B. Achieving the Welch bound with difference sets. IEEE Trans. Inform. Theory 51 5 (2005) 1900-1907