By participating in this course, the students obtain knowledge about recent developments in research of coding theory/channel coding and cryptography.
After successful completion, the students are able to familiarize with a scientific topic and summarize its core aspects. They can write scientific articles with appropriate structure and can present the core aspects in a short talk. Students have developed a general understanding of doing research and to contribute to a scientific discussion.
This seminar deals with current research developments in the area of coding theory, channel coding and cryptography. The explicit topic is chosen by each student from a list of offered topics that is updated every semester.
Each participants summarizes results, gives a scientific presentation and participates in a scientific discussion.
- Basic concepts of linear algebra
- Lecture "Channel Coding" recommended
- Optional: lectures "Security in Communications and Storage", "Coding Theory for Storage and Networks"
Teaching and learning methods
Each student obtains supervision by a scientific employee who introduces the student to scientific literature research and guides the student with writing the report. An introductory lecture presents basic concepts of scientific talks.
- Written thesis about results (30%)
- 20 minute oral presentation about given topic & results plus
10 minutes discussion (50%)
- own contributions in discussion (20%)
Recent applications of Levenshtein's reconstruction problem
Short Description: The student will familiarize themselves with the reconstruction problem, choose a recent work applying its principles, and present it to their peers.
Levenshtein presented in 2001 his reconstruction problem: given multiple noisy observations of the same information, can the original be deduced, and how? It is a problem applicable to many data storage and transmission scenarios, where multiple transmissions and/or reads are inherently available or else cheaper to obtain than the cost of added redundancy required for tranditional error-correction.
This framework has since seen many adaptations and applications in various contexts, for various channels. It is especially applicable to some novel storage technologies such as cloud storage, racetrack memories and DNA storage.
The student's taks is to research Levenshtein's seminal paper in addition to any recent application of their choosing (some suggestions herein), and present (an introduction to / a summary of) the underlying principles to their peers.
 V. I. Levenshtein, “Efficient reconstruction of sequences,” IEEE Trans. on Inform. Theory, vol. 47, no. 1, pp. 2–22, Jan. 2001.
 Y. Cassuto and M. Blaum, “Codes for symbol-pair read channels,” IEEE Trans. on Inform. Theory, vol. 57, no. 12, pp. 8011–8020, Dec. 2011.
 Y. M. Chee, H. M. Kiah, A. Vardy, V. K. Vu, and E. Yaakobi, “Coding for racetrack memories,” IEEE Trans. on Inform. Theory, vol. 64, no. 11, pp. 7094–7112, Nov. 2018.
 E. Yaakobi and J. Bruck, “On the uncertainty of information retrieval in associative memories,” IEEE Trans. on Inform. Theory, vol. 65, no. 4, pp. 2155–2165, Apr. 2019.
 Y. Yehezkeally and M. Schwartz, “Uncertainty of Reconstruction with List-Decoding from Uniform-Tandem-Duplication Noise,” IEEE Trans. on Inform. Theory, accepted for publication, Feb. 2021.
Basic knowledge of error-correcting codes and their applications. Control of basic mathematic notions (linear and abstract algebra) is assumed.