arXiv subjects

Siddhartha Kumar

Publications and source records attributed to Siddhartha Kumar.

23 records · Page 2Linked to original sources

arXiv2018

An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes

We propose a private information retrieval (PIR) protocol for distributed storage systems with noncolluding nodes where data is stored using an arbitrary linear code. An expression for the PIR rate, i.e., the ratio of the amount of retrieved data per unit of downloaded data, is derived, and a necessary and a sufficient condition for codes to achieve the maximum distance separable (MDS) PIR capacity are given. The necessary condition is based on the generalized Hamming weights of the storage code, while the sufficient condition is based on code automorphisms. We show that cyclic codes and Reed-Muller codes satisfy the sufficient condition and are thus MDS-PIR capacity-achieving.

cs.IT↗

arXiv2017

Private Information Retrieval in Distributed Storage Systems Using an Arbitrary Linear Code

We propose an information-theoretic private information retrieval (PIR) scheme for distributed storage systems where data is stored using a linear systematic code of rate $R > 1/2$. The proposed scheme generalizes the PIR scheme for data stored using maximum distance separable codes recently proposed by Tajeddine and El Rouayheb for the scenario of a single spy node. We further propose an algorithm to optimize the communication price of privacy (cPoP) using the structure of the underlying linear code. As an example, we apply the proposed algorithm to several distributed storage codes, showing that the cPoP can be significantly reduced by exploiting the structure of the distributed storage code.

cs.IT↗

arXiv2016

Secure Repairable Fountain Codes

In this letter, we provide the construction of repairable fountain codes (RFCs) for distributed storage systems that are information-theoretically secure against an eavesdropper that has access to the data stored in a subset of the storage nodes and the data downloaded to repair an additional subset of storage nodes. The security is achieved by adding random symbols to the message, which is then encoded by the concatenation of a Gabidulin code and an RFC. We compare the achievable code rates of the proposed codes with those of secure minimum storage regenerating codes and secure locally repairable codes.

cs.IT↗

arXiv2015

A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity

We present the construction of a new family of erasure correcting codes for distributed storage that yield low repair bandwidth and low repair complexity. The construction is based on two classes of parity symbols. The primary goal of the first class of symbols is to provide good erasure correcting capability, while the second class facilitates node repair, reducing the repair bandwidth and the repair complexity. We compare the proposed codes with other codes proposed in the literature.

cs.IT↗

arXiv2013

Probing long-range correlations in the Berezinskii-Kosterlitz-Thouless fluctuation regime of ultra-thin NbN superconducting films using transport noise measurements

We probe the presence of long-range correlations in phase fluctuations by analyzing the higher-order spectrum of resistance fluctuations in ultra-thin NbN superconducting films. The non-Gaussian component of resistance fluctuations is found to be sensitive to film thickness close to the transition, which allows us to distinguish between mean field and Berezinskii-Kosterlitz-Thouless (BKT) type superconducting transitions. The extent of non-Gaussianity was found to be bounded by the BKT and mean field transition temperatures and depend strongly on the roughness and structural inhomogeneity of the superconducting films. Our experiment outlines a novel fluctuation-based kinetic probe in detecting the nature of superconductivity in disordered low-dimensional materials.

cond-mat.supr-con↗