Petros ELIA
|
Petros ELIA
Eurecom - Mobile Communications
Assistant-Professor
04 93 00 81 32
04 93 00 82 00
203
|
My EURECOM publications
Journal
-
3648 March 2012
Journal
Sphere decoding complexity exponent for decoding full rate codes over the quasi-static MIMO channel
To appear in "IEEE Transactions on Information Theory", 2012
-
3643 February 2012
Journal
Large families of asymptotically optimal two-dimensional optical orthogonal codes
"IEEE Transactions on Information Theory", Volume 58, N°2, February 2012
-
3099 July 2010
Journal
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models
"IEEE Transactions on Information Theory", Vol 56 N°10, October 2010
-
2864 July 2009
Journal
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols
IEEE Transactions on Information Theory, Vol 55, N°7, 2009
-
2863 June 2009
Journal
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel
IEEE Transactions on Information Theory, Vol 55 N°7, 2009
-
2880 February 2009
Journal
High-SNR analysis of outage-limited communications of bursty and delay-limited information
IEEE Transactions on Information Theory, Vol 55, N°2, February 2009
Conference
-
3625 July 2012
Conference
Supplement to ISIT 2012 submission - Feedback-aided complexity reductions in ML and Lattice decoding
ISIT 2012, IEEE International Symposium on Information Theory, July 1-6, 2012, Cambridge, USA
-
3647 March 2012
Conference
Achieving a vanishing SNR-gap to exact lattice decoding at a subexponential complexity
"IEEE Transactions on Information Theory", N°99, 2012, ISSN: 0018-9448
-
3587 February 2012
Conference
Complexity analysis for ML-based sphere decoder achieving a vanishing performance-gap to brute force ML decoding
IZS 2012, IEEE International Zurich Seminar on Communications, 29 february-2 march 2012, Zurich, Switzerland
-
3472 November 2011
Conference
Search pruning in video surveillance systems: Efficiency-reliability tradeoff
ICCV 2011, Workshop IWITINCVPR, 1st IEEE Workshop on Information Theory in Computer Vision and Pattern Recognition in the International Conference on Computer Vision, November 6-13, Barcelona, Spain
-
3532 September 2011
Conference
Vanishing the gap to exact lattice search at a subexponential complexity: LR-aided regularized decoding
ALLERTON 2011, Conference on Communication, Control and Computing, September 28-30, 2011, Allerton, USA
-
3439 July 2011
Conference
Relay-aided interference neutralization for the multiuser uplink-downlink asymmetric setting
ISIT 2011, IEEE International Symposium on Information Theory, July 31-August 5, 2011, Saint-Petersburg, Russia
-
3551 July 2011
Conference
The complexity of sphere decoding perfect codes under a vanishing gap to ML performance
ISIT 2011, IEEE International Symposium on Information Theory, July 31-August 5, 2011, Saint-Petersburg, Russia
-
3435 June 2011
Conference
Diversity-multiplexing tradeoff for the non-separated two-way relay DF channel
SPAWC 2011, 12th IEEE International Workshop on Signal Processing Advances in Wireless Communications, June 26-29, 2011, San Fransisco, USA
Best Student Paper Award
-
3385 February 2011
Conference
Interference neutralization for separated multiuser uplink-downlink with distributed relays
ITA 2011, Information Theory and Applications Workshop, 6-11 February, 2011, La Jolla, USA
-
3231 October 2010
Conference
Person recognition using a bag of facial soft biometrics (BoFSB)
MMSP'10, IEEE International Workshop on Multimedia Signal Processing, October 4-6, 2010, Saint-Malo, France
-
3232 September 2010
Conference
Soft biometrics systems : Reliability and asymptotic bounds
BTAS'10, 4th IEEE International Conference on Biometrics: Theory, Applications and Systems, September 27-29, 2010, Washington DC, USA
-
3098 June 2010
Conference
Rate-of-decay of probability of isolation in dense sensor networks with bounding constraints
ISIT'10, IEEE International Symposium on Information Theory, June 13-18, 2010, Austin, Texas, USA
-
3100 June 2010
Conference
Fundamental rate-reliability-complexity limits in outage limited MIMO communications
ISIT'10, IEEE International Symposium on Information Theory, June 13-18, 2010, Austin, Texas, USA
-
3101 January 2010
Conference
General DMT optimality of LR-aided linear MIMO-MAC transceivers with worst-case complexity at most linear in sum-rate
ITW'10, IEEE Information Theory Workshop, January 6-8, 2010, Cairo, Egypt
-
2881 June 2009
Conference
LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes
ISIT 2009, IEEE International Symposium on Information Theory, June 28-July 3rd, 2009, Seoul, Korea
-
2928 June 2009
Conference
Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels
ISIT 2009, IEEE International Symposium on Information Theory, June 28-July 3rd, 2009, Seoul, Korea
-
2934 September 2008
Conference
Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexity
ALLERTON 2008, 46th Allerton Conference on Communication, Control and Computing, September 23-26, 2008, Monticello, USA
-
3102 March 2008
Conference
Communicating bursty and delay-sensitive information over outage-limited channels
IZS'08, International Zurich Seminar on Communications, March 12-14, 2008, Zurich, Switzerland
HDR
-
3610 January 2012
HDR
Bits and flops in non-ergodic MIMO: Can (a reasonable number of) flops provably offer ergodic-like behavior
Habilitation à diriger des recherches (French qualification for conducting Phd theses)
Report
-
3413 June 2011
Report
Search pruning with soft biometric systems : efficiency-reliability tradeoff
Research Report RR-11-255
