Salariseddigh, Mohammad Javad - Lehr- und Forschungseinheit für Nachrichtentechnik

M.Sc. Mohammad Javad Salariseddigh

Technical University of Munich

Chair of Communications Engineering (Prof. Kramer)

Postal address

Postal:
Theresienstr. 90
80333 München

Phone: +49 (89) 289 - 23451
Room: 0104.03.407
mohammad.j.salariseddigh@tum.de

Biography

Doctoral Researcher / Chair of Communications Eng. / TUM / 2019 -
M.Sc. / Communication and Multimedia Eng. / FAU / - 2018
B.Sc. / Electrical Eng. / Department of Communications / KNTU / - 2014

Theses

Available Theses

BAMAFPIPSEM

Title

✔----

Computation of Identification Function Over Faulty Channels

Diese Seite als PDF öffnen.

Computation of Identification Function Over Faulty Channels

Keywords:
Identification via channels, identification function, complexity of distributive computing, one/two-way probabilistic communications

Description

Identification problem (Ahlswede and Dueck, 1989) over the Binary Symmetric Channel (BSC) is linked to the communication complexity problem (one/two way communications) and interpreted in that context.

Prerequisites

Basics of information/identification theory
Basic of communication complexity

Supervisor:

Mohammad Salariseddigh

----✔

Graph Capacity (Intro.)

Diese Seite als PDF öffnen.

Graph Capacity (Intro.)

Keywords:
Shannon Capacity of A Graph, Confusability Graph, Graph Powers.

Short Description:
The student study the problem of transmission over a channel (communication) through the lens of graphs. Hence, S/he learn some graph language and alphabets and later study the known results for the graph capacities.

Description

Specifically the following topics will be touched:

Shannon Capacity of A Graph
Zero-Error Capacity
Zero-Error Applications (Perfect Hash Function, Superimposed Codes)
Sperner Capacity
Lovasz Number
Haemers Bound
Confusability Graph
Hyper-graph Capacity
Graph Alphabets:

Independenc Number
Chromatic Number
Graph Entropy
Graph Powers

Prerequisites

Basics of the following:

Information Theory
Graph Theory
Coding Theory
Channel Coding

Contact

References:

Alon, N. "The Shannon Capacity of a Union." Combinatorica 18, 301-310, 1998.
Haemers, W. "An Upper Bound for the Shannon Capacity of a Graph." In Algebraic Methods in Graph Theory. Szeged, Hungary: pp. 267-272, 1978.
Lovász, L. "On the Shannon Capacity of a Graph." IEEE Trans. Inform. Th. IT-25, 1-7, 1979.
Shannon, C. E. "The Zero-Error Capacity of a Noisy Channel." IRE Trans. Inform. Th. 2, 8-19, 1956.
Cohen, G., Körner, J. and Simonyi, G., 1990. "Zero-error capacities and very different sequences." In Sequences (pp. 144-155). Springer, New York, NY.
Korner, Janos, and Alon Orlitsky. "Zero-error information theory." IEEE Trans. Inform. Th. IT-25, no. 6 (1998): 2207-2229.

Supervisor:

Mohammad Salariseddigh

-✔---

Explicit Construction of Deterministic Identification Codes

Diese Seite als PDF öffnen.

Explicit Construction of Deterministic Identification Codes

Keywords:
Identification via channels, identification codes,

Description

In this thesis, the student after studying deterministic identification will construct the explicit codes for certain channels.

Prerequisites

Background in Information Theory and Channel Coding

Familiarity in fundamentals of Identification Theory

Supervisor:

Mohammad Salariseddigh

--✔--

Identification Codes via Prime Numbers

Diese Seite als PDF öffnen.

Identification Codes via Prime Numbers

Keywords:
Identification via channels, Prime Number Encryption

Short Description:
An approach for construction of identification codes for noiseless channel by means of the prime number encryption would be studied.

Description

In original scheme of identificaion via channels (Ahlswede and Dueck, 1989), a non-constructive method for coding for noiseless channel was studied. To address the explicit construction of identificaion codes, foremost Ahlswede and Verboven, 1991 provide a number theoretic approach based on the two successive prime number encryption. This method require the knowledge of first 2^n prime numbers for a block-length of n codeword. In this research internship, this method along with related prime number encryption tools and theorems would be investigated. Further, the extension of this scheme to a general DMC will be analyzed.

Prerequisites

Basics of:

information/identification theory
channel coding
prime number theorem (Chebyshev)

Supervisor:

Mohammad Salariseddigh

--✔--

On the Equivalence of Identification and Authentication

Diese Seite als PDF öffnen.

On the Equivalence of Identification and Authentication

Keywords:
Identification via channel, identification codes, authentication, authentication codes

Short Description:
A Certain equivalence of identification and authentication would be shown.

Description

It would be shown that under suitable formulations (preserving all salient features) the two problem of Identification (Ahlswede and Dueck, 1989) and Authentication (Simmons, G. J. 1984) are in essence very close to each other. This equivalency was conjectured first by M. S. Pinsker. In this research internship the student is expected to address this conjecture. Both problems must be studied separately and then the similar essence of them should be drawn out. In particular the identification codes and authentication codes along with theire relation will be investigated.

Prerequisites

Background in Information Theory and Channel Coding
Familiarity with fundamentals of Identification Theory

References:

Simmons, G. J. 1984, “Message authentication: a game on hypergraphs,” Congressus Numer. 45:161-192.
Simmons, G. J. 1982, “A game theory model of digital message authentication,” Congressus Numer., 34, 413-424
Simmons, G. J. 1985, “Authentication theory/coding theory,” in: Advances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science, vol. 196, Springer-Verlag, Berlin, pp. 411-432.
E. Gilbert, F. J. MacWilliams and N.J. A. Sloane, 1974, “Codes which detect deception,” Bell System Tech. J., 53, 405-424.
R. Ahlswede and G. Dueck, “Identification via channels,” in IEEE Trans. on Inf. Theory, vol. 35, no. 1, pp. 15-29, Jan. 1989, doi: 10.1109/18.42172.
L. A. Bassalygo, M. V. Burnashev, “Authentication, Identification, and Pairwise Separated Measures”, Problems Inform. Transmission, 32:1 (1996), 33–39

Supervisor:

Mohammad Salariseddigh

✔----

Identification Over The Binary Symmetric Channel

Diese Seite als PDF öffnen.

Identification Over The Binary Symmetric Channel

Keywords:
Identification via channels

Description

Student should attempt to derive forward and backward proof for deterministic identification capacity of the Binary Symmetric Channel (BSC).

Prerequisites

Basics of Information and identification theory.

Supervisor:

Mohammad Salariseddigh

Theses in Progress

Research Interests

Information Theory
Molecular Information Theory
Shannon Theory
Identification Theory
Coding Theory
Machine Learning
Communication Theory
Molecular and Nano Communications
Cooperative Communications

Publications

2020
2019

2020

Salariseddigh, Mohammad J.: Identification Without Randomization. Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), 2020 more…
Salariseddigh, Mohammad J.: Deterministic Identification. NEWCOM Workshop, 2020 more…
Salariseddigh, Mohammad J.: Deterministic Identification. 2020 Munich Doctoral Seminar on Communications, 2020 more…

2019

Salariseddigh, Mohammad J.: An Introduction to Identification. NEWCOM Workshop, 2019 more…
Salariseddigh, Mohammad J.: An Introduction to Identification. Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), 2019 more…