CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Noorzad-P"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2019 | 2018 | 2017 | 2016 | 2015 | 2014
Number of items: 12.

2019

Noorzad, Parham and Langberg, Michael and Effros, Michelle (2019) Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20200214-105541551

2018

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2018) Can Negligible Cooperation Increase Capacity? The Average-Error Case. In: 2018 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 1256-1260. ISBN 978-1-5386-4780-6. https://resolver.caltech.edu/CaltechAUTHORS:20181126-145651855

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2018) Can Negligible Rate Increase Network Reliability? IEEE Transactions on Information Theory, 64 (6). pp. 4282-4293. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:20170614-160818881

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2018) The Unbounded Benefit of Encoder Cooperation for the k-user MAC. IEEE Transactions on Information Theory, 64 (5). pp. 3655-3678. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:20180104-165541678

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2018) Can Negligible Cooperation Increase Network Capacity? The Average-Error Case. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190402-145653639

2017

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2017) The benefit of encoder cooperation in the presence of state information. In: 2017 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 41-45. ISBN 978-1-5090-4096-4. https://resolver.caltech.edu/CaltechAUTHORS:20170816-155534409

Noorzad, Parham and Effros, Michelle and Langberg, Michael et al. (2017) The birthday problem and zero-error list codes. In: 2017 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 1648-1652. ISBN 978-1-5090-4096-4. https://resolver.caltech.edu/CaltechAUTHORS:20170816-163747105

2016

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2016) Can negligible cooperation increase network reliability? In: 2016 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 1784-1788. ISBN 978-1-5090-1807-9. https://resolver.caltech.edu/CaltechAUTHORS:20160824-091111532

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2016) The unbounded benefit of encoder cooperation for the k-user MAC. In: 2016 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 340-344. ISBN 978-1-5090-1807-9. https://resolver.caltech.edu/CaltechAUTHORS:20160823-153226672

2015

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2015) The Multivariate Covering Lemma and its Converse. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190402-145646746

Noorzad, Parham and Effros, Michelle and Langberg, Michael (2015) On the cost and benefit of cooperation. In: 2015 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, pp. 36-40. ISBN 978-1-4673-7704-1. https://resolver.caltech.edu/CaltechAUTHORS:20151006-134532103

2014

Noorzad, Parham and Effros, Michelle and Langberg, Michael et al. (2014) On the power of cooperation: Can a little help a lot? In: 2014 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 3132-3136. ISBN 978-1-4799-5186-4. https://resolver.caltech.edu/CaltechAUTHORS:20150227-092238378

This list was generated on Sun Aug 9 23:40:23 2020 PDT.