Zobrazeno 1 - 10
of 377
pro vyhledávání: '"V. Arvind"'
Autor:
Rameshwar, V. Arvind, Lalitha, V.
In this paper, we revisit the Recursive Projection-Aggregation (RPA) decoder, of Ye and Abbe (2020), for Reed-Muller (RM) codes. Our main contribution is an explicit upper bound on the probability of incorrect decoding, using the RPA decoder, over a
Externí odkaz:
http://arxiv.org/abs/2412.08129
This paper considers the $\varepsilon$-differentially private (DP) release of an approximate cumulative distribution function (CDF) of the samples in a dataset. We assume that the true (approximate) CDF is obtained after lumping the data samples into
Externí odkaz:
http://arxiv.org/abs/2409.18573
Autor:
Rameshwar, V. Arvind, Weinberger, Nir
We investigate the fundamental limits of reliable communication over multi-view channels, in which the channel output is comprised of a large number of independent noisy views of a transmitted symbol. We consider first the setting of multi-view discr
Externí odkaz:
http://arxiv.org/abs/2405.07264
Autor:
Rameshwar, V. Arvind, Tandon, Anshoo
This paper considers the private release of statistics of several disjoint subsets of a datasets. In particular, we consider the $\epsilon$-user-level differentially private release of sample means and variances of sample values in disjoint subsets o
Externí odkaz:
http://arxiv.org/abs/2405.06261
This paper develops an algorithmic approach for obtaining estimates of the weight enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the partition functions of spin systems, which in turn employs a sampler tha
Externí odkaz:
http://arxiv.org/abs/2403.05893
Autor:
Rameshwar, V. Arvind, Tandon, Anshoo, Gupta, Prajjwal, Singh, Aditya Vikram, Chakraborty, Novoneel, Sharma, Abhay
This paper considers the problem of the private release of sample means of speed values from traffic datasets. Our key contribution is the development of user-level differentially private algorithms that incorporate carefully chosen parameter values
Externí odkaz:
http://arxiv.org/abs/2401.15906
This paper develops an algorithmic approach for obtaining approximate, numerical estimates of the sizes of subcodes of Reed-Muller (RM) codes, all of the codewords in which satisfy a given constraint. Our algorithm is based on a statistical physics t
Externí odkaz:
http://arxiv.org/abs/2309.08907
Autor:
Rameshwar, V. Arvind, Kashyap, Navin
In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures. In our first approach, we compute the sizes of constrained subcodes of linear codes. Since there exist well-known linear codes that achieve vanishing
Externí odkaz:
http://arxiv.org/abs/2301.05098
Autor:
Rameshwar, V. Arvind, Kashyap, Navin
The paper considers coding schemes derived from Reed-Muller (RM) codes, for transmission over input-constrained memoryless channels. Our focus is on the $(d,\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s
Externí odkaz:
http://arxiv.org/abs/2211.05513
Autor:
Rameshwar, V. Arvind, Kashyap, Navin
In this work, we address the question of the largest rate of linear subcodes of Reed-Muller (RM) codes, all of whose codewords respect a runlength-limited (RLL) constraint. Our interest is in the $(d,\infty)$-RLL constraint, which mandates that every
Externí odkaz:
http://arxiv.org/abs/2205.04153