Optimal repair of Reed-Solomon codes: Achieving the cut-set bound,
with Min Ye, and I. Tamo, IEEE Transactions on Information Theory, May 2019.
Short version in
Proc. 2017 IEEE Symp. on the Foundations of Comput. Science (FOCS), Berkeley, CA, October 15–17, 2017), pp. 216-227.
preprint1preprint2

Cooperative repair: Constructions of optimal MDS codes for all admissible parameters, with Min Ye,
IEEE Transactions on Information Theory, 65, no. 3 (2019), 1639--1656. Preprints: arXiv:1801.09665 (2 erasures) and arXiv:1803 (the general case).

2018

Optimal schemes for discrete distribution estimation under locally differential privacy,
with Min Ye, IEEE Trans. Inform. Theory,
64, no. 5 (2019), 2673--2695.
preprint

Exploiting locality for improved decoding of binary cyclic
codes,
with M. N. Krishnan, B. Puranik, P.V. Kumar, I. Tamo,
IEEE Transactions on Communications, 66, no. 6 (2018), pp. 2346--2358.
preprint

Combinatorial alphabet-dependent bounds for locally recoverable codes,
with A. Agarwal, S. Hu, A. Mazumdar, I. Tamo, IEEE Trans. Inform. Theory,64, no. 5, 2018, pp. 3481--3492.
preprint

Construction of polar codes for arbitrary discrete memoryless
channels, with T.C. Gulcu and Min Ye,
IEEE Trans. Inform. Theory,
64, no. 1, 2018, pp. 309--321.
preprint

2017

Locally recoverable codes from algebraic curves and surfaces,
with K. Haymaker, E. Howe, G. Matthews, and A. Várilly-Alvarado, in
Algebraic Geometry for Coding Theory and Cryptography,
E. Howe, K. Lauter, and J. Walker, Editors,
Springer, 2017, pp. 95--126.
preprint

Explicit constructions of optimal-access MDS codes with nearly
optimal sub-packetization, with Min Ye,
IEEE Trans. Inform. Theory63, no. 10, 2017, pp. 6307-6317.
preprint

Locally recoverable codes on algebraic curves, with I. Tamo and S. Vlăduţ,
IEEE Trans. Inform. Theory,
63, no. 8, 2017, pp. 4928-4939.
preprint

Explicit constructions of high-rate MDS array codes with optimal
repair bandwidth, with Min Ye,
IEEE Trans. Inform. Theory,
63, no. 4, 2017, pp. 2001-2014. preprint

Achieving secrecy capacity of the general wiretap channel and broadcast channel
with a confidential component, with T.C. Gulcu,
IEEE Trans. Inform. Theory,
63, no. 1, 2017, pp. 1311--1324. preprint

On codes with the locality property, with I. Tamo,
Information Theory Society Newsletter,
December 2015. [pdf]

Restricted isometry property of random subdictionaries,
with A. Mazumdar and R. Wang, IEEE Trans. Inform. Theory61, no. 8, 2015, pp. 4440-4450.
preprint

Association schemes on general measure spaces and
zero-dimensional Abelian groups, with M. Skriganov,
Advances in Mathematics,281, 2015, pp. 142-247.
preprint

Finite two-distance tight frames, with A. Glazyrin, K. Okoudjou and W.-H. Yu,
Linear
Algebra Appl., 475, 2015, pp. 163--175.
preprint

Universal source polarization and an application to a multi-user
problem, with Min Ye, Proc. 2014 Allerton conference, 8pp.
preprint (no
journal version is planned)

Coding for high-density recording on a 1-D granular magnetic
medium, with A. Mazumdar and N. Kashyap,
IEEE Trans. Inform. Theory, 57, no. 2, 2011, 7403-7417,
preprint

List decoding of product codes by the MinSum algorithm, with G. Zémor,
Proc. ISIT2011, pp. 1273-1277.

2010-

Two-level fingerprinting codes: A stronger definition and
constructions, with N.P. Anthapadmanabhan, Proc. ISIT2010 ;
earlier version preprint

Secret key generation for a pairwise independent network
model, with S. Nitinawarat, C. Ye, P. Narayan, A. Reznik,
IEEE Trans. Inform. Theory, 56, no. 12,
2010, 6482--6489
[pdf]

A functional view of upper bounds on codes, with D. Nogin, in
book "Coding and Cryptology," edited by Y. Li et al., World
Scientific, 2008,
pp. 15-24, arXiv:0809.0091.
(Proc. 1st Internat. Workshop, Wuyi Mountain, Fujian, China, June
2007).

A bound on Grassmannian codes, with D. Yu. Nogin, Journal
of Combinatorial Theory Ser. A113, 8,
2006, 1629-1635 (J. Van Lint memorial issue). cs.IT/0512024

Distance properties of expander codes, with G. Zémor,
IEEE Trans. Inform. Theory,
Jan. 2006, arXiv.org:cs.IT/0409010

Multilevel expander codes, with Gilles Zémor,
in "Algebraic Coding Theory and Information Theory,"
American Math. Soc. 2005, pp. 69-83. (vol. 68, AMS-DIMACS series).
arXiv.org:cs.IT/0502079

Distance distribution of binary codes and the error
probability of decoding, with A. McGregor, IEEE Trans. Inform. Theory,
51, no.12, 2005, 4237-4246.
arXiv.org:cs.IT/0407011

Extremal problems of coding theory,
in book: H. Niederreiter, Editor, "Coding Theory and Cryprography,"
World Scientific, 2002, pp. 1-48. (Notes of lectures at the Institute
for Math. Sciences of the University of Singapore, Sept. 2001)

Estimates of the distance distribution of nonbinary codes,
with applications, with A. Ashikhmin and S. Litsyn,
Codes and Association Schemes, AMS., Providence, RI (2001), pp. 287-303.