15 February 2022 in Physical Review A
A set of multipartite orthogonal quantum states is strongly nonlocal if it is locally irreducible for every bipartition of the subsystems [S. Halder, M. Banik, S. Agrawal, and S. Bandyopadhyay, Phys. Rev. Lett. 122, 040403 (2019)]. Although this property has been shown in three-, four-, and five-partite systems, the existence of strongly nonlocal sets in -partite systems remains unknown when . In this paper, we successfully show that a strongly nonlocal set of orthogonal entangled states exists in for all and , which reveals the strong quantum nonlocality in general -partite systems. For or 4 and , we present a strongly nonlocal set consisting of genuinely entangled states, which has a smaller size than any known strongly nonlocal orthogonal product set. Finally, we connect strong quantum nonlocality with local hiding of information as an application.
29 March 2023 in IEEE Transactions on Information Theory
Reconstruction codes are generalizations of error-correcting codes that can correct errors by a given number of noisy reads. The study of such codes was initiated by Levenshtein in 2001 and developed recently due to applications in modern storage devices such as racetrack memories and DNA storage. The central problem on this topic is to design codes with redundancy as small as possible for a given number $N$ of noisy reads. In this paper, the minimum redundancy of such codes for binary channels with exactly two insertions is determined asymptotically for all values of $N\ge 5$ . Previously, such codes were studied only for channels with single edit errors or two-deletion errors.
9 September 2025 in IEEE Transactions on Information Theory
In this paper, we investigate codes designed to correct two bursts of deletions, where each burst has a length of exactly $b$ , where $b\gt 1$ . The previous best construction, achieved through the syndrome compression technique, had a redundancy of at most $7\log n+O\left ({{ \log n/\log \log n }}\right)$ bits. In contrast, our work introduces a novel approach for constructing $q$ -ary codes that attain a redundancy of at most $5\log n+O(\log \log n)$ bits for all $b\gt 1$ and $q\ge 2$ . Additionally, for the case where $b=1$ , we present a new construction of $q$ -ary two-deletion correcting codes with a redundancy of $5\log n+O(\log \log n)$ bits, for all $q\gt 2$ .
8 November 2019 in IEEE Transactions on Information Theory
Splitter sets have been widely studied due to their applications in flash memories, and their close relations with lattice tilings and conflict avoiding codes. In this paper, we give necessary and sufficient conditions for the existence of nonsingular perfect splitter sets, B-k1; k2(p) sets, where ≤ 0 k1 ≤ k2 = 4. Meanwhile, constructions of nonsingular perfect splitter sets are given. When perfect splitter sets do not exist, we present four new constructions of quasi-perfect splitter sets. Finally, we give a connection between nonsingular splitter sets and Cayley graphs, and as a byproduct, a general lower bound on the maximum size of nonsingular splitter sets is given.
15 September 2023 in IEEE Transactions on Information Theory
Motivated by applications in polymer-based data storage, we study the problem of reconstructing a string from part of its composition multiset. We give a full description of strings that cannot be uniquely reconstructed up to reversal from their multisets of all the prefix-suffix compositions. Leveraging this description, we prove that for all $n \geqslant 6$ , there exists a string of length $n$ that cannot be uniquely reconstructed up to reversal. Moreover, for all $n \geqslant 6$ , we explicitly construct the set consisting of all length $n$ strings that can be uniquely reconstructed up to reversal. As a byproduct, we obtain that any binary string can be constructed using Dyck strings and Catalan-Bertrand strings. For any given string $ \mathbf {s}$ , we provide a method to explicitly construct the set of all strings with the same prefix-suffix composition multiset as $ \mathbf {s}$ , as well as a formula for the size of this set. Furthermore, we construct two classes of composition codes that can respectively correct composition missing errors and mass-reducing substitution errors. In addition, we raise a new problem: reconstructing a string when only given its compositions of substrings of length at most $r$ . We give suitable codes under some conditions.
13 July 2021 in IEEE Transactions on Information Theory
This paper focuses on constructions of MDS self-dual codes from (extended) generalized Reed-Solomon (GRS) codes. Let $q = r^{2}$ be an odd prime power. We show that, there exists a $q$ -ary self-dual (extended) GRS code for each even length in the range $[{2r,3r-3}]$ , and for each singly even length in the range $[3r-1,4r]$ . This extends the only known consecutive range $[2,2r]$ to $[{2,3r-3}]$ for this case. Furthermore, our general constructions provide many MDS self-dual codes with new parameters which, to the best of our knowledge, were not reported before.