Rank minimization over finite fields

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 1195-1199

  Tan, Vincent Y F ^a,b   Balzano, Laura ^a   Draper, Stark C ^a  

^a Wisconsin Electric Machines and Power Electronics Consortium   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Finite fields; Rank minimization; Rank metric codes; Reliability function; Sparse measurement matrices

Indexed keywords

FINITE FIELDS; RANK MINIMIZATION; RANK-METRIC CODES; RELIABILITY FUNCTION; SPARSE MEASUREMENT MATRICES;

INFORMATION THEORY; MATRIX ALGEBRA; SIGNAL ENCODING;

FINITE ELEMENT METHOD;

EID: 80054803245     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033722     Document Type: Conference Paper

References (14)

1. E. J. Candès and T. Tao, "The power of convex relaxation: near-optimal matrix completion", IEEE Trans. on Inf. Th., vol. 56, no. 5, 2010.
2. B. Recht, "A simpler approach to matrix completion", To appear in J. Mach. Learn. Research, 2009, arXiv:0910.0651.
3. S. Vishwanath, "Information theoretic bounds for low-rank matrix completion", in Intl. Symp. Inf. Th., Austin, TX, July 2010.
4. B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization", SIAM Rev., vol. 2, no. 52, pp. 471-501, 2009.
5. D. S. Papailiopoulos and A. G. Dimakis, "Distributed Storage Codes Meet Multiple-Access Wiretap Channels", in Proc. of Allerton, 2010.
6. P. Loidreau, "Properties of codes in rank metric", 2006, arXiv:0610057.
7. D. Silva, F. R. Kschischang, and R. Kötter, "A rank-metric approach to error control in random network coding", IEEE Trans. on Inf. Th., vol. 54, no. 9, 2008.
8. A. Montanari and R. Urbanke, "Coding for network coding", 2007, arXiv:0711.3935.
9. I. Csiszár, "Linear codes for sources and source networks: Error exponents, universal coding", IEEE Trans. on Inf. Th., vol. 28, no. 4, 1982.
10. D. de Caen, "A lower bound on the probability of a union", Discrete Math., vol. 69, pp. 217-220, May 1997.
11. S. Draper and S. Malekpour, "Compressed Sensing over Finite Fields", in Intl. Symp. Inf. Th., Seoul, Korea, July 2009.
12. V. Y. F. Tan, L. Balzano, and S. C. Draper, "Rank minimization over finite fields: Fundamental limits and coding-theoretic interpretations", Submitted to IEEE Trans. on Inf. Th., Apr. 2011, arXiv:1104.4302.
13. E. M. Gabidulin, "Theory of codes with maximum rank distance", Probl. Inform. Transm., vol. 21, no. 1, pp. 1-12, 1985.
14. D. Silva, F. R. Kschischang, and R. Kötter, "Communication over finitefield matrix channels", IEEE Trans. on Inf. Th., vol. 56, no. 3, 2010.