Tyler Kann

Accepted

1. S. Guo, T. Kann, T. Baluta, and M. R. Bloch, “Covert Multi-bit LLM Watermarking: An Information Theory and Coding Approach.” accepted to IEEE Information Theory WOrkshop, Jul. 2026.

   @misc{Guo2026Covert, author = {Guo, Sidong and Kann, Tyler and Baluta, Teodora and Bloch, Matthieu R.}, howpublished = {accepted to \emph{IEEE Information Theory WOrkshop}}, month = jul, title = {Covert Multi-bit LLM Watermarking: An Information Theory and Coding Approach}, year = {2026}, eprint = {2605.16709} }

2. T. Kann, S. Kudekar, and M. R. Bloch, “Quantum Precoded Polar Codes.” accepted to IEEE Information Theory Workshop, May 2026.

   @misc{Kann2026Quantum, author = {Kann, Tyler and Kudekar, Srinivas and Bloch, Matthieu R.}, howpublished = {accepted to \emph{IEEE Information Theory Workshop}}, month = may, title = {Quantum Precoded Polar Codes}, year = {2026}, eprint = {2605.12796}, groups = {NSF2148400} }

3. T. Kann, M. R. Bloch, S. Kudekar, and R. Urbanke, “Stabilizer-Code Channel Transforms Beyond Repetition Codes for Improved Hashing Bounds.” accepted to IEEE International Symposium on Information Theory, Mar. 2026.

   @misc{Kann2026Stabilizer, author = {Kann, Tyler and Bloch, Matthieu R. and Kudekar, Shrinivas and Urbanke, Ruediger}, howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}}, month = mar, title = {Stabilizer-Code Channel Transforms Beyond Repetition Codes for Improved Hashing Bounds}, year = {2026}, eprint = {2601.15505} }

Conference proceedings

1. T. Kann, S. Kudekar, and M. Bloch, “A Path Metric Based Construction of Polarization-Adjusted Convolutional Codes,” in Proc. of IEEE International Symposium on Information Theory, Athens, Greece, Jul. 2024, pp. 2406–2411.

   @inproceedings{Kann2024Path, author = {Kann, Tyler and Kudekar, Shrinivas and Bloch, Matthieu}, booktitle = {Proc. of IEEE International Symposium on Information Theory}, title = {A Path Metric Based Construction of Polarization-Adjusted Convolutional Codes}, year = {2024}, address = {Athens, Greece}, month = jul, pages = {2406--2411}, doi = {10.1109/ISIT57864.2024.10619693}, groups = {NSF2148400}, howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}} }

2. T. Kann, S. Kudekar, and M. R. Bloch, “Source Polarization-Adjusted Convolutional Codes,” in Proc. of IEEE International Symposium on Information Theory, Taipei, Taiwan, Jun. 2023, pp. 1896–1901.

   Motivated by applications to low-latency secret key generation in physical-layer security, we study Polarization-Adjusted Convolutional (PAC) codes for source coding with side information. Source PAC codes operate in a dual manner to channel PAC codes by introducing a rate-one convolutional code after the polarization transform. The decoding of source PAC codes requires a careful scheduling of the successive cancellation decoder and a careful optimization of the rate profiling. Our empirical results demonstrate the improved performance of source PAC codes over regular polar codes using Successive Cancellation List (SCL) decoding. We illustrate the performance in terms for key generation rate in a secret-key generation setup over an Additive White Gaussian Noise (AWGN) channel, suggesting that PAC codes could improve the performance of physical-layer security schemes at short blocklength.

   @inproceedings{Kann2023Source, author = {Kann, Tyler and Kudekar, Shrinivas and Bloch, Matthieu R.}, booktitle = {Proc. of IEEE International Symposium on Information Theory}, title = {Source Polarization-Adjusted Convolutional Codes}, year = {2023}, address = {Taipei, Taiwan}, month = jun, pages = {1896-1901}, doi = {10.1109/ISIT54713.2023.10206454}, file = {:2021-Kann-ISIT-Source Polarization-Adjusted Convolutional Codes.pdf:PDF}, groups = {NSF2148400}, howpublished = {accepted to \emph{2023 IEEE International Symposium on Information Theory}} }