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:

Achieving secrecy capacity of the general wiretap channel and broadcast channel with a confidential component, with T.C. Gulcu. arXiv:1410.3422

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

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

Bounds on locally recoverable codes with multiple recovering sets, with
I. Tamo, Proc. ISIT 2014, pp. 691-695
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,
Proc. ISIT2013,
pp. 1307-1311, [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,
Proc. ISIT2011,
pp. 1753--1757,
[pdf]

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

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

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]

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.