The simplest solution to an underdetermined system of linear equations

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1924-1928

  Donoho, David ^a   Kakavand, Hossein ^b   Mammen, James ^b  

^a STANFORD UNIVERSITY   (United States)

^b Stanford University

Author keywords

[No Author keywords available]

Indexed keywords

KOLMOGOROV COMPLEXITY; OVERWHELMING FRACTION; UNDERDETERMINED SYSTEM;

COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; NUMERICAL METHODS; PROBLEM SOLVING;

LINEAR EQUATIONS;

EID: 39049153381     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261816     Document Type: Conference Paper

References (6)

1. T. Cover and J. Thomas, 'Elements of Information Theory," Wiley & Sons, New York, 1991.
2. D. L. Donoho, 'The Kolmogorov sampler," Technical Report, Statistics Department, Stanford University, Jan. 2002.
3. D. L. Donoho, 'Neighborly Polytopes and Sparse Solutions of Under-determined Linear Equations," Technical Report, Statistics Department, Stanford University, Dec. 2004.
4. M. Li and P. M. B. Vitanyi, 'An Introduction to Kolmogorov Complexity and its Applications," Springer-Verlag, New York, Second Edition, 1997.
5. P. Gacs and L. Lovasz, 'Complexity of Algorithms," Lecture notes, Spring 1999, http://research.microsoft.com/users/lovasz/notes.htm
6. S. B. Wicker, 'Error Control Systems for Digital Communication and Storage," Prentice Hall, New Jersey, 1995.