2025
Efficient Active Deep Decoding of Linear Codes Using Importance Sampling.
IEEE Commun. Lett., February, 2025
2024
Girth Analysis of Quantum Quasi-Cyclic LDPC Codes.
Probl. Inf. Transm., June, 2024
Construction of Protograph-Based LDPC Codes With Chordless Short Cycles.
IEEE Trans. Inf. Theory, January, 2024
Linear label code of a root lattice using Gröbner bases.
Appl. Algebra Eng. Commun. Comput., January, 2024
Disjoint Difference Sets and QC-LDPC Codes With Girth 10.
Proceedings of the 12th Iran Workshop on Communication and Information Theory, 2024
2023
Anonymous Aggregate Fine-Grained Cloud Data Verification System for Smart Health.
IEEE Trans. Cloud Comput., 2023
2022
Improving Asymptotic Properties of Loop Construction of SC-LDPC Chains Over the BEC.
IEEE Commun. Lett., 2022
QC-LDPC Codes With Large Column Weight and Free of Small Size ETSs.
IEEE Commun. Lett., 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
Protograph-based LDPC codes with chordless short cycles and large minimum distance.
Proceedings of the 17th Canadian Workshop on Information Theory, 2022
2021
Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels.
IEEE Trans. Inf. Theory, 2021
Provable secure lightweight attribute-based keyword search for cloud-based Internet of Things networks.
Trans. Emerg. Telecommun. Technol., 2021
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length.
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
Reliability enhancement and packet loss recovery of any steganographic method in voice over IP.
Wirel. Networks, 2020
A fully distributed hierarchical attribute-based encryption scheme.
Theor. Comput. Sci., 2020
A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes.
IEEE Trans. Commun., 2020
Lightweight Fine-Grained Access Control for Wireless Body Area Networks.
Sensors, 2020
Attribute-based fine-grained access control for outscored private set intersection computation.
Inf. Sci., 2020
Edge-Coloring Technique to Analyze Elementary Trapping Sets of Spatially-Coupled LDPC Convolutional Codes.
IEEE Commun. Lett., 2020
QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field.
Adv. Math. Commun., 2020
Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things.
IEEE Access, 2020
2019
A note on the complexity of locating-total domination in graphs.
Theor. Comput. Sci., 2019
Optimal Search for Girth-8 Quasi Cyclic and Spatially Coupled Multiple-Edge LDPC Codes.
IEEE Commun. Lett., 2019
A Lattice Based Joint Encryption, Encoding and Modulation Scheme.
CoRR, 2019
2018
Performance of Möbius Interleavers for Turbo Codes.
Wirel. Pers. Commun., 2018
Analytical Lower Bounds on the Size of Elementary Trapping Sets of Variable-Regular LDPC Codes With Any Girth and Irregular Ones With Girth 8.
IEEE Trans. Commun., 2018
Analytical Lower Bound on the Lifting Degree of Multiple-Edge QC-LDPC Codes With Girth 6.
IEEE Commun. Lett., 2018
A fully distributed revocable ciphertext-policy hierarchical attribute-based encryption without pairing.
IACR Cryptol. ePrint Arch., 2018
Sigma Partitioning: Complexity and Random Graphs.
Discret. Math. Theor. Comput. Sci., 2018
A non-commutative cryptosystem based on quaternion algebras.
Des. Codes Cryptogr., 2018
On the security of the hierarchical attribute based encryption scheme proposed by Wang et al.
CoRR, 2018
Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4.
CoRR, 2018
Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size.
CoRR, 2018
On the algorithmic complexity of decomposing graphs into regular/irregular structures.
CoRR, 2018
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications.
Algorithmica, 2018
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices.
IEEE Access, 2018
A Neural Network Lattice Decoding Algorithm.
Proceedings of the IEEE Information Theory Workshop, 2018
Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security.
Proceedings of the 15th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology, 2018
2017
Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes.
IEEE Trans. Commun., 2017
LDPC Lattice Codes for Full-Duplex Relay Channels.
IEEE Trans. Commun., 2017
Practical Encoder and Decoder for Power Constrained QC LDPC-Lattice Codes.
IEEE Trans. Commun., 2017
Colorful edge decomposition of graphs: Some polynomial cases.
Discret. Appl. Math., 2017
Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices.
CoRR, 2017
On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families.
CoRR, 2017
An Efficient Public Key Encryption Scheme Based on QC-MDPC Lattices.
IEEE Access, 2017
2016
Efficient Search of Girth-Optimal QC-LDPC Codes.
IEEE Trans. Inf. Theory, 2016
On the algorithmic complexity of zero-sum edge-coloring.
Inf. Process. Lett., 2016
Practical Encoder and Decoder for Power Constrained QC-LDPC lattices.
CoRR, 2016
Construction of Full-Diversity LDPC Lattices for Block-Fading Channels.
CoRR, 2016
Construction of full-diversity 1-level LDPC lattices for block-fading channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016
A secret key encryption scheme based on 1-level QC-LDPC lattices.
Proceedings of the 13th International Iranian Society of Cryptology Conference on Information Security and Cryptology, 2016
2015
The complexity of the zero-sum 3-flows.
Inf. Process. Lett., 2015
On the Complexity of Deciding Whether the Regular Number is at Most Two.
Graphs Comb., 2015
A new non-associative cryptosystem based on NTOW public key cryptosystem and octonions algebra.
ACM Commun. Comput. Algebra, 2015
Binomial ideal associated to a lattice and its label code.
ACM Commun. Comput. Algebra, 2015
A Johnson-type bound for group codes and lattices.
ACM Commun. Comput. Algebra, 2015
One-level LDPC lattice codes for the relay channels.
Proceedings of the Iran Workshop on Communication and Information Theory, 2015
Minimum free distance of CCSDS turbo encoders under (Truncated) Möbius interleavers.
Proceedings of the Iran Workshop on Communication and Information Theory, 2015
2014
An Algebraic Method for Decoding q-ary Codes via Submodules of Z<sup>n</sup>.
IEEE Commun. Lett., 2014
The Complexity of the Sigma Chromatic Number of Cubic Graphs.
CoRR, 2014
2013
Algorithmic complexity of proper labeling problems.
Theor. Comput. Sci., 2013
Grobner Bases for Lattices and an Algebraic Decoding Algorithm.
IEEE Trans. Commun., 2013
On the performance of 1-level LDPC lattices.
Proceedings of the Iran Workshop on Communication and Information Theory, 2013
2012
FFT Based Sum-Product Algorithm for Decoding LDPC Lattices.
IEEE Commun. Lett., 2012
Construction of LDGM lattices
CoRR, 2012
Cycle structure of permutation functions over finite fields and their applications.
Adv. Math. Commun., 2012
2011
Turbo Lattices: Construction and Performance Analysis
CoRR, 2011
Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011
2010
Codes with girth 8 Tanner graph representation.
Des. Codes Cryptogr., 2010
Self-Inverse Interleavers for Turbo Codes
CoRR, 2010
On cycle-free lattices with high rate label codes.
Adv. Math. Commun., 2010
Construction of turbo lattices.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010
Self-inverse interleavers based on permutation functions for turbo codes.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010
2006
Low-Density Parity-Check Lattices: Construction and Decoding Analysis.
IEEE Trans. Inf. Theory, 2006
2003
Low density parity check lattices based on construction D' and cycle-free Tanner graphs.
Proceedings of the Algebraic Coding Theory and Information Theory, 2003