Complete List
Book Chapters
(1)P. Piantanida and L. Rey Vega, “Information Bottleneck and Representation Learning,” Information-Theoretic Methods in Data Science. Cambridge, U.K. Cambridge University Press, January 2019 (to appear).
Journal Papers
(1)M. Vera, P. Piantanida, and L. Rey Vega, “The Role of Information Complexity and Randomization in Representation Learning,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018 (submitted). [Online]
(2)M. Vera, L. Rey Vega, and P. Piantanida, “Compression-Based Regularization with an Application to Multi-Task Learning,” IEEE Trans. on Signal Processing, Nov. 2017, (submitted). [Online]
(3)A. Altieri and P. Piantanida, “Performance Evaluation of Advanced Relaying Protocols in Large Wireless Networks,” Networking, IEEE/ACM Transactions on, Jan. 2018, (submitted). [Online]
(4)C. He, S. Yang, and P. Piantanida, “A novel transmission scheme for the K-user broadcast channel with delayed CSIT,” IEEE Transactions on Wireless Communications, vol. 17, no. 1, pp. 386–399, Jan 2018.
(5)K. Wan, J. Mingyue, P. Piantanida, and D. Tuninetti, “Novel outer bounds and inner bounds with uncoded cache placement for combination networks with end-user-caches,” Information Theory, IEEE Transactions on, March 2018 (submitted).
(6)A. Bunin, A. Goldfeld, H. Permuter, S. Shamai (Shitz), P. Cuff, and P. Piantanida, “Semantically-secured message-key trade-off over wiretap channels with random parameters,” Information Forensics and Security, IEEE Transactions on, August 2017, (submitted). [Online]
(7)K. Wan, D. Tuninetti, and P. Piantanida, “An index coding approach to caching with uncoded cache placement,” Information Theory, IEEE Transactions on, August 2017, (submitted).
(8)J. Silva and P. Piantanida, “Universal weak variable-length source coding on countable infinite alphabets,” Information Theory, IEEE Transactions on, February 2017, (submitted). [Online]
(9)C. He, S. Yang, and P. Piantanida, “On the gaussian fading broadcast relay channel with causal state feedback,” IEEE Trans. on Communications, vol. 64, no. 7, pp. 2797–2807, July 2016.
(10)G. Bassi, P. Piantanida, and G. Shamai (Shitz), “Secret key generation over noisy channels with common randomness,” Information Theory, IEEE Transactions on, Septembre 2016 (submitted). [Online]
(11)M. Vera, L. R. Vega, and P. Piantanida, “Collaborative information bottleneck,” Information Theory, IEEE Transactions on, 2016 (to appear). [Online]
(12)G. Pichler, P. Piantanida, and G. Matz, “Two dictator functions maximize mutual information,” The Annals of Applied Probability, April 2018 (to appear). [Online]
(13)G. Katz, P. Piantanida, and M. Debbah, “Collaborative distributed hypothesis testing,” Information Theory, IEEE Transactions on, January 2017 (submitted). [Online]
(14)G. Pichler, P. Piantanida, and G. Matz, “Distributed information-theoretic clustering,” Information Theory, IEEE Transactions on, vol., November 2017 (submitted). [Online]
(15)M. Benammar, P. Piantanida, and S. S. Shitz, “Capacity results for the multicast cognitive interference channel,” IEEE Transactions on Information Theory, vol. 63, no. 7, pp. 4119–4136, July 2017. [Online]
(16)G. Bassi, P. Piantanida, and G. Shamai (Shitz), “The wiretap channel with generalized feedback: Secure communication and key generation,” Information Theory, IEEE Transactions on, July 2015 (revised). [Online]
(17)C. He, S. Yang, and P. Piantanida, “On the gaussian fading broadcast relay channel with causal state feedback,” IEEE Transactions on Communications, vol. 64, no. 7, pp. 2797–2807, July 2016.
(18)G. Katz, P. Piantanida, and M. Debbah, “Distributed binary detection with lossy data compression,” IEEE Transactions on Information Theory, vol. 63, no. 8, pp. 5207–5227, Aug 2017. [Online]
(19)L. R. Vega, P. Piantanida, and A. O. Hero, “The three-terminal interactive lossy source coding problem,” IEEE Transactions on Information Theory, vol. 63, no. 1, pp. 532–562, Jan 2017. [Online]
(20)M. Benammar, P. Piantanida, and S. Shamai (Shitz), “On the compound broadcast channel: Multiple description coding and interference decoding,” Information Theory, IEEE Transactions on, 2017 (to appear). [Online]
(21)M. Benammar and P. Piantanida, “Secrecy capacity region of some classes of wiretap broadcast channels,” Information Theory, IEEE Transactions on, vol. 61, no. 10, pp. 5564–5582, Oct 2015. [Online]
(22)J. Hoydis, R. Couillet, and P. Piantanida, “The second-order coding rate of the MIMO quasi-static rayleigh fading channel,” Information Theory, IEEE Transactions on, vol. 61, no. 12, pp. 6591–6622, Dec 2015. [Online]
(23)M. Jabi, A. Hamss, L. Szczecinski, and P. Piantanida, “Multi-packet hybrid ARQ: Closing gap to the ergodic capacity,” Communications, IEEE Transactions on, vol. 63, no. 12, pp. 5191–5205, Dec. 2015. [Online]
(24)G. Bassi, P. Piantanida, and S. Yang, “Capacity bounds for a class of interference relay channels,” Information Theory, IEEE Transactions on, vol. 61, no. 7, pp. 3698–3721, July 2015. [Online]
(25)A. Altieri, P. Piantanida, L. Rey Vega, and C. Galarza, “On fundamental trade-offs of device-to-device communications in large wireless networks,” Wireless Communications, IEEE Transactions on, vol. 14, no. 9, pp. 4958–4971, Sept 2015. [Online]
(26)A. Behboodi and P. Piantanida, “Mixed noisy network coding and cooperative unicasting in wireless networks,” Information Theory, IEEE Transactions on, vol. 61, no. 1, pp. 189–222, Jan 2015. [Online]
(27)A. Altieri, L. Rey Vega, P. Piantanida, and C. Galarza, “On the outage probability of the full-duplex interference-limited relay channel,” Selected Areas in Communications, IEEE Journal on, vol. 32, no. 9, pp. 1765–1777, Sept 2014. [Online]
(28)J. Villard, P. Piantanida, and S. Shamai, “Secure transmission of sources over noisy channels with side information at the receivers,” Information Theory, IEEE Transactions on, vol. 60, no. 1, pp. 713–739, Jan 2014. [Online]
(29)A. Altieri, L. Rey Vega, P. Piantanida, and C. Galarza, “Analysis of a cooperative strategy for a large decentralized wireless network,” Networking, IEEE/ACM Transactions on, August 2014. [Online]
(30) J. Villard and P. Piantanida, “Secure multiterminal source coding with side information at the eavesdropper,” Information Theory, IEEE Transactions on, vol. 59, no. 6, pp. 3668–3692, 2013. [Online]
(31)Y. Sheng, M. Kobayashi, P. Piantanida, and S. Shamai, “Secrecy degrees of freedom of MIMO broadcast channels with delayed CSIT,” Information Theory, IEEE Transactions on, vol. 59, no. 9, pp. 5244–5256, 2013. [Online]
(32)A. Zaidi, P. Piantanida, and S. Shamai Shitz, “Capacity region of cooperative multiple-access channel with states,” Information Theory, IEEE Transactions on, vol. 59, no. 10, pp. 6153–6174, 2013. [Online]
(33) A. Zaidi, S. Shamai, P. Piantanida, and L. Vandendorpe, “Bounds on the capacity of the relay channel with noncausal state at the source,” Information Theory, IEEE Transactions on, vol. 59, no. 5, pp. 2639–2672, 2013. [Online]
(34)A. Behboodi and P. Piantanida, “Cooperative strategies for simultaneous and broadcast relay channels,” Information Theory, IEEE Transactions on, vol. 59, no. 3, pp. 1417–1443, 2013. [Online]
(35) M. Kobayashi, P. Piantanida, S. Yang, and S. Shamai (Shitz), “On the secrecy degrees of freedom of the multi-antenna block fading wiretap channel,” Information Forensics and Security, IEEE Trans. on, vol. 6, no. 3, pp. 703–711, September 2011.
(36)P. Piantanida, G. Matz, and P. Duhamel, “Outage behavior of discrete memoryless channels under channel estimation errors,” Information Theory, IEEE Transactions on, vol. 55, no. 9, pp. 4221–4239, sept. 2009. [Online]
(37)P. Piantanida, S. Sadough, and P. Duhamel, “On the outage capacity of a practical decoder accounting for channel estimation inaccuracies,” Communications, IEEE Transactions on, vol. 57, no. 5, pp. 1341 –1350, may 2009. [Online]
(38)A. Zaidi, P. Piantanida, and P. Duhamel, “Broadcast-and MAC-aware coding strategies for multiple user information embedding,” Signal Processing, IEEE Transactions on, vol. 55, no. 6, pp. 2974 –2992, June 2007.
(39)P. Piantanida and C. Estienne, “A new estimator based on maximum entropy,” Latin American Applied Research, vol. 35, no. 2, pp. 143–148, June 2005.
Proceedings of International Conferences
(1)C. Feutry, P. Piantanida, Y. Bengio, and P. Duhamel, “Learning anonymized representations with adversarial neural networks,” in The 35th International Conference on Machine Learning (ICML 2018), Stockholm, Sweden, July 10 – July 15, July 2018 (submitted). [Online]
(2)M. Vera, P. Piantanida, and L. Rey Vega, “Informational complexity and generalization in representation learning,” in The 35th International Conference on Machine Learning (ICML 2018), Stockholm, Sweden, July 10 – July 15, July 2018 (submitted).
(3)——, “The role of the information bottleneck in representation learning,” in 2018 IEEE International Symposium on Information Theory (ISIT), June 2018 (submitted).
(4)K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, “On the benefits of asymmetric coded cache placement in combination networks with end-user caches,” in 2018 IEEE International Symposium on Information Theory (ISIT), June 2018 (submitted).
(5)——, “Caching in combination networks: A novel delivery by leveraging the network topology,” in 2018 IEEE International Symposium on Information Theory (ISIT), June 2018 (submitted).
(6)G. Bassi, P. Piantanida, and M. Skoglund, “Lossy communication subject to statistical parameter privacy,” in 2018 IEEE International Symposium on Information Theory (ISIT), 2018 (submitted).
(7)A. Bunin, A. Goldfeld, H. Permuter, S. Shamai (Shitz), P. Cuff, and P. Piantanida, “Key-message security over state-dependent wiretap channels,” in 2018 IEEE International Symposium on Information Theory (ISIT), 2018 (submitted).
(8)L. M. Dogariu, S. Ciochin?, C. Paleologu, J. Benesty, and P. Piantanida, “Identification of bilinear forms with the kalman filter,” in 2018 IEEE International Conference on Acoustics, Speech and Signal Processing, 15 – 20 April 2018, Calgary, Alberta, Canada., April 2018.
(9)M. Vera, P. Piantanida, and L. Rey Vega, “A learning algorithm with compression-based regularization,” in 2018 IEEE International Conference on Acoustics, Speech and Signal Processing, 15 – 20 April 2018, Calgary, Alberta, Canada., April 2018.
(10)K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, “Caching in combination networks: Novel multicast message generation and delivery by leveraging the network topology,” in IEEE ICC 2018 Communication Theory Symposium, 20 – 24 May, Kansas City, MO, USA, 2018.
(11)——, “Novel outer bounds for combination networks with end-user-caches,” in Information Theory Workshop (ITW), 2017 IEEE, Nov. 6th – 10th, 2017.
(12)Q. Yang, P. Piantanida, and D. Gunduz, “The multi-layer information bottleneck problem,” in Information Theory Workshop (ITW), 2017 IEEE, Nov. 6th – 10th, 2017
(13)L. M. Dogariu, S. Ciochinâ, C. Paleologu, J. Benesty, and P. Piantanida, “An adaptive solution for nonlinear system identification,” in 2017 International Symposium on Signals, Circuits and Systems (ISSCS), July 2017, pp. 1–4.
(14)C. He, S. Yang, and P. Piantanida, “A non-linear transmission scheme for the K-user Broadcast Channel with state feedback,” in Proc. of International Symposium on Information Theory and its Applications (ISITA), Oct. 30 – Nov. 2, November 2016.
(15)J. F. Silva and P. Piantanida, “The redundancy gains of almost lossless universal source coding over envelope families,” in 2017 IEEE International Symposium on Information Theory (ISIT), June 2017, pp. 2003–2007.
(16)M. Vera, L. R. Vega, and P. Piantanida, “Distributed cooperative information bottleneck,” in 2017 IEEE International Symposium on Information Theory (ISIT), June 2017, pp. 709–713.
(17)G. Pichler, P. Piantanida, and G. Matz, “A multiple description ceo problem with log-loss distortion,” in 2017 IEEE International Symposium on Information Theory (ISIT), June 2017, pp. 111–115.
(18)M. Mhanna, P. Piantanida, and P. Duhamel, “Privacy-preserving quantization learning with applications to smart meters,” in 2017 IEEE International Conference on Communications (ICC), May 2017, pp. 1–6.
(19)——, “Privacy-preserving quantization learning for distributed binary decision with applications to smart meters,” in 2017 IEEE International Conference on Communications Workshops (ICC Workshops), May 2017, pp. 1128–1133.
(20)K. Wan, D. Tuninetti, and P. Piantanida, “Novel delivery schemes for decentralized coded caching in the finite file size regime,” in 2017 IEEE International Conference on CommunicationsWorkshops (ICC Workshops), May 2017, pp. 1183–1188.
(21)K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, “Novel inner bounds with uncoded cache placement for combination networks with end-user caches,” in Communication, Control, and Computing (Allerton), 51th Annual Allerton Conference on, October 4th - 7th 2017.
(22)G. Katz, P. Piantanida, and M. Debbah, “A new approach to distributed hypothesis testing,” in Signals, Systems and Computers, 2016 50nd Asilomar Conference on, Nov. 2016.
(23)C. He, S. Yang, and P. Piantanida, “A non-linear transmission scheme for the K-user Broadcast Channel with state feedback,” in Proc. of International Symposium on Information Theory and its Applications (ISITA), Oct. 30 – Nov. 2, November 2016.
(24)A. Bunin, P. Piantanida, and S. S. Shitz, “The gaussian wiretap channel with correlated sources at the terminals: Secret communication and key generation,” in 2016 IEEE International Conferenc on the Science of Electrical Engineering (ICSEE), Nov 2016, pp. 1–5.
(25)J. F. Silva and P. Piantanida, “Almost lossless variable-length source coding on countably infinite alphabets,” in 2016 IEEE International Symposium on Information Theory (ISIT), July 2016, pp. 1–5.
(26)[C26] G. Pichler, P. Piantanida, and G. Matz, “Distributed information-theoretic biclustering,” in 2016 IEEE International Symposium on Information Theory (ISIT), July 2016, pp. 1083–1087.
(27)G. Bassi, P. Piantanida, and S. Shamai, “Secret key generation over noisy channels with common randomness,” in 2016 IEEE International Symposium on Information Theory (ISIT), July 2016, pp. 510–514.
(28)G. Katz, P. Piantanida, and M. Debbah, “Collaborative distributed hypothesis testing with general hypotheses,” in 2016 IEEE International Symposium on Information Theory (ISIT), July 2016, pp. 1705–1709
(29)K. Wan, D. Tuninetti, and P. Piantanida, “On caching with more users than files,” in 2016 IEEE International Symposium on Information Theory (ISIT), July 2016, pp. 135–139.
(30)P. P. G. Pichler and G. Matz, “Tight upper bound on the mutual information of two boolean functions,” in Information Theory Workshop (ITW), 2016 IEEE, September 11 to 14, 2016.
(31)K.Wan, D. Tuninetti, and P. Piantanida, “On the optimality of uncoded cache placement,” in Information Theory Workshop (ITW), 2016 IEEE, September 11 to 14, 2016.
(32)M. Mhanna, P. Duhamel, and P. Piantanida, “Quantization for distributed binary detection under secrecy constraints,” in 2016 IEEE International Conference on Communications (ICC), May 2016, pp. 1–6.
(33)G. Pichler, P. Piantanida, and G. Matz, “Distributed information-theoretic biclustering of two memoryless sources,” in Communication, Control, and Computing (Allerton), 2015 53nd Annual Allerton Conference on, 2015.
(34)G. Bassi, P. Piantanida, and S. Shamai, “The wiretap channel with generalized feedback: Secure communication and key generation,” in Information Theory Workshop (ITW), 2015 IEEE, October 2015, pp. 1–5.
(35)M. Vera, L. Rey Vega, and P. Piantanida, “The two-way cooperative information bottleneck,” in Information Theory (ISIT), 2015 IEEE International Symposium on, June 2015, pp. 2131–2135.
(36)L. Rey Vega, P. Piantanida, and A. O. Hero, “On the rate-distortion regions for interactive source coding,” in Information Theory (ISIT), 2015 IEEE International Symposium on, June 2015, pp. 1771–1775.
(37)G. Bassi, P. Piantanida, and S. Shamai, “On the capacity of the wiretap channel with generalized feedback,” in Information Theory (ISIT), 2015 IEEE International Symposium on, June 2015, pp. 1154–1158.
(38)M. Benammar, P. Piantanida, and S. Shamai, “On multiple description coding for the multicast cognitive interference channel,” in Information Theory (ISIT), 2015 IEEE International Symposium on, June 2015, pp. 2126–2130.
(39)M. Mhanna and P. Piantanida, “On secure distributed hypothesis testing,” in Information Theory (ISIT), 2015 IEEE International Symposium on, June 2015, pp. 1605–1609.
(40)G. Katz, P. Piantanida, R. Couillet, and M. Debbah, “On the necessity of binning for the distributed hypothesis testing problem,” in Information Theory (ISIT), 2015 IEEE International Symposium on, June 2015, pp. 2797–2801.
(41)M. Benammar, P. Piantanida, and S. Shamai, “Capacity results for the multicast cognitive interference channel,” in Information Theory Workshop (ITW), 2015 IEEE, April 2015, pp. 1–5.
(42)C. He, S. Yang, and P. Piantanida, “An achievable rate region of broadcast relay channel with state feedback,” in Communications (ICC), 2015 IEEE International Conference on, June 2015, pp. 4193–4198.
(43)A. El Hamss, L. Szczecinski, and P. Piantanida, “Increasing the throughput of HARQ via multi-packet transmission,” in Global Communications Conference (GLOBECOM), 2014 IEEE, Dec 2014, pp. 1485–1491.
(44)G. Katz, P. Piantanida, R. Couillet, and M. Debbah, “Joint estimation and detection against independence,” in Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on, Sept 2014, pp. 1220–1227.
(45)M. Benammar, P. Piantanida, and S. Shamai (Shitz), “Multiple description coding for the compound broadcast channel,” in Information Theory Workshop (ITW), 2014 IEEE, November.
(46)M. Benammar and P. Piantanida, “On the secrecy capacity region of a class of parallel wiretap broadcast channel,” in Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on, Sept 2014, pp. 1072–1077.
(47)——, “On the secrecy capacity region of the wiretap broadcast channel,” in Information Theory Workshop (ITW), 2014 IEEE, Nov 2014, pp. 421–425.
(48)G. Bassi, P. Piantanida, and S. Yang, “Constant-gap results and cooperative strategies for a class of interference relay channels,” in Information Theory (ISIT), 2014 IEEE International Symposium on, June 2014, pp. 1421–1425.
(49)P. Piantanida, L. Vega, and A. Hero, “A proof of the generalized Markov lemma with countable infinite sources,” in Information Theory (ISIT), 2014 IEEE International Symposium on, June 2014, pp. 591–595.
(50)R. Tandon, P. Piantanida, and S. Shamai, “On multi-user miso wiretap channels with delayed CSIT,” in Information Theory (ISIT), 2014 IEEE International Symposium on, June 2014, pp. 211–215.
(51)L. Rey Vega, P. Piantanida, and A. Hero, “On the three-terminal interactive lossy source coding problem,” in Information Theory (ISIT), 2014 IEEE International Symposium on, June 2014, pp. 771–775.
(52)G. Bassi, P. Piantanida, and S. Yang, “Capacity to within a constant gap for a class of interference relay channels,” in 51th Annual Allerton Conference on Communication, Control, and Computing, 2013.
(53)P. Piantanida, M. Kobayashi, and G. Caire, “Analog index coding over block-fading miso broadcast channels with feedback,” in Information Theory Workshop (ITW), 2013 IEEE, 2013.
(54)M. Benammar and P. Piantanida, “On the role of interference decoding in compound broadcast channels,” in Information Theory Workshop (ITW), 2013 IEEE, 2013.
(55)J. Hoydis, R. Couillet, and P. Piantanida, “Bounds on the second-order coding rate of the MIMO Rayleigh block-fading channel,” in Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, 2013.
(56)A. Altieri, L. Vega, C. Galarza, and P. Piantanida, “Cooperative unicasting in large wireless networks,” in Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, 2013.
(57)A. Behboodi and P. Piantanida, “Mixed noisy network coding,” in Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, 2013.
(58)J. Hoydis, R. Couillet, P. Piantanida, and M. Debbah, “A random matrix approach to the finite blocklength regime of MIMO fading channels,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, july 2012, pp. 2181–2185.
(59)A. Altieri, L. Vega, C. Galarza, and P. Piantanida, “Cooperation versus interference in large wireless relay networks,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, july 2012, pp. 611–615.
(60)M. Ivashkina, I. Andriyanova, P. Piantanida, and C. Poulliat, “Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, july 2012, pp. 945–949.
(61)A. Behboodi and P. Piantanida, “Selective coding strategy for unicast composite networks,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, july 2012, pp. 1321–1325.
(62)J. Villard, P. Piantanida, and S. Shamai, “Secure transmission of a gaussian source over gaussian channels with side information,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, july 2012, pp. 1177–1181.
(63)A. Zaidi, P. Piantanida, and S. Shamai, “Wyner-Ziv type versus noisy network coding for a state-dependent MAC,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, july 2012, pp. 1682–1686.
(64)C. G. Galarza, P. Piantanida, and M. Kountouris, “On the block error probability of finite-length codes in decentralized wireless networks,” in Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on, 28 – 30 September 2011.
(65)A. Behboodi and P. Piantanida, “Cooperative strategies for simultaneous relay channels,” in XXIIIe Colloque GRETSI - Traitement du Signal et des Images (GRETSI 2011), 5-8 September 2011.
(66)——, “On the asymptotic error probability of composite relay channels,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, 2011.
(67)M. Ivashkina, I. Andriyanova, P. Piantanida, and C. Poulliat, “Block-markov LDPC scheme for half-and full-duplex erasure relay channel,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, 2011.
(68)J. Villard, P. Piantanida, and S. Shamai (Shitz), “Secure lossy source-channel wiretapping with side information at the receiving terminals,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, 2011. [Online]
(69)A. Zaidi, P. Piantanida, and S. Shamai (Shitz), “Multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, 2011.[Online]
(70)A. Altieri, L. Rey Vega, C. G. Galarza, and P. Piantanida, “Cooperative strategies for interference-limited wireless networks,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, 2011. [Online]
(71)S. Yang, P. Piantanida, M. Kobayashi, and S. Shamai (Shitz), “On the secrecy degrees of freedom of multi-antenna wiretap channels with delayed CSIT,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, 2011. [Online]
(72)A. Zaidi, P. Piantanida, and S. Shamai (Shitz), “Capacity of multiple access channel with non-causal and strictly causal states at the encoders,” in NEWCOM++ / COST 2100 Joint Workshop on Wireless Communications (JNCW 2011), 2011
(73)M. Kobayashi, P. Piantanida, S. Yang, and S. Shamai (Shitz), “On the secrecy degrees of freedom of MISO wiretap channels with delayed CSIT,” in NEWCOM++ / COST 2100 Joint Workshop on Wireless Communications (JNCW 2011), 2011.
(74)A. Behboodi and P. Piantanida, “Broadcasting over the relay channel with oblivious cooperative strategy,” in Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on, 29 2010-oct. 1 2010, pp. 1098–1103. [Online]
(75)J. Villard and P. Piantanida, “Secure lossy source coding with side information at the decoders,” in Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on, 29 2010-oct. 1 2010, pp. 733 –739. [Online]
(76)A. Behboodi and P. Piantanida, “On the simultaneous relay channel with collocated relay and destination nodes,” in Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2010 Proceedings of the 8th International Symposium on, 2010-june 4 2010, pp. 437–442.
(77)P. Piantanida and S. Shamai (Shitz), “On the capacity of compound state-dependent channels with states known at the transmitter,” in Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, june 2010, pp. 624 –628. [Online]
(78)M. Kobayashi, P. Piantanida, S. Yang, and S. Shamai (Shitz), “On the secrecy degress of freedom of the multi- antenna block fading wiretap channels,” in Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, june 2010, pp. 2563–2567. [Online]
(79)A. Behboodi and P. Piantanida, “Capacity of a class of broadcast relay channels,” in Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, june 2010, pp. 590–594. [Online]
(80)A. Zaidi, S. Shamai (Shitz), P. Piantanida, and L. Vandendorpe, “Bounds on the capacity of the relay channel with noncausal state information at source,” in Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, june 2010, pp. 639–643. [Online]
(81)M. Kobayashi, P. Piantanida, S. Yang, and S. Shamai (Shitz), “On the secrecy degrees of freedom of the multi- antenna block fading wiretap channels,” in Future Network and MobileSummit 2010 Conference and Exhibition, 16-18 June 2010, Florence, Italy 2010.
(82)A. Zaidi, S. Shamai(Shitz), P. Piantanida,and P. Vandendorpe, “Bounds on the capacity of the relay channel with non-causal state information at source,” in Future Network and MobileSummit 2010 Conference and Exhibition, 16-18 June 2010, Florence, Italy 2010.
(83)J. Villard, P. Bianchi, E. Moulines, and P. Piantanida, “High-rate quantization for the Neyman-Pearson detection of Hidden Markov processes,” in Information Theory Workshop (ITW), 2010 IEEE, jan. 2010, pp. 1 –5. [Online]
(84)P. Piantanida and S. Shamai (Shitz), “Capacity of compound state-dependent channels with states known at the transmitter,” in Information Theory, 2009. ISIT 2009. IEEE International Symposium on, 28 2009-july 3 2009, pp. 1968–1972.
(85)A. Behboodi and P. Piantanida, “On the simultaneous relay channel with informed receivers,” in Information Theory, 2009. ISIT 2009. IEEE International Symposium on, 2009, july 3 2009, pp. 1179–1183. [Online]
(86)P. Piantanida and S. Shamai (Shitz), “Capacity of compound state-dependant channels with state information at the transmitter,” in Proc. of NEWCOM - ACoRN Joint Workshop, March 30-April 1,Barcelona, Spain 2009.
(87)P. Layec, P. Piantanida, R. Visoz, and A. Berthet, “Transceiver design for sum-MSE optimization in MIMO-MAC with imperfect channel estimation,” in Signals, Systems and Computers, 2008 42nd Asilomar Conference on, oct. 2008, pp. 321–325.
(88)A. Venkiah, P. Piantanida, C. Poullia, P. Duhamel, and D. Declercq, “Rateless coding for quasi-static fading channels using channel estimation accuracy,” in Information Theory, 2008. ISIT 2008. IEEE International Symposium on, july 2008, pp. 2257–2261.
(89)P. Layec, P. Piantanida, R. Visoz, and A. Berthet, “Capacity of channels with multistage successive refinement of quantized feedback information via noisy links,” in Signal Processing Advances in Wireless Communications, 2008. SPAWC 2008. IEEE 9th Workshop on, july 2008, pp. 176–180.
(90)——, “Capacity bounds for MIMO multiple access channel with imperfect channel state information,” in Information Theory Workshop (ITW), May 2008, pp. 21–25.
(91)P. Piantanida, S. Sadough, and P. Duhamel, “On the outage capacity of a practical decoder using channel estimation accuracy,” in Information Theory, 2007. ISIT 2007. IEEE International Symposium on, june 2007, pp. 2281–2285. [Online]
(92)S. Sadough, P. Piantanida, and P. Duhamel, “MIMO-OFDM optimal decoding and achievable information rates under imperfect channel estimation,” in Signal Processing Advances in Wireless Communications, 2007. SPAWC 2007. IEEE 8th Workshop on, june 2007, pp. 1–5. [Online]
(93)P. Piantanida and P. Duhamel, “Dirty-paper coding without channel information at the transmitter and imperfect estimation at the receiver,” in Communications, 2007. ICC ’07. IEEE International Conference on, june 2007, pp. 5406–5411. [Online]
(94)——, “On the capacity of the fading MIMO broadcast channel without channel information at the transmitter and imperfect estimation at the receivers,” in Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on, vol. 3, april 2007, pp. III–409 –III–412.
(95)——, “Achievable rates for the fading MIMO broadcast channel with imperfect channel estimation,” in Communication, Control, and Computing (Allerton), 2010 44th Annual Allerton Conference on, Sep. 27-29 2006.
(96)S. Sadough, P. Piantanida, and P. Duhamel, “Achievable outage rates with improved decoding of BICM multi- band OFDM under channel estimation errors,” in Signals, Systems and Computers, 2006. ACSSC ’06. Fortieth Asilomar Conference on, 29 2006-nov. 1 2006, pp. 1806 –1810. [Online]
(97)P. Piantanida, G. Matz, and P. Duhamel, “Outage behavior of discrete memoryless channels under channel estimation errors,” in Proc. of International Symposium on Information Theory and its Applications (ISITA), Seoul, Korea, 2006, pp. 417-422, June 2007. [Online]
(98)——, “Estimation-induced outage capacity of Ricean channels,” in Signal Processing Advances in Wireless Communications, 2006. SPAWC ’06. IEEE 7th Workshop on, july 2006, pp. 1–5.
(99)A. Zaidi and P. Piantanida, “MAC aware coding strategy for multiple user information embedding,” in Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on, vol. V, may 2006, p. 5.
(100)A. Zaidi, P. Piantanida, and P. Duhamel, “Scalar scheme for multiple user information embedding,” in Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP ’05). IEEE International Conference on, vol. 2, 18-23, 2005, pp. 5–8.
(101)P. Piantanida, S. Lasaulce, and P. Duhamel, “Broadcast channels with non-causal side information: Coding theorem and application example,” in Proc. Winterschool on Coding and Information Theory, Feb. 20-25, , Bratislava, Slovakia 2005.
(102)P. Piantanida and C. Estienne, “Maximum entropy good-turing estimator for language modeling,” in Proc. of European Conference on Speech Communication and Technology (Eurospeech), September 1-4, Geneva, Switzerland 2003.
Invited Papers in Proceedings of International Conferences
(1)K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, “Recent advances on combination networks with end-user caches,” in Information Theory and Applications Workshop (ITA), Catamaran Resort, Pacific Beach, San Diego., Feubrary 11th – 16th ,2018.
(2)——, “State-of-the-art in Cache-aided Combination Networks,” in Proc. of the asilomar conference on signals, systems, and computers, October 29th - November 1st, 2018.
(3)K. Wan, D. Tuninetti, P. Piantanida, and M. Ji, “On cache-aided relay networks,” in The 22nd International ITG Workshop on Smart Antennas (WSA 2018), Bochum, Germany, March 14 - 16, 2018.
(4)K. Wan, D. Tuninetti, and P. Piantanida, “A novel index coding scheme and its application to coded caching,” in Information Theory and Applications Workshop (ITA), Feubrary 12th – 17th, 2017.
(5)K. Wan, M. Ji, P. Piantanida, and D. Tuninetti, “Combination networks with caches: Improved achievable scheme based on interference alignment,” in Signals, Systems and Computers, 2017, 51nd Asilomar Conference on, Oct. 29th – Nov. 1st, 2017.
(6)A. Bunin, A. Goldfeld, H. Permuter, S. S. (Shitz), P. Cuff, and P. Piantanida, “Semantically-Secured message-key trade-off over wiretap channels with random parameters,” in Proceedings of the 2nd Workshop on Communication Security, Paris, 2017 (Special session), 2017.
(7)G. Bassi, P. Piantanida, and S. Shamai (Shitz), “The role of noisy feedback in secure communications,” in EuCNC’2015 - European Conference on Networks and Communications, 2015.
(8)A. Altieri, P. Piantanida, L. Vega, and C. Galarza, “A stochastic geometry approach to distributed caching in large wireless networks,” in Wireless Communications Systems (ISWCS), 2014 11th International Symposium on, Aug 2014, pp. 863–867.
(9)C. He, S. Yang, and P. Piantanida, “On the capacity of the fading broadcast channel with state feedback,” in Communications, Control and Signal Processing (ISCCSP), 2014 6th International Symposium on, May 2014, pp. 182–185.
(10) M. Benammar, P. Piantanida, and S. Shamai (Shitz), “Dirty-paper coding techniques for compound MISO broadcast channels: A dof analysis,” in 9th International Conference on Cognitive Radio Oriented Wireless Networks, Oulu, Finland, June 2014.
(11) A. Adhikary, P. Piantanida, M. Kobayashi, H. Papadopoulos, and G. Caire, “CSI dissemination for MU-MIMO schemes based on outdated CSI,” in 50th Annual Allerton Conference on Communication, Control, and Computing, 2012.
(12)A. Behboodi and P. Piantanida, “Selective coding strategy for composite relay channels,” in Communications Control and Signal Processing (ISCCSP), 2012 5th International Symposium on, may 2012, pp. 1 – 6.
(13)——, “On the asymptotic spectrum of the error probability of composite networks,” in Information Theory Workshop (ITW), 2012 IEEE, sept. 2012, pp. 148 –152.
(14)A. Altieri, L. Rey Vega, C. Galarza, and P. Piantanida, “On the balance between cooperation and interference in dense wireless networks,” in Wireless Communication Systems (ISWCS), 2012 International Symposium on, aug. 2012, pp. 1009 –1013.
(15)J. Villard, P. Piantanida, and S. Shamai (Shitz), “Hybrid digital/analog schemes for secure transmission with side information,” in Information Theory Workshop (ITW), 2011 IEEE, 16 – 20 October 2011 [Online]
(16)J. Villard and P. Piantanida, “Secure distributed lossless compression with side information at the eavesdropper,” in VALUETOOLS – Workshop on Secure Wireless Networks (SECURENETS), May 20 2011.
(17) A. Zaidi, S. Shamai (Shitz), P. Piantanida, and L. Vandendorpe, “On the capacity of a class of relay channels with orthogonal components and noncausal state information at source,” in Wireless Pervasive Computing (ISWPC), 2010 5th IEEE International Symposium on, May 2010, pp. 528 –533.
Proceedings of National Conferences
(1)V. Matias, L. Rey Vega, and P. Piantanida, “Algoritmo iterativo multitarea con un enfoque de teoría de información,” in Proc. of XVII Workshop in Information Processing and Control (RPIC 2017), 20 – 22 September, 2017.
(2)A. Altieri, L. Rey Vega, P. Piantanida, and C. G. Galarza, “Performance of cooperative strategies on dense wireless networks,” in Proc. of XIV Workshop in Information Processing and Control (RPIC 2011), 16 – 18 November, 2011.
(3)J. Villard and P. Piantanida, “Codage de source sous contrainte de sécurité avec information adjacente aux récepteurs,” in XXIIIe Colloque GRETSI - Traitement du Signal et des Images (GRETSI 2011), 5-8 September, 2011.
(4)A. Behboodi and P. Piantanida, “Cooperative strategies for simultaneous relay channels,” in XXIIIe Colloque GRETSI - Traitement du Signal et des Images (GRETSI 2011), 5-8 September, 2011.
(5)P. Piantanida and C. Estienne, “Improving backing-off by considering extended contexts,” in Proc. of Workshop in Information Processing and Control (RPIC), October 10-14, San Nicolas, Argentina 2003.
(6)P. Piantanida, N. Barraza, and C. Estienne, “Una nueva familia de estimadores de probabilidades de N-gramas en modelos coersitivos,” in Proc. of Workshop in Information Processing and Control (RPIC), October 10-14, San Nicolas, Argentina 2003.
(7)C. Estienne, P. Pelle, and P. Piantanida, “A front-end for speech recognition systems using phase-locked loops,” in Proc. of Workshop in Information Processing and Control (RPIC), October 10-14, San Nicolas, Argentina 2001, pp. 88–91.
Dissertations
(1)P. Piantanida, “Multi-user information theory: State information and imperfect channel knowledge,” Ph.D. dissertation, Paris-Sud University, Gif-sur-Yvette, France, May 2007. [Online]
(2)——, “Statistical language modeling using maximal entropy methods,” Master’s thesis, Buenos Aires University (UBA), Buenos Aires, Argentina, September 2003