More Like this

1. Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes

   https://doi.org/10.1109/isit44484.2020.9174255  

   Sultana, Rumia ; Chou, Remi A. ( June 2020 , 2020 IEEE International Symposium on Information Theory (ISIT))
2. Explicit Low-complexity Codes for Multiple Access Channel Resolvability

   https://doi.org/10.1109/ALLERTON.2019.8919797  

   Sultana, Rumia ; Chou, Remi A. ( September 2019 , 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton))
3. Strong Secrecy for Interference Channels Based on Channel Resolvability

   https://doi.org/10.1109/TIT.2018.2834508  

   Wang, Zhao ; Schaefer, Rafael F. ; Skoglund, Mikael ; Xiao, Ming ; Poor, H. Vincent ( July 2018 , IEEE Transactions on Information Theory)
4. Resolvability of the Multiple Access Channel with Two-Sided Cooperation

   https://doi.org/10.1109/ISIT44484.2020.9174302  

   Helal, Noha ; Bloch, Matthieu ; Nosratinia, Aria ( June 2020 , IEEE International Symposium on Information Theory (ISIT))
5. Levenshtein graphs: Resolvability, automorphisms & determining sets

   https://doi.org/10.1016/j.disc.2022.113310  

   Ruth, Perrin E. ; Lladser, Manuel E. ( May 2023 , Discrete Mathematics)

   We introduce the notion of Levenshtein graphs, an analog to Hamming graphs but using the edit distance instead of the Hamming distance; in particular, vertices in Levenshtein graphs may be strings (i.e., words or sequences of characters in a reference alphabet) of possibly different lengths. We study various properties of these graphs, including a necessary and sufficient condition for their shortest path distance to be identical to the edit distance, and characterize their automorphism group and determining number. We also bound the metric dimension (i.e. minimum resolving set size) of Levenshtein graphs. Regarding the latter, recall that a run is a string composed of identical characters. We construct a resolving set of two-run strings and an algorithm that computes the edit distance between a string of length k and any single-run or two-run string in operations. 

   more » « less