Hassan Khodaiemehr

Khaje Nasir Toosi University of Technology | KNTU · Computer Science and Statistics

LDPC lattices were first family of lattices which have efficient decoding algorithm in high dimensions. An LDPC lattice can be constructed from Construction D' and a number of nested LDPC codes. When we consider one code as underlying code of these lattices, one-level LDPC lattices will be obtained. In this paper we propose a new encoding and decod...

p>Quantum computers pose a significant threat to blockchain technology’s security, which heavily relies on public-key cryptography and hash functions. The cryptographic algorithms used in blockchains, based on large odd prime numbers and discrete logarithms, can be easily compromised by quantum computing algorithms like Shor’s algorithm and its fut...

p>Quantum computers pose a significant threat to blockchain technology’s security, which heavily relies on public-key cryptography and hash functions. The cryptographic algorithms used in blockchains, based on large odd prime numbers and discrete logarithms, can be easily compromised by quantum computing algorithms like Shor’s algorithm and its fut...

The smart grid provides efficient transmission of energy and data. However, the frequent gathering of users’ consumption data discloses users’ privacy. Plenty of data aggregation schemes have been introduced to preserve the privacy of users’ private information. Unfortunately, with the advent of quantum machines, most of these schemes will be rende...

In this paper, we present a one-way relaying scheme in which two wireless nodes create an information flow to each other via a single decode-and-forward (DF) relay. We consider an additional secrecy constraint for protection against an honest-but-curious relay. Indeed, while the relay should decode the source message, it should be fully ignorant ab...

In this paper, we propose a list decoding algorithm for the family of unit codes introduced by C. Maire and F. Oggier. Unit codes are constructed based on number fields and these codes are generalized version of number field codes for which a list decoding algorithm has already been proposed. We employ the list decoding algorithm of the number fiel...

Block-fading channel (BF) is a useful model for various wireless communication channels in both indoor and outdoor environments. Frequency-hopping schemes and orthogonal frequency division multiplexing (OFDM) can conveniently be modelled as BF channels. Applying lattices in this type of channel entails dividing a lattice point into multiple blocks...

Block-fading channel (BF) is a useful model for various wireless communication channels in both indoor and outdoor environments. The design of lattices for BF channels offers a challenging problem, which differs greatly from its counterparts like AWGN channels. Recently, the original binary Construction A for lattices, due to Forney, has been gener...

We propose a new nonlinear Rao-Nam like symmetric key encryption scheme. In our design, we employ a specific type of coded modulation schemes namely quasi-cyclic low-density parity-check (QC-LDPC) lattice-codes which have low-complexity encoding and decoding algorithms. Due to the application of coded modulation schemes in our design, the proposed...

In this paper, we present some recent instances of applying algebraic tools from different categories, in the design of digital communications systems. More specifically, we present a structure based on the elements of a group ring for constructing and encoding QC-LDPC codes. As another instance, we present the construction of space-time block code...

Unidirectional or one-way relaying, where two wireless nodes, each of which would like to create an in- formation flow from one node to the other one via a single decode-and-forward (DF) relay, has been an active area of recent research. We consider an additional secrecy constraint for protection against an honest but curious relay. Indeed, while t...

We present an overview of recent advances in the Area of information security using algebraic number fields. This overview indicates the importance of modular lattices in information security and in recently proposed methods for obtaining modular lattices using algebraic number fields. Obtaining Construction a unimodular lattices using cyclotomic n...

Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as QC-LDPC codes, have many applications due to their simple encoding implementation by means of cyclic shift registers. In this paper, we construct QC-LDPC codes from group rings. A group ring is a free module (at the same time a ring) constructed in a natural way from any giv...

LDPC lattices were the first family of lattices to show efficient decoding in high dimensions. We consider a case of these lattices with one binary LDPC code as underlying code. We employ the encoding and decoding of the LDPC lattices in a cooperative transmission framework. We establish two efficient shaping based on hypercube and Voronoi shaping,...

LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. Considering Construction D' of lattices with one binary LDPC code as underlying code gives the well known Construction A LDPC lattices or 1-level LDPC lattices. Block-fading channel (BF) is a useful model for various w...

LDPC lattices were the first family of lattices equipped with iterative decoding algorithms. We introduce quasi cyclic low density parity check (QC LDPC) lattices as a special case of LDPC lattices with one binary QC-LDPC code as their underlying code. These lattices are obtained from Construction A of lattices providing us to encode them efficient...

LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. When we consider Construction D' of lattices with one binary LDPC code as its underlying code, 1-level LDPC lattices are obtained. Block fading channel (BF) is a useful model for various wireless communication channels...

We construct full-diversity, arbitrary rate STBCs for specific number of transmit antennas over an apriori specified signal set using twisted Laurent series rings. Constructing full-diversity space-time block codes from algebraic constructions like division algebras has been done by Shashidhar et al. Constructing STBCs from crossed product algebras...