About me
Hello, hello! I’m Dimitris, a third year Ph.D. student in the Department of Electrical Engineering at the University of Southern California and proud to be advised by Alex Dimakis.
Before California there was life, of course. I spent seven wonderful years (2002-2009) at the Technical University of Crete, Greece, located in the beautiful city of Chania (you must visit it, if you haven’t done already). There, I got my Diploma in Electronics and Computer Engineering and my M.Sc. under the supervision of and through the fruitful collaboration with George Karystinos.
Research Interests
I’m interested in communications, signal processing, and optimization. In particular, codes for distributed storage, interference channels, polynomial time approaches for hard problems, and sparse principal component analysis.
Topics
Interference Alignment and DoF
Signal Detection and Sparse PCA
News
-
-Aug ’11: We have a new family of codes that we call Simple Regenerating Codes (SRCs). SRCs have simple and “local” repair, based on look-up tables and simple XORs. They are near optimal in terms of codeword locality and can be made asymptotically MDS, with a log(k) gap of repair BW from optimal.
-
-Allerton 2011: We are presenting the first 2-parity, repair optimal, MDS code, based on Hadamard Designs.
-
-June ’11: We have uploaded on arXiv a new family of repair optimal, MDS codes, based on Hadamard Designs and perfect Interference Alignment.
-
-ISIT ’11: We presented a new storage code with optimal repair properties based on Hadamard Designs.
-
-ISIT ’11: We presented a new algorithm that solves sparse PCA in polynomial time, for constant rank covariance matrices.
Research Publications
Journals
J3. D. S. Papailiopoulos and A. G. Dimakis, “Interference Alignment as a Rank Constrained Rank Minimization,” submitted.
J2. D. S. Papailiopoulos and A. G. Dimakis, “Distributed Storage Codes Meet Multiple-Access Wiretap Channels,” submitted.
J1. D. S. Papailiopoulos and G. N. Karystinos, “Maximum-likelihood noncoherent OSTBC detection with polynomial complexity,” in IEEE Trans. Wireless Commun., Vol. 6, pp. 1935 - 1945, June 2010.
Conferences
2012
C15. D. S. Papailiopoulos, Jianqiang Luo, Alexandros G. Dimakis, Cheng Huang, and Jin Li, “Simple Regenerating Codes: Network Coding for Cloud Storage”, submitted.
2011
C14. D. S. Papailiopoulos, A. G. Dimakis, and Viveck R. Cadambe, “Repair Optimal Erasure Codes through Hadamard Designs”, Allerton 2011.
C13. D. S. Papailiopoulos and A. G. Dimakis, “Distributed Storage Codes through Hadamard Designs”, ISIT 2011.
C12. M. Asteris, D. S. Papailiopoulos, G. N. Karystinos, “Sparse Principal Component of a Rank-deficient Matrix”, ISIT 2011.
C11. D. S. Papailiopoulos and A. G. Dimakis, “Repairing Erasure Codes”, Refereed Work-In-Progress (WiP) and Poster at USENIX Conference on File and Storage Technologies (FAST) 2011.
C10. A. G. Dimakis and D. S. Papailiopoulos, “Network coding, distributed storage and Iinterference alignment”, in 2011 nformation Theory and Applications (ITA), San Diego , CA, Jan. 2011.
2010
C9. D. S. Papailiopoulos and A. G. Dimakis, “Distributed Storage Codes Meet Multiple-Access Wiretap Channels,” in 2010 Allerton Conference on Communication, Control, and Computing, Allerton House, Monticello, IL, Sept. 2010. (pdf, presentation)
C8. B. Hassibi, A. G. Dimakis, and D. S. Papailiopoulos, “MCMC Methods for Integer Least-Squares Problems,” in 2010 Allerton Conference on Communication, Control, and Computing, Allerton House, Monticello, IL, Sept. 2010. (pdf)
C7. D. S. Papailiopoulos and A. G. Dimakis, “Connecting Interference Alignment and Distributed Storage Through Rank Minimization,” in 2010 Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2010.
C6. D. S. Papailiopoulos and A. G. Dimakis, “Interference Alignment as a Rank Constrained Rank Minimization,” IEEE GLOBECOM, Miami, FL, Dec. 2010.
2009
C5. D. S. Papailiopoulos and G. N. Karystinos, “Optimal OSTBC Sequence Detection over Unknown Correlated Fading Channels,” in Proc. 2009 Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2009.
2008
C4. D. S. Papailiopoulos and G. N. Karystinos, “Efficient maximum-likelihood noncoherent orthogonal STBC detection,” in Proc. 2008 Allerton Conference on Communication, Control, and Computing, Allerton House, Monticello, IL, Sept. 2008.
C3. D. S. Papailiopoulos and G. N. Karystinos, “Polynomial-complexity maximum-likelihood block noncoherent MPSK detection,” in Proc. IEEE ICASSP 2008 - Intern. Conf. Acoust., Speech and Signal Proc., Las Vegas, NV, Apr. 2008, pp. 2681-2684.
C2. D. S. Papailiopoulos and G. N. Karystinos,“Efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form,” in Proc. 2008 Conf. on Inform. Sc. and Syst. (CISS 2008), Princeton University, Princeton, NJ, Mar. 2008, pp. 1086-1090.
2007
C1. D. S. Papailiopoulos and G. N. Karystinos, “Near ML detection of nonlinearly distorted OFDM signals,” in Proc. 2007 Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2007, pp. 1756-1760.
Graduate Coursework
@USC
Information Theory, Applied Linear Algebra for Engineering, Large Scale Systems and Message Passing Algorithms, Random Processes in Engineering, Linear System Theory, Algorithmic Game Theory, Discrete Optimization, Network Information Theory, Coding for Storage.
@TUC
Probability Theory, Estimation Theory, Information Theory, Computational Methods for Engineers, Convex Optimization, Wireless Communications Systems, Measure Theory, Advanced Topics in Voice Processing.
Awards
- 2011-2012 Myronis Fellowship (USC)
- 2009-2014 Annenberg Fellowship (USC)
-
-2008 Graduate Studies Fellowship Award (TUC)
-
-2004 Undergraduate Fellowship Award, Greek National Fellowship Foundation
Professional Activities
Reviewer for:
IEEE Trans. IT, IEEE Trans. SP, IEEE ISIT, IEEE ICC, IEEE NetCod, IEEE VTC, IEEE WCNC, EURASIP WCN.
