Picture of Mohammad Javad Salariseddigh

M.Sc. Mohammad Javad Salariseddigh

Technical University of Munich

Chair of Communications Engineering (Prof. Kramer)

Postal address

Postal:
Theresienstr. 90
80333 München

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

Teaching

Communication Systems [SS 20]

Research Interests

  • Post Shannon Theory 

Publications

Journal Papers

  1. S., Pereg, Boche, Deppe, Jamali and Shober, Deterministic Identification for Molecular Communications over the Poisson Channel. Submitted to IEEE Transactions on Communications, 2022.
  2. S., Pereg, Boche, and Deppe, Deterministic Identification Over Channels With Power Constraints., IEEE Transactions on Information Theory, 2021.

Conference Proceedings

  1. S., Pereg, Boche, Deppe, and Schober, Deterministic Identification Over Poisson ChannelsAccepted in IEEE Global Communications Conference (GLOBECOM), 2021.
  2. S., Pereg, Boche, and Deppe, Deterministic Identification Over Channels With Power ConstraintsProc. of IEEE International Conference on Communications (ICC), 2021.
  3. S., Pereg, Boche, and Deppe, Deterministic Identification Over Fading Channels.
    Proc. of IEEE Information Theory Workshop (ITW), 2020.

Preprints

  1. S., Pereg, Boche, Deppe, and Schober, Deterministic Identification Over Poisson Channels.,
    SubmittedarXiv, 2021.
  2. S., Pereg, Boche, and Deppe, Deterministic Identification Over Channels With Power Constraints.,
    SubmittedarXiv, 2021.
  3. S., Pereg, Boche, and Deppe, Deterministic Identification Over Fading Channels.,
    Submitted, arXiv, 2020.

Thesis

  • Master. Impact of Flow on The Channel Impulse Response of Molecular Communication Systems. Friedrich-Alexander-University Erlangen-Nürnberg, 2018.
  • Bachelor. Analysis and Simulation of Beamforming in Multiple P2P Communications Using a Network of Relays. Khajeh Nasir Toosi University of Technology (KNTU), 2014.

2022

  • Salariseddigh, Mohammad J.: Deterministic Identification for Molecular Communications over the Poisson Channel. Macroscopic Molecular Communication, 2022 more…
  • Salariseddigh, Mohammad J.; Pereg, Uzi; Boche, Holger; Deppe, Christian: Deterministic Identification Over Channels With Power Constraints. IEEE Transactions on Information Theory 68 (1), 2022, 1-24 more… Full text ( DOI )

2021

  • Salariseddigh, M. J. and Pereg, U. and Boche, H. and Deppe, C.: Deterministic Identification Over Channels With Power Constraints. IEEE International Conference on Communications (ICC), 2021 more… Full text ( DOI )
  • Salariseddigh, Mohammad J.: Deterministic Identification Over Poisson Channels. Munich Doctoral Seminar on Communications, 2021 more…
  • Salariseddigh, Mohammad Javad; Pereg, Uzi; Boche, Holger; Deppe, Christian; Schober, Robert: Deterministic identification over Poisson channels. 2021 IEEE Globecom: Workshop on Channel Coding beyond 5G, IEEE, 2021 more… Full text ( DOI )

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…
  • Salariseddigh, Mohammad J.; Pereg, Uzi; Boche, Holger; Deppe, Christian: Deterministic Identification Over Fading Channels. IEEE Information Theory Workshop (ITW), 2020 more… Full text ( DOI )

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…

Talks

  1. S., Deterministic Identification for Molecular Communications over the Poisson Channel,
    Macroscopic Molecular Communication, Feb 24, 2022, Hybrid, Slides
     
  2. S., Bounds For Deterministic Identification Capacity in Power-Constrained Poisson Channels,
    Munich Doctoral Seminar on Communications, Nov 17, 2021, Hybrid, Slides
     
  3. S., Deterministic Identification Over Poisson Channels,
    Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), July 19, 2021, Virtual, Slides
     
  4. S., Deterministic Identification,
    New Communications Workshop (NEWCOM), Nov 23, 2020, Virtual, Slides
     
  5. S., Deterministic Identification,
    Munich Doctoral Seminar on Communications, Nov 11, 2020, Hybrid, Slides
     
  6. S., Identification Without Randomization,
    Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), July 16, 2020, Virtual, Slides
     
  7. S., An Introduction to Identification,
    New Communications Workshop (NEWCOM), Feb 04, 2020, Virtual, Slides
     
  8. S., An Introduction to Identification,
    Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), Oct 29, 2019, In-Person, Slides
     
  9. S., Impact of Flow on the Channel Impulse Response of Molecular Communication Systems,
    Munich Doctoral Seminar on Communications, Oct 23 2019, In-Person

Available Theses

Geometry of The Information (Intro.)

Description

An introduction to geometric structures of the information will be given.

The seminar aims to know the notion of the 'information' through basic epistemic tools from geometry such as radius, dimension, etc.

Prerequisites

Contact

Interested students please contact me directly and send me a cv and transcripts of Bsc and Msc both.

Supervisor:

Mohammad Salariseddigh

Deterministic K-Identification For The DMC With Power Constraint

Keywords:
Identification via channel, K-identification, deterministic codes
Short Description:
K-identification capacity of a DMC is derived.

Description

The student attempt to study the deterministic identification capacity

of a DMC subject to power constraint and generalize it for the K-identification.

Prerequisites

Basics of Information Theory and Channel Coding.

Familiarity with the fundamentals of Identification Theory

Supervisor:

Mohammad Salariseddigh

Anticode (Intro.)

Short Description:
An introduction to anticode and its duality to the code would be given.

Description

The Anticode is understood in its own merit, then a code is understood as anti-anticode. Code-Anticode duality and known bounds on their size are investigated and presented.

Prerequisites

Basics of channel coding

Interested student are encouraged to contact me and send me a CV as well as all the academic transcripts and relevant courses that they have attended.

Contact

Interested students please contact me directly and send me a cv and transcripts of Bsc and Msc both.

Supervisor:

Mohammad Salariseddigh

Quantum Identification (Intro.)

Keywords:
Identification via (classical) channels, Identification via Quantum channels,
Short Description:
An introduction into the quantum identification will be presented. In particular, the quantum version of Ahlswede and Dueck theory of identification will be comprehended.

Description

Understanding of the following and present them

  1. Quantum and classical channel (similarities and differences)
  2. Classical message identification
  3. Quantum message identification

 

Student should study and touch the following paper:
 

  1. Winter, A., 2004. Quantum and Classical Message Identification via Quantum Channels. arXiv preprint quant-ph/0401060

  2. Winter, A., 2013. Identification via Quantum Channels. In Information Theory, Combinatorics, and Search Theory (pp. 217-233). Springer, Berlin, Heidelberg

In particular, non-classic features like superposition and entanglement are understood.

 

Prerequisites

Basics of

  1. Information Theory
  2. Identification Theory
  3. Quantum Theory

Contact

Interested students please contact me directly and send me a cv and transcripts of Bsc and Msc both.

Supervisor:

Mohammad Salariseddigh

Generalized Shannon Capacity (Intro.)

Keywords:
Sperner Theorem, Zero-Undetected-Error capacity, Zero-Error Capacity

Description

The student will study the fundamental result introduced for the Sperner capacity.

S/he start with understanding the Sperner Theorem.

The connection to Zero-Undetected-Error capacity will be investigated and it would be understood why and in which sense the Sperner capacity is called generalized zero error capaciy.

A conjecture of Ahlswede and its proof by other authors will be reviewed.

As well, the relation to r-cover families will be also considered.

Prerequisites

Interested students as first step should contact me directly and send me a CV as well as the academic transcripts and relevant courses that they have attended.

Also the Basics of below are required to be known:

  1. Graph Theory
  2. Zero Error Capacity
  3. r-Cover Familiy

 

Contact

Interested students please contact me directly and send me a cv and transcripts of Bsc and Msc both.

Supervisor:

Mohammad Salariseddigh

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:

  1. Shannon Capacity of A Graph
  2. Zero-Error Capacity
  3. Zero-Error Applications (Perfect Hash Function, Superimposed Codes)
  4. Sperner Capacity
  5. Lovasz Number
  6. Haemers Bound
  7. Confusability Graph
  8. Hyper-graph Capacity
  9. Graph Alphabets:
  • Independenc Number
  • Chromatic Number
  • Graph Entropy
  • Graph Powers

Prerequisites

Interested students as first step should contact me directly and send me a CV as well as the academic transcripts and relevant courses that they have attended.

Also the Basics of below are required to be known:

  1. Information Theory
  2. Graph Theory
  3. Coding Theory
  4. Channel Coding

Contact

References:

  1. Alon, N. "The Shannon Capacity of a Union." Combinatorica 18, 301-310, 1998.
  2. Haemers, W. "An Upper Bound for the Shannon Capacity of a Graph." In Algebraic Methods in Graph Theory. Szeged, Hungary: pp. 267-272, 1978.
  3. Lovász, L. "On the Shannon Capacity of a Graph." IEEE Trans. Inform. Th. IT-25, 1-7, 1979.
  4. Shannon, C. E. "The Zero-Error Capacity of a Noisy Channel." IRE Trans. Inform. Th. 2, 8-19, 1956.
  5. 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.
  6. Korner, Janos, and Alon Orlitsky. "Zero-error information theory." IEEE Trans. Inform. Th. IT-25, no. 6 (1998): 2207-2229.

 

Interested students please contact me directly and send me a cv and transcripts of Bsc and Msc both.

Supervisor:

Mohammad Salariseddigh

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

Interested student are encouraged to contact me and send me a CV as well as all the academic transcripts and relevant courses that they have attended.

As well familiarity with the following is required:

Background in Information Theory and Channel Coding

Familiarity in fundamentals of Identification Theory

Supervisor:

Mohammad Salariseddigh

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

Interested student are encouraged to contact me and send me a CV as well as all the academic transcripts and relevant courses that they have attended.

As well familiarity with the Basics of following is required:

  1. information/identification theory
  2. channel coding
  3. prime number theorem (Chebyshev)

Supervisor:

Mohammad Salariseddigh

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

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

 

References:

  1. Simmons, G. J. 1984, “Message authentication: a game on hypergraphs,” Congressus Numer. 45:161-192.
  2. Simmons, G. J. 1982, “A game theory model of digital message authentication,”  Congressus Numer., 34, 413-424
  3. 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.
  4. E. Gilbert, F. J. MacWilliams and N.J. A. Sloane, 1974, “Codes which detect deception,” Bell System Tech. J., 53, 405-424.
  5. 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.
  6. L. A. Bassalygo, M. V. Burnashev, “Authentication, Identification, and Pairwise Separated Measures”, Problems Inform. Transmission, 32:1 (1996), 33–39

Supervisor:

Mohammad Salariseddigh

Theses in Progress

Supervised Items

Master Seminar

  1. Introduction to Zero-Error Identification,
    Student: Anmoal Porwal,
    Completed Date: 05.02.2021.
     
  2. Universal Hashing and Binary Constant WeightCodes for Identification via Channels,
    Student: Mohamed Zied Belkhiria,
    Completed Date: 09.07.2020.

Bachelor Thesis

  1. Deterministic K-Identification For The Slow Fading Channel With Power Constraint,
    Student: Muris Spahovic,
    Completed Date: 25.05.2022.
     
  2. Complexity of The Identification,
    Student: Mohammed Hazim Bin Halim,
    Completed Date: 20.04.2022.
     
  3. Deterministic Identification For The Binary Symmetric Channel,
    Student: Ons Dabbabi,
    Completed Date: 17.03.2022.
     
  4. Identification of Zeros of a Function,
    Student: Feriel Fendri,
    Completed Date: 02.11.2020.
     
  5. Simulation and Analysis of Finite Block-length Wiretap Codes by Autoencoders
    Student: Souleima Abdelghani,
    Completed Date: 08.09.2020.

Internship

  1. Realization of Identification via Reed-Solomon Codes,
    Student: Mahmoud Kallel,
    Completed Date: 18.06.2020.