Prof. Morteza Esmaeili

Isfahan University of Technology, Iran

Email: emorteza@cc.iut.ac.ir

Qualifications

1996  Ph.D., Carleton University, Iran

1988  M.Sc., Teacher Training University of Tehran, Iran

Publications (selected)

1. Mostafa Esmaeili and Morteza Esmaeili, A Fibonacci-polynomial based coding method with error detection and correction, Computers and Mathematics with Applications, Vol. 60, No. 10, Nov. 2010, pp. 2738-2752.
2. M. Esmaeili and M.J. Amoshahi, On the Stopping distance of Array Code Parity-check Matrices, IEEE Trans. Inform. Theory, Vol. 55, No. 8, AUGUST 2009, pp.3488-3493.
3. M. Esmaeili and M. Gholami, Geometrically-structured Maximum-girth LDPC Block and Convolutional Codes, IEEE Journal on Selected Areas in Communications (J-SAC), Vol. 27, No. 6, AUGUST 2009, pp. 831-845.
4. M. Khosravifard, M. Esmaeili and H. Saidi, Extension of the Lasserre-Avrachenkov Theorem on the Integral of Multilinear Forms over Simplices, Applied Mathematics and Computation, 212/1 (2009) pp. 94-99. doi:10.1016/j.amc.2009.02.005.
5. M. Esmaeili and V. Ravanmehr, Two Classes of Optimal Stopping Redundancy Codes, ARS Combinatoria , 92 (2009), pp. 463-471.
6. M. Esmaeili and S. Yari, Generalized Quasi-cyclic Codes: Structural Properties and Code Construction,Applicable Algebra in Engineering, Communications and Com-puting, AAECC (2009) 20:159-173. doi: 10.1007/s00200-009-0095-3.
7. M. Esmaeili and S. Yari, On Complementary-dual Quasi-cyclic Codes, Finite Fields and Their Applications, 15 (2009), pp. 375-386.
8. M. Esmaeili, T.A. Gulliver and A. Kakhbod, The Golden mean, Fibonacci Matrices and Partial Weakly Super-increasing Sources, Chaos, Solitons and Fractals, 42(2009), pp. 435-440. doi:10.1016/j.chaos.2009.01.007
9. M. Esmaeili and M.H. Tadayon, A Lattice-based Systematic Recursive Construction of Quasi-cyclic LDPC Codes, IEEE Transactions on Communications, Vol. 57,No. 10, Oct. 2009, pp. 2857-2863.
10. M. Esmaeili, M.H. Tadayon and T.A. Gulliver, Low-Complexity Girth-8 High-Rate Moderate Length QC LDPC Codes, Int J Electron Commun (AEU) (2008). doi:10.1016/j.aeue.2008.11.018
11. Morteza Esmaeili and Mostafa Esmaeili, Polynomial Fibonacci-Hessenberg Matrices, Chaos, Solitons and Fractals, 41 (2009), pp. 2820-2827.doi:10.1016/j.chaos.2008.10.012
12. M. Khosravifard, M. Esmaeili, H. Saidi and T.A. Gulliver, Encoding of Finite Sources with Ranked Probabilities, Int J Electron Commun (AEU) (2008). doi: 10.1016/j.aeue.2008.09.002
13. M. Esmaeili and M. Gholami, Type-III LDPC Convolutional Codes, Contemporary Engineering Sciences, Vol. 2, No. 2, pp. 85-93, 2009.
14. M. Esmaeili and A. Zaghian, Covering Radius of Binary Codes having Parity- check Matrices with Constant-weight Columns, Utilitas Mathematica, Vol. 77, pp. 225-233, Nov. 2008.
15. M. Esmaeili, A. Kakhbod and T.A. Gulliver, On Finite Antiuniform Probability Distributions, Contemporary Engineering Sciences, Vol. 1, No. 4, pp. 169-175, 2008.
16. M. Hivadi and M. Esmaeili, On the Stopping Distance and Stopping Redundancy of Product Codes, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E91-A, No. 8, pp. 2167-2173, Aug. 2008.
17. M. Esmaeili, Construction of Binary Minimal Product Parity-check Matrices, Applicable Algebra in Engineering, Communications and Computing, Vol. 19, No. 4,pp. 339-348, Aug. 2008.
18. M. Esmaeili, On Full-rank Parity-check Matrices of Product Codes, Utilitas Math-ematica, Vol. 76, pp. 3-10, July 2008.
19. M. Esmaeili and V. Ravanmehr, Stopping Sets of Binary Parity-check Matrices with Constant Weight Columns and Stopping Redundancy of the Associated Codes, Utilitas Mathematica, Vol. 76, pp. 265-276, July 2008.
20. M. Esmaeili and M.H. Tadayon, A Novel Approach to Generating Long LDPC Codes Using Two Con gurations, IET Communications (formerly IEE Proceedings- Communications), Vol. 2, No. 4, pp. 587-597, April 2008.
21. M. Esmaeili, On the Weakly Superincreasing Distributions and the Fibonacci- Hessenberg Matrices, ARS Combinatoria, Vol. 84, pp. 217-224, Aug. 2007.