#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2008

2017

- This year (0)
- Last 5 years (5)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We test whether two sequences are generated by the same distribution or by two different ones. Unlike previous work, we make no assumptions on the distributionsâ€™ support size. Additionally, weâ€¦ (More)

Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types

- Hirakendu Das, Alexander Vardy
- 2009 IEEE International Symposium on Informationâ€¦
- 2009

The probability of error in the Koetter-Vardy algebraic soft-decoding algorithm for Reed-Solomon codes is determined by the multiplicity assignment scheme used. A multiplicity assignment schemeâ€¦ (More)

We study the problems of classification and closeness testing. A classifier associates a test sequence with the one of two training sequences that was generated by the same distribution. A closenessâ€¦ (More)

Symmetric distribution properties such as support size, support coverage, entropy, and proximity to uniformity, arise in many applications. Recently, researchers applied different estimators andâ€¦ (More)

- Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan
- SIAM J. Discrete Math.
- 2015

Motivated by mass-spectrometry protein sequencing, we consider a simply-stated problem of reconstructing a string from the multiset of its substring compositions. We show that all strings of lengthâ€¦ (More)

- Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh
- Electronic Colloquium on Computational Complexity
- 2016

The advent of data science has spurred interest in estimating properties of distributions over large alphabets. Fundamental symmetric properties such as support size, support coverage, entropy, andâ€¦ (More)

- Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh
- 2013 IEEE International Symposium on Informationâ€¦
- 2013

Over the past decade, several papers, e.g., [1-7] and references therein, have considered universal compression of sources over large alphabets, often using patterns to avoid infinite redundancy.â€¦ (More)

- Jayadev Acharya, Hirakendu Das, Alon Orlitsky
- NIPS
- 2012

The minimax KL-divergence of any distribution from all distributions in a collection P has several practical implications. In compression, it is called redundancy and represents the least additionalâ€¦ (More)

- Jayadev Acharya, Hirakendu Das, Hosein Mohimani, Alon Orlitsky, Shengjun Pan
- 2010 IEEE International Symposium on Informationâ€¦
- 2010

We describe two algorithms for calculating the probability of m-symbol length-n patterns over k-element distributions, a partition-based algorithm with complexity roughly 2O(m log m) and a recursiveâ€¦ (More)

- Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam
- 2010 IEEE International Symposium on Informationâ€¦
- 2010

We consider the problem of classification, where the data of the classes are generated i.i.d. according to unknown probability distributions. The goal is to classify test data with minimum errorâ€¦ (More)