Contributed and Invited Presentations
Analytical Calculation Formulas for Capacities of Classical and Classical-Quantum Channels [virtual]
SwiftAgg: Communication-Efficient and Dropout-Resistant Secure Aggregation for Federated Learning With Worst-Case Security Guarantees
On Homopolymers and Secondary Structures Avoiding, Reversible, Reversible-Complement and GC-Balanced DNA Codes
Most DNA sequencing technologies are based on the shotgun paradigm: many short reads are obtained from random unknown locations in the DNA sequence. A fundamental question, studied in , is what read length and coverage depth (i.e., the total number of reads) are needed to guarantee reliable sequence reconstruction. Motivated by DNA-based storage, we study the coded version of this problem; i.e., the scenario in which the DNA molecule being sequenced is a codeword from a predefined codebook. Our main result is an exact characterization of the capacity of the resulting shotgun sequencing channel as a function of the read length and coverage depth. In particular, our results imply that while in the uncoded case, O(n) reads of length greater than 2logn are needed for reliable reconstruction of a length n binary sequence, in the coded case, only O(n/logn) reads of length greater than log n are needed for the capacity to be arbitrarily close to 1.
We characterize upper and lower bounds for the covert capacity of lossy thermal-noise bosonic channels when measuring covertness using fidelity and trace distance. Although we fall short of characterizing the exact covert capacity, we also provide bounds on the number of secret-key bits required to achieve covertness. The bounds are established by combining recent quantum information theory results in separable Hilbert spaces, including position based coding (Oskouei et al., arXiv: 1804.08144), convex splitting (Khatri et al., arXiv: 1910.03883), and perturbation theory (Grace and Guha, arXiv: 2106.05533).