P.V. Kumar

Permutation polynomials for interleavers in turbo codes

C.J. Corrada Bravo, P.V. Kumar, P. Kumar, 2003, IEEE International Symposium on Information Theory. Proceedings.

On the Apparent Duality of the Kerdock and Preparata Codes

R. Hammons, P. Solé, P.V. Kumar, 1993, Proceedings. IEEE International Symposium on Information Theory.

An upper bound for some exponential sums over Galois rings and applications

T. Helleseth, A. Calderbank, T. Helleseth, 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

Experimental demonstration of OCDMA transmission using a three-dimensional (time-wavelength-polarization) codeset

J.E. McGeehan, P. Saghari, S.M.R.M. Nezam, 2005, Journal of Lightwave Technology.

A low complexity algorithm for the construction of algebraic geometric codes better than the Gilbert-Varshamov bound

H. Stichtenoth, P.V. Kumar, K. Shum, 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

Large families of quaternary sequences with low correlation

A. R. Hammons, T. Helleseth, A.R. Hammons, 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.