S., Pereg, Boche, Deppe, and Schober, Deterministic Identification Over Poisson Channels., Submitted, arXiv, 2021.
S., Pereg, Boche, and Deppe, Deterministic Identification Over Channels With Power Constraints., Submitted, arXiv, 2021.
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.
Talks
S., Bounds For Deterministic Identification Capacity in Power-Constrained Poisson Channels, Munich Doctoral Seminar on Communications, Nov 17, 2021, Hybrid, Slides
S., Deterministic Identification Over Poisson Channels, Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), July 19, 2021, Virtual, Slides.
S., Deterministic Identification, New Communications Workshop (NEWCOM), Nov 23, 2020, Virtual, Slides.
S., Deterministic Identification, Munich Doctoral Seminar on Communications, Nov 11, 2020, Hybrid, Slides.
S., Identification Without Randomization, Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), July 16, 2020, Virtual, Slides.
S., An Introduction to Identification, New Communications Workshop (NEWCOM), Feb 04, 2020, Virtual, Slides.
S., An Introduction to Identification, Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), Oct 29, 2019, In-Person, Slides
S., Impact of Flow on the Channel Impulse Response of Molecular Communication Systems, Munich Doctoral Seminar on Communications, Oct 23 2019, In-Person.
Deterministic K-Identification For The Slow Fading Channel With Power Constraint
Keywords: Slow Fading, Identification via Channels, Deterministic Codes
Short Description: Bounds on the K-identification capacity in the absence of randomization for the class of slow fading channel would be derived analysis of the encoding/decoding procedure in terms of simulation in Matlab will be provided.
Description
The student try to study the standard identification capacity of slow fading channel
and then develop those techniques for the a more general scope of K object (kK-identification) and attemps to derive lower/upper bounds for the K-identification capacity in the deterministic regime.
Further the student implemet a simple program in Matlab to verify and anaylse the
error of type I and II for a certain range of finite block-length values. The simulation is a sanity check to verify the encoding/decoding methodology.
Prerequisites
Familiarity with fundamentals of identification theory and coding.
Supervisor:
Mohammad Salariseddigh
✔----
Deterministic K-Identification For The DMC With Power Constraint
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.
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
Quantum and classical channel (similarities and differences)
Classical message identification
Quantum message identification
Student should study and touch the following paper:
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.
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:
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:
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:
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
--✔--
On the Equivalence of Identification and Authentication
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
Keywords: Communication Complexity, Identification Via Channels
Short Description: A complete survey on the Communication Complexity is provided. In particular, the complexity of identification problem in different regimes would be understood and proved.
Description
The problem of Identification (Ahlswed-Dueck 19898) is investigated from a complexity point of view its communication complexity for different regimes (deterministic, randomized, one-way, two-way) would be examined and determined. Further a compete survey on the Communicaiton Complexity itself for well-known problems (primality check, set intersection, Gap Hamming distance, etc) along with fundamental lower/upper bounds on the complexity of a general communicaion matrix will be provided.
Prerequisites
Interested student should 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:
Basics of information/identification theory
Basic of communication complexity
Supervisor:
Mohammad Salariseddigh
✔----
Deterministic Identification For The Binary Symmetric Channel
