Firouz Behnamfar Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArezou Mohammadi, Selim G. Akl, Firouz Behnamfar: QoS-based optimal logarithmic-time uplink scheduling algorithm for packets with hard or soft deadlines in WiMAX. PIMRC 2008: 1-5
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArezou Mohammadi, Selim G. Akl, Firouz Behnamfar: Optimal Linear-Time Algorithm for Uplink Scheduling of Packets with Hard or Soft Deadlines in WiMAX. VTC Fall 2008: 1-5
2007
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFirouz Behnamfar, Fady Alajaji, Tamás Linder: An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes. IEEE Transactions on Communications 55(6): 1093-1098 (2007)
2005
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFirouz Behnamfar, Fady Alajaji, Tamás Linder: Tight error bounds for space-time orthogonal block codes under slow Rayleigh flat fading. IEEE Transactions on Communications 53(6): 952-956 (2005)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFirouz Behnamfar, Fady Alajaji, Tamás Linder: Image transmission over the polya channel via channel-optimized quantization. IEEE Transactions on Signal Processing 53(2-1): 728-733 (2005)
2002
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFirouz Behnamfar, Fady Alajaji, Tamás Linder: Progressive Image Communication over Binary Channels with Additive Bursty Noise. DCC 2002: 272-281

Coauthor Index

1Selim G. Akl [5] [6]
2Fady Alajaji [1] [2] [3] [4]
3Tamás Linder [1] [2] [3] [4]
4Arezou Mohammadi [5] [6]

Colors in the list of coauthors

Copyright © Fri Dec 18 14:20:30 2009 by Michael Ley (ley@uni-trier.de)