Junan Zhang, Ph.D.
Affiliations: | 2005 | University of California, San Diego, La Jolla, CA |
Area:
Electronics and Electrical EngineeringGoogle:
"Junan Zhang"Parents
Sign in to add mentorAlon Orlitsky | grad student | 2005 | UCSD | |
(Universal compression and probability estimation over unknown alphabets.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Das H, Orlitsky A, Santhanam NP, et al. (2008) Further results on relative redundancy Ieee International Symposium On Information Theory - Proceedings. 1940-1943 |
Orlitsky A, Santhanam NP, Viswanathan K, et al. (2006) Limit results on pattern entropy Ieee Transactions On Information Theory. 52: 2954-2964 |
Orlitsky A, Santhanam N, Zhang J. (2006) Relative redundancy for large alphabets Ieee International Symposium On Information Theory - Proceedings. 2672-2676 |
Orlitsky A, Santhanam N, Viswanathan K, et al. (2006) Theoretical and experimental results on modeling low probabilities 2006 Ieee Information Theory Workshop, Itw 2006. 242-246 |
Orlitsky A, Viswanathan K, Zhang J. (2005) Stopping set distribution of LDPC code ensembles Ieee Transactions On Information Theory. 51: 929-953 |
Orlitsky A, Santhanam N, Viswanathan K, et al. (2005) Convergence of profile based estimators Ieee International Symposium On Information Theory - Proceedings. 2005: 1843-1847 |
Orlitsky A, Santhanam NP, Viswanathan K, et al. (2004) Limit results on pattern entropy 2004 Ieee Information Theory Workshop - Proceedings, Itw. 99-104 |
Orlitsky A, Santhanam NP, Zhang J. (2004) Universal compression of memoryless sources over unknown alphabets Ieee Transactions On Information Theory. 50: 1469-1481 |
Orlitsky A, Sajama, Santhanam N, et al. (2004) Algorithms for modeling distributions over large alphabets Ieee International Symposium On Information Theory - Proceedings. 306 |
Orlitsky A, Santhanam NP, Zhang J. (2004) Relative redundancy: A more stringent performance guarantee for universal compression Ieee International Symposium On Information Theory - Proceedings. 25 |