default search action
Morteza Esmaeili
Person information
- affiliation: University of Victoria, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j60]Ehsan Yavari, Morteza Esmaeili, Josep Rifà:
Locally Repairable Codes Based on Permutation Cubes and Latin Squares. IEEE Access 10: 9686-9702 (2022) - [j59]Mehrab Najafian, T. Aaron Gulliver, Morteza Esmaeili:
Construction of Standard Solid Sudoku Cubes and 3D Sudoku Puzzles. IEEE Access 10: 30180-30188 (2022) - [j58]Mehrab Najafian, Morteza Esmaeili, T. Aaron Gulliver, Mohammad Hesam Tadayon:
Twin Sudoku Puzzles and Triplet Solid Sudoku Cubes From Strongly Mutually Distinct Twin Sudoku Tables. IEEE Trans. Games 14(4): 632-643 (2022) - 2021
- [j57]Mohsen Mousavi, Ali Zaghian, Morteza Esmaeili:
Involutory-Multiple-Lightweight MDS Matrices based on Cauchy-type Matrices. Adv. Math. Commun. 15(4): 589-610 (2021) - 2020
- [j56]Mohamadbagher Zeraatpisheh, Morteza Esmaeili, T. Aaron Gulliver:
Construction of Duplication Correcting Codes. IEEE Access 8: 96150-96161 (2020) - [j55]Mohamadbagher Zeraatpisheh, Morteza Esmaeili, T. Aaron Gulliver:
Quasi-cyclic codes: algebraic properties and applications. Comput. Appl. Math. 39(2) (2020) - [j54]Mehrab Najafian, Mohammad Hesam Tadayon, Morteza Esmaeili:
Construction of Strongly Mutually Distinct Sudoku Tables and Solid Sudoku Cubes by Cyclotomic Cosets. IEEE Trans. Games 12(1): 54-62 (2020) - [j53]Ehsan Yavari, Morteza Esmaeili:
Locally Repairable Codes: Joint Sequential-Parallel Repair for Multiple Node Failures. IEEE Trans. Inf. Theory 66(1): 222-232 (2020)
2010 – 2019
- 2019
- [j52]Mohamadbagher Zeraatpisheh, Morteza Esmaeili, T. Aaron Gulliver:
Construction of tandem duplication correcting codes. IET Commun. 13(15): 2217-2225 (2019) - [j51]Mohsen Mousavi, Morteza Esmaeili, Ali Zaghian:
Companion matrices and Golden-Fibonacci sequences. J. Appl. Math. Comput. 61(1-2): 101-116 (2019) - [j50]Morteza Esmaeili, Morteza Rekab-Eslami, Vahid Samadi-Khaftari, T. Aaron Gulliver:
An LEK-Based Design Algorithm for MDS Linear Network Error Correction Codes on Cyclic Multicast Networks. IEEE Trans. Commun. 67(11): 7392-7404 (2019) - 2017
- [j49]Morteza Rekab-Eslami, Morteza Esmaeili, Thomas Aaron Gulliver:
Multicast Convolutional Network Codes via Local Encoding Kernels. IEEE Access 5: 6464-6470 (2017) - [j48]Morteza Esmaeili, M. Moosavi, T. Aaron Gulliver:
A new class of Fibonacci sequence based error correcting codes. Cryptogr. Commun. 9(3): 379-396 (2017) - [j47]Morteza Rekab-Eslami, Morteza Esmaeili, T. Aaron Gulliver:
Generic Linear Network Code Construction Using Transversal Matroids. IEEE Commun. Lett. 21(3): 448-451 (2017) - [j46]Vahid Samadi-Khaftari, Morteza Esmaeili, Thomas Aaron Gulliver:
Construction of MDS Convolutional Error-Correcting Network Codes Over Cyclic Networks. IEEE Trans. Commun. 65(6): 2305-2318 (2017) - 2016
- [j45]Vahid Samadi-Khaftari, Morteza Esmaeili, Thomas Aaron Gulliver:
Some Connections Between Classical Coding and Network Coding Over Erroneous Cyclic Networks. IEEE Access 4: 5889-5895 (2016) - [j44]Vahid Samadi-Khaftari, Morteza Esmaeili:
Ring-based linear network coding on erroneous cyclic networks. IET Commun. 10(18): 2582-2590 (2016) - 2015
- [j43]Morteza Esmaeili, Mehrab Najafian, T. Aaron Gulliver:
Structured quasi-cyclic low-density parity-check codes based on cyclotomic cosets. IET Commun. 9(4): 541-547 (2015) - [j42]Morteza Esmaeili, T. Aaron Gulliver:
Joint channel coding-cryptography based on random insertions and deletions in quasi-cyclic-low-density parity check codes. IET Commun. 9(12): 1555-1560 (2015) - 2014
- [j41]Mohammad Gholami, Morteza Esmaeili, Mehdi Samadieh:
Quasi-cyclic low-density parity-check codes based on finite set systems. IET Commun. 8(10): 1837-1849 (2014) - [j40]Morteza Esmaeili, Mohammad Dakhilalian, T. Aaron Gulliver:
New secure channel coding scheme based on randomly punctured quasi-cyclic-low density parity check codes. IET Commun. 8(14): 2556-2562 (2014) - [j39]Morteza Esmaeili, Mahnaz Ahmadi, T. Aaron Gulliver:
Recursive method for generating column weight 3 low-density parity-check codes based on three-partite graphs. IET Commun. 8(17): 3202-3213 (2014) - 2013
- [j38]Saeed Mosayyebpour, Morteza Esmaeili, T. Aaron Gulliver:
Single-Microphone Early and Late Reverberation Suppression in Noisy Speech. IEEE Trans. Speech Audio Process. 21(2): 322-335 (2013) - [j37]Hossein Falsafain, Morteza Esmaeili:
Construction of Structured Regular LDPC Codes: A Design-Theoretic Approach. IEEE Trans. Commun. 61(5): 1640-1647 (2013) - [j36]Morteza Esmaeili, A. Alampour, T. Aaron Gulliver:
Decoding Binary Linear Block Codes Using Local Search. IEEE Trans. Commun. 61(6): 2138-2145 (2013) - [c8]Saeed Mosayyebpour, Hannan Lohrasbipeydeh, Morteza Esmaeili, T. Aaron Gulliver:
Time delay estimation via minimum-phase and all-pass component processing. ICASSP 2013: 4285-4289 - 2012
- [j35]Saeed Mosayyebpour, Hamid Sheikhzadeh, T. Aaron Gulliver, Morteza Esmaeili:
Single-Microphone LP Residual Skewness-Based Inverse Filtering of the Room Impulse Response. IEEE Trans. Speech Audio Process. 20(5): 1617-1632 (2012) - [j34]Abbas Keshavarz, Saeed Mosayyebpour, Mehrzad Biguesh, T. Aaron Gulliver, Morteza Esmaeili:
Speech-Model Based Accurate Blind Reverberation Time Estimation Using an LPC Filter. IEEE Trans. Speech Audio Process. 20(6): 1884-1893 (2012) - [j33]Hossein Falsafain, Morteza Esmaeili:
A New Construction of Structured Binary Regular LDPC Codes Based on Steiner Systems with Parameter t>2. IEEE Trans. Commun. 60(1): 74-80 (2012) - [j32]Morteza Esmaeili, Mostafa Javedankherad:
4-Cycle Free LDPC Codes Based on Difference Sets. IEEE Trans. Commun. 60(12): 3579-3586 (2012) - [c7]Saeed Mosayyebpour, T. Aaron Gulliver, Morteza Esmaeili:
Single-Microphone Speech Enhancement by Skewness Maximization and Spectral Subtraction. IWAENC 2012 - 2011
- [j31]Morteza Hivadi, Morteza Esmaeili:
High Stopping-distance LDPC Product Codes based on Hamming and Finite Geometry Codes. Ars Comb. 99: 97-107 (2011) - [j30]Morteza Esmaeili, Z. Hooshmand:
The Stopping Distance of Binary BCH-code Parity-check Matrices. Ars Comb. 101: 459-466 (2011) - [j29]Morteza Esmaeili, Mohammad Hesam Tadayon, T. Aaron Gulliver:
More on the Stopping and Minimum Distances of Array Codes. IEEE Trans. Commun. 59(3): 750-757 (2011) - [c6]Mostafa Esmaeili, Morteza Esmaeili, T. Aaron Gulliver:
High rate fibonacci polynomial codes. ISIT 2011: 1921-1924 - 2010
- [j28]Mostafa Esmaeili, Morteza Esmaeili:
A Fibonacci-polynomial based coding method with error detection and correction. Comput. Math. Appl. 60(10): 2738-2752 (2010) - [j27]Reza Sobhani, Morteza Esmaeili:
Some Constacyclic and Cyclic Codes Over Fq[u]/<ut+1>. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(4): 808-813 (2010)
2000 – 2009
- 2009
- [j26]Morteza Esmaeili, S. Yari:
Generalized quasi-cyclic codes: structural properties and code construction. Appl. Algebra Eng. Commun. Comput. 20(2): 159-173 (2009) - [j25]Mohammadali Khosravifard, Morteza Esmaeili, Hossein Saidi:
Extension of the Lasserre-Avrachenkov theorem on the integral of multilinear forms over simplices. Appl. Math. Comput. 212(1): 94-99 (2009) - [j24]Morteza Esmaeili, Vida Ravanmehr:
Two Classes of Optimal Stopping Redundancy Codes. Ars Comb. 92 (2009) - [j23]Morteza Esmaeili, Ali Zaghian:
On the combinatorial structure of a class of I shortened Hamming codes and their dual-codes. Discret. Appl. Math. 157(2): 356-363 (2009) - [j22]Reza Sobhani, Morteza Esmaeili:
Cyclic and negacyclic codes over the Galois ring GR(p2, m). Discret. Appl. Math. 157(13): 2892-2903 (2009) - [j21]Morteza Esmaeili, S. Yari:
On complementary-dual quasi-cyclic codes. Finite Fields Their Appl. 15(3): 375-386 (2009) - [j20]Reza Sobhani, Morteza Esmaeili:
A note on cyclic codes over GR(p2, m) of length pk. Finite Fields Their Appl. 15(3): 387-391 (2009) - [j19]Morteza Esmaeili, Mohammad Hesam Tadayon:
A lattice-based systematic recursive construction of quasi-cyclic LDPC codes. IEEE Trans. Commun. 57(10): 2857-2863 (2009) - [j18]Morteza Esmaeili, Mohammad Javad Amoshahy:
On the stopping distance of array code parity-check matrices. IEEE Trans. Inf. Theory 55(8): 3488-3493 (2009) - 2008
- [j17]Morteza Esmaeili:
Construction of binary minimal product parity-check matrices. Appl. Algebra Eng. Commun. Comput. 19(4): 339-348 (2008) - [j16]Morteza Hivadi, Morteza Esmaeili:
On the Stopping Distance and Stopping Redundancy of Product Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(8): 2167-2173 (2008) - [j15]Morteza Esmaeili, Mohammad Hesam Tadayon:
A novel approach to generating long low-density parity-check codes using two configurations. IET Commun. 2(4): 587-597 (2008) - 2007
- [j14]Morteza Esmaeili, T. Aaron Gulliver:
On the [32, 16, 8] BCH and quadratic residue codes. Australas. J Comb. 37: 257-264 (2007) - [j13]Morteza Esmaeili:
On the Weakly Superincreasing Distributions and the Fibonacci-Hessenberg Matrices. Ars Comb. 84 (2007) - [j12]Morteza Esmaeili, T. Aaron Gulliver:
On the Quaternary Projection of Binary Linear Block Codes. Ars Comb. 85 (2007) - [j11]Morteza Esmaeili, Morteza Hivadi:
G -projectable and Lambda-projectable binary linear block codes. Des. Codes Cryptogr. 45(1): 51-64 (2007) - [j10]Morteza Esmaeili, Ali Kakhbod:
On information theory parameters of infinite anti-uniform sources. IET Commun. 1(5): 1039-1041 (2007) - [j9]Mohammadali Khosravifard, Hossein Saidi, Morteza Esmaeili, T. Aaron Gulliver:
The Minimum Average Code for Finite Memoryless Monotone Sources. IEEE Trans. Inf. Theory 53(3): 955-975 (2007) - 2006
- [c5]Morteza Esmaeili:
The Minimal Product Parity Check Matrix and Its Application. ICC 2006: 1113-1118 - [c4]Morteza Esmaeili, Ali Kakhbod:
On Antiuniform And Partially Antiuniform Sources. ICC 2006: 1611-1615 - [c3]Mohammadali Khosravifard, Hossein Saidi, Morteza Esmaeili, T. Aaron Gulliver:
The Average Performance of the Minimax Code. ISIT 2006: 587-591 - 2005
- [j8]Morteza Esmaeili, T. Aaron Gulliver:
On the Structure of Optimal Linear Block Codes of Length a Multiple of 4 and d = 4. Ars Comb. 74 (2005) - [j7]Morteza Esmaeili, M. R. Yazdani, T. Aaron Gulliver:
Optimal Binary Linear Codes. Ars Comb. 75 (2005) - 2003
- [j6]Mohammadali Khosravifard, Morteza Esmaeili, Hossein Saidi, T. Aaron Gulliver:
A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2510-2516 (2003) - [j5]Morteza Esmaeili, T. Aaron Gulliver, Amir K. Khandani:
On the Pless-construction and ML decoding of the (48, 24, 12) quadratic residue code. IEEE Trans. Inf. Theory 49(6): 1527-1535 (2003) - [c2]Morteza Esmaeili:
On the structure of the binary (18, 9, 6) linear code. ITW 2003: 62-65 - 2001
- [j4]Amir K. Khandani, Morteza Esmaeili:
Successive Minimization of the State Complexity of the Self-dual Lattices Using Korkin-Zolotarev Reduced Basis. Des. Codes Cryptogr. 24(2): 145-158 (2001)
1990 – 1999
- 1999
- [j3]Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord:
The Minimal Generator Matrix of a Vector Space. Appl. Algebra Eng. Commun. Comput. 10(1): 1-14 (1999) - 1998
- [j2]Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord, Samy A. Mahmoud:
A Link Between Quasi-Cyclic Codes and Convolutional Codes. IEEE Trans. Inf. Theory 44(1): 431-435 (1998) - 1997
- [j1]Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord:
Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram. IEEE Trans. Inf. Theory 43(3): 1040-1052 (1997) - 1995
- [c1]Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord:
Trellis Complexity of Linear Block Codes via Atomic Codewords. Information Theory and Applications 1995: 130-148
Coauthor Index
aka: Thomas Aaron Gulliver
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint