Discrete Geometry and Algebraic Combinatorics, American Math. Soc.
(Contemporary Math., vol. 625), 2014

Algebraic Coding Theory and Information Theory, American Math. Soc., 2005
(vol. 68, AMS-DIMACS series).

Codes and Association Schemes, American Math. Soc., 2001
(vol. 56, AMS-DIMACS series).

Recent preprints:

Interactive function computation via polar coding, with
T. C. Gulcu, April 2014, arXiv:1405.0894

Polar codes for distributed hierarchical source coding, with
M. Ye, May 2014, arXiv:1404.5501

Finite two-distance tight frames, with K. Okoudjou and W.-H. Yu, Jan. 2014,
arXiv:1402.3521

Bounds on locally recoverable codes with multiple recovering sets, with
I. Tamo, ISIT 2014,
arXiv:1402.0916

Association schemes on general measure spaces and zero-dimensional
Abelian groups, with M. Skriganov, Oct. 4, 2013, revised May 1, 2014 arXiv:1310.5359

Controlled polarization for q-ary alphabets, with W. Park, ISIT2013.[pdf]

Restricted isometry property of random subdictionaries,
with A. Mazumdar and R. Wang, May 20, 2014. Revised version of
arXiv:1303.1847.

Channels with intermittent errors, with A. Mazumdar, ISIT2011
[pdf]

List decoding of product codes by the MinSum algorithm, with
G. Zémor, ISIT2011 [pdf]

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. arXiv:1012.1895

Two-level fingerprinting codes: A stronger definition and
constructions, with N.P. Anthapadmanabhan, ISIT2010 [pdf];
earlier version arXiv:0905:0417

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]

Codes in permutations and error correction for rank
modulation, with A. Mazumdar, IEEE Trans. Inform. Theory, 56, no. 7, 2010, arxiv:0908.4904

Bounds on ordered codes and orthogonal arrays, with P.
Purkayastha, Moscow Mathematical Journal9,
2, 2009,
pp. 211-243, arXiv:cs/0702033

Weight distribution and decoding of codes on hypergraphs,
with A. Mazumdar and G. Zémor, Advances in Math. of
Communications, 2, 4, 2008, arXiv:0808.3453.

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).

Codes in spherical caps, with O. Musin, Advances
in Math. of Communications1, 2007,
131-149. arXiv.org:math.MG/0606734

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,
Dec. 2005.
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.

A new upper bound on codes decodable into size-2 lists, with
A. Ashikhmin and S. Litsyn, in Numbers, Information and
Complexity, Ingo Althoefer et al., Eds., Boston: Kluwer
Publ., 2000, pp. 239-244