 | 2012 |
|---|
| 10 |       | Mohammadali Khosravifard,
Hamed Narimani,
T. Aaron Gulliver:
A Simple Recursive Shannon Code.
IEEE Transactions on Communications 60(2): 295-299 (2012) |
| 9 | | Mohammadali Khosravifard,
Shima Kheradmand:
Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes.
IEEE Transactions on Information Theory 58(6): 4049-4057 (2012) |
| 2011 |
|---|
| 8 | | Hamed Narimani,
Mohammadali Khosravifard,
T. Aaron Gulliver:
Near-Optimality of the Minimum Average Redundancy Code for Almost All Monotone Sources.
IEICE Transactions 94-A(11): 2092-2096 (2011) |
| 7 | | Sayed Jalal Zahabi,
Mohammadali Khosravifard,
AliAkbar Tadaion,
T. Aaron Gulliver:
Signal Activity Detection of Offset-QPSK in Colored Gaussian Noise.
IEICE Transactions 94-A(11): 2226-2229 (2011) |
| 2010 |
|---|
| 6 | | Mohammadali Khosravifard,
Hassan Halabian,
T. Aaron Gulliver:
A Kraft-type sufficient condition for the existence of D-ary fix-free codes.
IEEE Transactions on Information Theory 56(6): 2920-2927 (2010) |
| 2009 |
|---|
| 5 | | M. R. Heidarpour,
Mahmoud Modarres-Hashemi,
Mohammadali Khosravifard,
T. Aaron Gulliver:
Improving the Performance of LP Decoders for Cyclic Codes.
ICC 2009: 1-5 |
| 4 | | T. Aaron Gulliver,
Hamed Narimani,
Mohammadali Khosravifard:
Two recursive versions of the Shannon code.
ISIT 2009: 209-213 |
| 3 | | Mohammadali Khosravifard,
Morteza Esmaeili,
Hossein Saidi:
Extension of the Lasserre-Avrachenkov theorem on the integral of multilinear forms over simplices.
Applied Mathematics and Computation 212(1): 94-99 (2009) |
| 2007 |
|---|
| 2 | | Mohammadali Khosravifard,
Hossein Saidi,
Morteza Esmaeili,
T. Aaron Gulliver:
The Minimum Average Code for Finite Memoryless Monotone Sources.
IEEE Transactions on Information Theory 53(3): 955-975 (2007) |
| 1 | | Mohammadali Khosravifard,
Dariush Fooladivanda,
T. Aaron Gulliver:
Confliction of the Convexity and Metric Properties in f-Divergences.
IEICE Transactions 90-A(9): 1848-1853 (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page