Morteza Esmaeili

Orcid: 0000-0002-8894-7017

Affiliations:
  • University of Victoria, Canada


According to our database1, Morteza Esmaeili authored at least 68 papers between 1995 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Twin Sudoku Puzzles and Triplet Solid Sudoku Cubes From Strongly Mutually Distinct Twin Sudoku Tables.
IEEE Trans. Games, 2022

Locally Repairable Codes Based on Permutation Cubes and Latin Squares.
IEEE Access, 2022

Construction of Standard Solid Sudoku Cubes and 3D Sudoku Puzzles.
IEEE Access, 2022

2021
Involutory-Multiple-Lightweight MDS Matrices based on Cauchy-type Matrices.
Adv. Math. Commun., 2021

2020
Locally Repairable Codes: Joint Sequential-Parallel Repair for Multiple Node Failures.
IEEE Trans. Inf. Theory, 2020

Construction of Strongly Mutually Distinct Sudoku Tables and Solid Sudoku Cubes by Cyclotomic Cosets.
IEEE Trans. Games, 2020

Quasi-cyclic codes: algebraic properties and applications.
Comput. Appl. Math., 2020

Construction of Duplication Correcting Codes.
IEEE Access, 2020

2019
Companion matrices and Golden-Fibonacci sequences.
J. Appl. Math. Comput., October, 2019

An LEK-Based Design Algorithm for MDS Linear Network Error Correction Codes on Cyclic Multicast Networks.
IEEE Trans. Commun., 2019

Construction of tandem duplication correcting codes.
IET Commun., 2019

2017
Construction of MDS Convolutional Error-Correcting Network Codes Over Cyclic Networks.
IEEE Trans. Commun., 2017

Generic Linear Network Code Construction Using Transversal Matroids.
IEEE Commun. Lett., 2017

A new class of Fibonacci sequence based error correcting codes.
Cryptogr. Commun., 2017

Multicast Convolutional Network Codes via Local Encoding Kernels.
IEEE Access, 2017

2016
Ring-based linear network coding on erroneous cyclic networks.
IET Commun., 2016

Some Connections Between Classical Coding and Network Coding Over Erroneous Cyclic Networks.
IEEE Access, 2016

2015
Structured quasi-cyclic low-density parity-check codes based on cyclotomic cosets.
IET Commun., 2015

Joint channel coding-cryptography based on random insertions and deletions in quasi-cyclic-low-density parity check codes.
IET Commun., 2015

2014
Quasi-cyclic low-density parity-check codes based on finite set systems.
IET Commun., 2014

New secure channel coding scheme based on randomly punctured quasi-cyclic-low density parity check codes.
IET Commun., 2014

Recursive method for generating column weight 3 low-density parity-check codes based on three-partite graphs.
IET Commun., 2014

2013
Construction of Structured Regular LDPC Codes: A Design-Theoretic Approach.
IEEE Trans. Commun., 2013

Decoding Binary Linear Block Codes Using Local Search.
IEEE Trans. Commun., 2013

Single-Microphone Early and Late Reverberation Suppression in Noisy Speech.
IEEE Trans. Speech Audio Process., 2013

Time delay estimation via minimum-phase and all-pass component processing.
Proceedings of the IEEE International Conference on Acoustics, 2013

2012
A New Construction of Structured Binary Regular LDPC Codes Based on Steiner Systems with Parameter t>2.
IEEE Trans. Commun., 2012

4-Cycle Free LDPC Codes Based on Difference Sets.
IEEE Trans. Commun., 2012

Single-Microphone LP Residual Skewness-Based Inverse Filtering of the Room Impulse Response.
IEEE Trans. Speech Audio Process., 2012

Speech-Model Based Accurate Blind Reverberation Time Estimation Using an LPC Filter.
IEEE Trans. Speech Audio Process., 2012

Single-Microphone Speech Enhancement by Skewness Maximization and Spectral Subtraction.
Proceedings of the IWAENC 2012 - International Workshop on Acoustic Signal Enhancement, Proceedings, RWTH Aachen University, Germany, September 4th, 2012

2011
More on the Stopping and Minimum Distances of Array Codes.
IEEE Trans. Commun., 2011

High Stopping-distance LDPC Product Codes based on Hamming and Finite Geometry Codes.
Ars Comb., 2011

The Stopping Distance of Binary BCH-code Parity-check Matrices.
Ars Comb., 2011

High rate fibonacci polynomial codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Some Constacyclic and Cyclic Codes Over F<sub><i>q</i></sub>[<i>u</i>]/<<i>u</i><sup><i>t</i>+1</sup>>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

A Fibonacci-polynomial based coding method with error detection and correction.
Comput. Math. Appl., 2010

2009
On the stopping distance of array code parity-check matrices.
IEEE Trans. Inf. Theory, 2009

A lattice-based systematic recursive construction of quasi-cyclic LDPC codes.
IEEE Trans. Commun., 2009

A note on cyclic codes over GR(p<sup>2</sup>, m) of length p<sup>k</sup>.
Finite Fields Their Appl., 2009

On complementary-dual quasi-cyclic codes.
Finite Fields Their Appl., 2009

Cyclic and negacyclic codes over the Galois ring GR(p<sup>2</sup>, m).
Discret. Appl. Math., 2009

On the combinatorial structure of a class of <i>I</i> shortened Hamming codes and their dual-codes.
Discret. Appl. Math., 2009

Two Classes of Optimal Stopping Redundancy Codes.
Ars Comb., 2009

Extension of the Lasserre-Avrachenkov theorem on the integral of multilinear forms over simplices.
Appl. Math. Comput., 2009

Generalized quasi-cyclic codes: structural properties and code construction.
Appl. Algebra Eng. Commun. Comput., 2009

2008
A novel approach to generating long low-density parity-check codes using two configurations.
IET Commun., 2008

On the Stopping Distance and Stopping Redundancy of Product Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Construction of binary minimal product parity-check matrices.
Appl. Algebra Eng. Commun. Comput., 2008

2007
The Minimum Average Code for Finite Memoryless Monotone Sources.
IEEE Trans. Inf. Theory, 2007

On information theory parameters of infinite anti-uniform sources.
IET Commun., 2007

<i>G</i> -projectable and Lambda-projectable binary linear block codes.
Des. Codes Cryptogr., 2007

On the Quaternary Projection of Binary Linear Block Codes.
Ars Comb., 2007

On the Weakly Superincreasing Distributions and the Fibonacci-Hessenberg Matrices.
Ars Comb., 2007

On the [32, 16, 8] BCH and quadratic residue codes.
Australas. J Comb., 2007

2006
The Average Performance of the Minimax Code.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On Antiuniform And Partially Antiuniform Sources.
Proceedings of IEEE International Conference on Communications, 2006

The Minimal Product Parity Check Matrix and Its Application.
Proceedings of IEEE International Conference on Communications, 2006

2005
Optimal Binary Linear Codes.
Ars Comb., 2005

On the Structure of Optimal Linear Block Codes of Length a Multiple of 4 and d = 4.
Ars Comb., 2005

2003
On the Pless-construction and ML decoding of the (48, 24, 12) quadratic residue code.
IEEE Trans. Inf. Theory, 2003

A Tree Based Algorithm for Generating All Possible Binary Compact Codes with <i>N</i> Codewords.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

On the structure of the binary (18, 9, 6) linear code.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2001
Successive Minimization of the State Complexity of the Self-dual Lattices Using Korkin-Zolotarev Reduced Basis.
Des. Codes Cryptogr., 2001

1999
The Minimal Generator Matrix of a Vector Space.
Appl. Algebra Eng. Commun. Comput., 1999

1998
A Link Between Quasi-Cyclic Codes and Convolutional Codes.
IEEE Trans. Inf. Theory, 1998

1997
Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram.
IEEE Trans. Inf. Theory, 1997

1995
Trellis Complexity of Linear Block Codes via Atomic Codewords.
Proceedings of the Information Theory and Applications II, 1995


  Loading...