My research interests focus on digital communications in general and error control coding in particular. I am generally attracted by everyday problems that can be tackled by applied math. Error control codes are certainly one of the most beautiful and practically relevant intersections between mathematics and engineering. I am sure that nobody can escape the fascination of building practical systems — based on finite fields as manageable surrogates for the real and complex numbers — that can cope with the inherent imperfectness of physical transmission channels.
Most of my studies, work, and research so far have been centered around digital communications, error control coding, and networks. These fields have already given us smart mobile phones, the Internet, and worldwide accessible cloud data storage; I believe that they still have the potential to further improve our daily experience with telecommunications and data handling. Besides the aforementioned main areas, I also reach out to fields such as information theory, cryptography, FPGA design, data storage systems, flash memories, and cellular automata in order to discover new applications and to reveal unsolved problems. I am interested in the whole chain of research; that is, understanding the mathematical foundations and physical constraints, designing and optimizing algorithms, and eventually working out new applications and products.
My current research interests are:
- Error control coding
- Codes for fiber-optical high-speed networks
- Codes for distributed data storage
- Codes for flash memories
- Efficient VLSI implementations
- Digital communications
- Telecommunications systems, networking
- Embedded security
- C. Senger, “CRC error detection for CAN XL,” in 17th international CAN Conference (iCC), Baden-Baden, Germany, 2020.
- C. Senger, “Improved Iterative Decoding of Product Codes Based on Trusted Symbols,” in 2019 IEEE International Symposium on Information Theory (ISIT), 2019, pp. 1342–1346 [Online]. Available: https://ieeexplore.ieee.org/document/8849469
- C. Senger, “On List Decoding of Generalized Reed-Solomon Codes Under Partial Codeword Knowledge,” in SCC 2019; 12th International ITG Conference on Systems, Communications and Coding, 2019, pp. 1–5 [Online]. Available: https://ieeexplore.ieee.org/document/8661300
- C. Senger and R. Bohara, “A Linear Algebraic Approach to Subfield Subcodes of GRS Codes,” in 2018 IEEE International Symposium on Information Theory (ISIT), 2018, pp. 6–10 [Online]. Available: https://ieeexplore.ieee.org/document/8437645
- C. Senger and H. K. Shivakumar, “Subfield Subcodes of Tamo–Barg Locally Recoverable Codes,” in 2018 29th Biennial Symposium on Communications (BSC), 2018, pp. 1–5 [Online]. Available: https://ieeexplore.ieee.org/document/8494698
- C. Senger and F. R. Kschischang, “Syndrome-based Decoding of Evaluation Codes without Chien Search,” in 28th Biennial Symposium on Communications (BSC 2016), Kelowna, BC, Canada, 2016.
- C. Senger, V. Sidorenko, and A. Chaaban, “On multi-trial Forney-Kovalev decoding of concatenated codes,” Advances in Mathematics of Communications, vol. 8, no. 1, pp. 1--20, 2014 [Online]. Available: https://doi.org/10.3934%2Famc.2014.8.1
- C. Senger, “Sierpinski Prefactors in the Guruwami-Sudan Interpolation Step,” in 2014 International Zurich Seminar on Communications, Zurich, Switzerland, 2014, pp. 83–86 [Online]. Available: http://e-collection.library.ethz.ch/eserv/eth:8192/eth-8192-01.pdf
- D. E. Lazich, C. Senger, and M. Bossert, “A Corrected Disproof of the Strong Simplex Conjecture,” in SCC 2013; 9th International ITG Conference on Systems, Communication and Coding, 2013, pp. 1–5 [Online]. Available: https://ieeexplore.ieee.org/document/6469334
- C. Senger, A. Zeh, Y. Fan, and S. Schober, “Adaptive End-to-End Network Coding based on Algebraic Codes,” in First International Workshop on Performance Evaluation and Modeling in Wireless Networks (PEMWN2012), Tunis, Tunisia, 2012.
- J. H. Weber, V. R. Sidorenko, C. Senger, and K. A. S. Abdel-Ghaffar, “Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff,” Problems of Information Transmission, vol. 48, no. 4, pp. 324--333, 2012 [Online]. Available: https://doi.org/10.1134/S0032946012040023
- V. R. Sidorenko, C. Senger, and M. Bossert, “Decoding in Weighted Combinatorial Metric,” in International Mathematical Conference “50 Years of IPPI,” Moscow, Russia, 2011.
- C. Senger, V. R. Sidorenko, S. Schober, M. Bossert, and V. V. Zyablov, “Adaptive single-trial error/erasure decoding of binary codes,” in 2010 International Symposium On Information Theory Its Applications, 2010, pp. 267–272 [Online]. Available: https://ieeexplore.ieee.org/document/5648959
- C. Senger, V. R. Sidorenko, M. Bossert, and V. V. Zyablov, “Multitrial decoding of concatenated codes using fixed thresholds,” Problems of Information Transmission, vol. 46, no. 2, pp. 127--141, 2010 [Online]. Available: https://doi.org/10.1134/S0032946010020031
- V. Sidorenko, and Christian Senger, M. Bossert, and V. Zyablov, “Single-trial decoding of concatenated codes using fixed or adaptive erasing,” Advances in Mathematics of Communications, vol. 4, no. 1, pp. 49--60, 2010 [Online]. Available: https://doi.org/10.3934%2Famc.2010.4.49
- C. Senger, V. R. Sidorenko, and V. V. Zyablov, “On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel,” in XII International Symposium on Problems of Redundancy in Information and Control Systems, St. Petersburg, Russia, 2009, pp. 155–163.
- C. Senger, “Optimized Error/Erasure Bounded Minimum Distance Decoding for the AWGN Channel,” in IEEE Information Theory Winter School 2009, Loen, Norway, 2009.
- C. Senger, V. Sidorenko, M. Bossert, and V. Zyablov, “Decoding generalized concatenated codes using Interleaved Reed-Solomon codes,” in 2008 IEEE International Symposium on Information Theory, 2008, pp. 1808–1812 [Online]. Available: https://ieeexplore.ieee.org/document/4595300
- G. Richter, C. Senger, and M. Bossert, “Description and Decoding of q-cyclic Rank Codes,” in 7th International ITG Conference on Source and Channel Coding, 2008, pp. 1–6 [Online]. Available: https://ieeexplore.ieee.org/document/5755959
- V. R. Sidorenko, C. Senger, M. Bossert, and V. V. Zyablov, “Single-Trial Adaptive Decoding of Concatenated Codes,” in 11th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT2008), Pamporovo, Bulgaria, 2008, pp. 260–266 [Online]. Available: http://www.moi.math.bas.bg/acct2008/b44.pdf
Since winter term 2016/2017, I teach the mandatory undergrad course Grundlagen der Programmierung (in German) each winter. Course material is be provided on University of Stuttgart's E-learning plattform ILIAS and the university's Github Enterprise Server.
Since summer term 2016, I teach a grad course on Error Control Coding: Algebraic and Convolutional Codes (in English) each summer. Course material is provided on University of Stuttgart's E-learning platform ILIAS.
Christian Senger (IEEE S'05-M'11) is an Akademischer Oberrat at the Institute of Telecommunications at the University of Stuttgart. He received a diploma degree (M.Sc. equiv.) in Computer Science from Universität Karlsruhe (now Karlsruhe Institute of Technology) in 2006 and a Dr.-Ing. degree (Ph.D. equiv.) in Electrical Engineering from Ulm University in 2011. From May 2013 to October 2015, he was a postdoctoral research fellow at the Communications Group at the University of Toronto. His main field of interest is error control coding with its modern applications in fiber-optical high-speed networks, distributed data storage, and flash memories.