<h1>Noorzad, Parham</h1>
<h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Noorzad, Parham and Langberg, Michael, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210729-170824093">Negligible Cooperation: Contrasting the Maximaland Average-Error Cases</a>; IEEE Transactions on Information Theory; Vol. 67; No. 9; 5885-5902; <a href="https://doi.org/10.1109/tit.2021.3093891">10.1109/tit.2021.3093891</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210825-143502652">The Birthday Problem and Zero-Error List Codes</a>; IEEE Transactions on Information Theory; Vol. 67; No. 9; 5791-5803; <a href="https://doi.org/10.1109/tit.2021.3100806">10.1109/tit.2021.3100806</a></li>
</ul>