


JOURNAL PAPERS
Journal Papers (submitted, under review)

V. Lalitha, N.
Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan " Linear
Coding Schemes for the Distributed Computation of Subspaces,
"submitted to the IEEE JSAC Special Issue on InNetwork Computation:
Exploring Fundamental Limits.

G. Garg, P. Vijay Kumar, QAM Sequences with Improved Correlation
through Interleaving,submitted to the IEEE Trans. Inform. Th.,
Aug. 13, 2011.

K Sreeram, S Birenjith, P V Kumar, DMT of
Parallel–Path and Layered Networks under the HalfDuplex
Constraint to appear in the IEEE Trans. Inform. Theory.
Journal Papers (accepted or published)

N. B. Shah, K.V. Rashmi, P. V. Kumar and K. Ramchandran,
Interference Alignment in Regenerating Codes for Distributed
Storage: Necessity and Code Constructions, Information Theory,
IEEE Transsactions on, vol. 58, no. 4, pp. 21342158, April 2012.

N. B. Shah, K.V. Rashmi, P. V. Kumar and K. Ramchandran,
Distributed Storage Codes with RepairbyTransfer and
Nonachievability of Interior Points on the StorageBandwidth Tradeoff, Information
Theory, IEEE Transactions on, vol. 58, no. 3, pp.1837  1852, March 2012.

Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros
E Elia, Pankaj Bhambhani, Large Families of Optimal
TwoDimensional Optical Orthogonal Codes, Information
Theory, IEEE Transactions on, Vol. 58, no. 2, pp: 1163 1185,
Feb. 2012.

K. Sreeram, S Birenjith, P V Kumar, DMT of
Multihop Networks: End Points and Computational Tools, Information
Theory, IEEE Transactions on, Vol. 58, no. 2, pp: 804  819,
Feb. 2012.

Swaprava Nath, N.E. Venkatesan, Anurag Kumar, P.
Vijay Kumar, Theory and Algorithms for HopCountBased
Localization with Random Geometric Graph Models of Dense Sensor
Networks, ACM Transactions
on Sensor Networks, to
appear, vol. 8, issue 4, 2012.

K. V. Rashmi, Nihar B. Shah and P. Vijay Kumar, “Optimal ExactRegenerating Codes for Distributed Storage at the MSR and MBR Points via a ProductMatrix Construction,” accepted for publication in the IEEE Transactions on Information Theory.
 K. Vinodh, V. Lalitha, N. Prakash, P. V. Kumar and S. Pradhan, “Distributed Function Computation over Fields and Rings via Linear Compression of Sources,” to appear in the Journal of the Indian Institute of Science, special issue on Algebra, Vol.91, No.1, 2011.
 S. Ijeri, U. Raviteja, B. Vanamali and P. V. Kumar, “Algebriac approaches to SpaceTime Code Construction for MultipleAntenna Communication,” to appear in the Journal of the Indian Institute of Science, special issue on Algebra, Vol.91, No.1, 2011.
 N.E. Venkatesan, Tarun Agarwal, V. Lalitha, and P. Vijay Kumar, “Distributed intrusion detection in the presence of correlated sensor readings: Signalspace and communicationcomplexity viewpoint,” AdHoc Networks, Elsevier.
 (invited paper) K. Vinodh, N. Prakash, V. Lalitha, P. Vijay Kumar, “DMT of Wireless Networks: An Overview,” special issue on “Coding and Modulation for Cooperative Communications” Journal of Communications, Vol 5, No 4 (2010), pp. 265281.
 The SmartDetect Project Team, “Wireless sensor networks for human intruder detection,” Journal of the Indian Institute of Science, Special issue on Advances in Electrical Science, vol. 90, no. 3, pp. 347380, JulySeptember 2010 (invited).
 K. V. Rashmi, Nihar B. Shah and P. Vijay Kumar, “Network Coding,” Resonance, vol. 15, no. 7, pp. 604621, Jul. 2010.
 Petros Elia, K. Vinodh, M. Anand and P. Vijay Kumar, “DMG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols,” IEEE Trans. Inform.Theory, vol. 55, 7, July 2009, pp. 31613185.
 S. A. Pawar, K. R. Kumar, P. Elia, P. V. Kumar and B. A. Sethurman, “SpaceTime Codes Achieving the DMD Tradeoff of the MIMOARQ Channel,” IEEE Trans. Inform. Theory, vol. 55, 7, July 2009, pp. 31013114.
 M. Anand and P. Vijay Kumar,“Low Correlation Sequences over a QAM Constellation,” IEEE Trans. Inform. Theory, vol.54, No. 2, Feb 2008, pp. 791810.
 Petros Elia, B. A. Sethuraman, P. Vijay Kumar, “Perfect SpaceTime Codes with Minimum and NonMinimum Delay for Any Number of Antennas, ” IEEE Trans. Inform. Theory, Nov 2007, vol.52, No.11, pp. 3853  3868 (lead article).
 Oscar Moreno, Reza Omrani, P. Vijay Kumar, and Hsiaofeng Lu, “A Generalized BoseChowla Family of Optical Orthogonal Codes and Distinct Difference Sets,” IEEE Trans. Inform Theory, May 2007, vol.53, No.5, pp. 19071910.
 Petros Elia, Frederique Oggier and P. Vijay Kumar, “Asymptotically Optimal Cooperative Wireless Networks with Reduced Signaling Complexity,” IEEE Journal on Selected Areas in Communication, Special Issue on Cooperative Communications and Networking, vol. 25, No2, Feb 2007, pp. 258267.
 Petros Elia K.Raj Kumar, Sameer.A Pawar, P.Vijay Kumar Hsiaofeng Lu,“Explicit, MinimumDelay SpaceTime Codes Achieving the Diversity Multiplexing Gain Tradeoff ”, IEEE Trans. Inform Theory, Sep. 2006, vol. 52, No. 9, pp. 38693884 (lead article).
 John E. McGeehan, S. M. R. Motaghian Nezam, P. Saghari, Alan E. Willner, Reza Omrani, and P. Vijay Kumar, “Experimental Demonstration of OCDMA Transmission Using a ThreeDimensional(TimeWavelengthPolarization) Codeset,” Journal of Lightwave Technology,Vol. 23, No. 10, Oct. 2005, pp. 32823288.
 P. Saghari, R. Omrani, A. E. Willner, and P. V. Kumar, ”Analytical Interference model for 2Dimensional (TimeWavelength) Asynchronous OCDMA Systems Using various Receiver Structure”, Journal of Lightwave Technology, vol. 23, pp. 32603269, Oct. 2005.
 Hsiaofeng Lu and P. V. Kumar, “A Unified Construction of SpaceTime Codes with Optimal RateDiversity Tradeoff,” IEEE Trans. Inform. Theory, vol. 51, No. 5, May 2005, pp.17091730.
 F. N. Castro, P. V. Kumar, O. Moreno and K. W. Shum, “Improvements on the ChevalleyWarning, AxKatz, Deligne, and Serre bound for singular and nonsingular varieties”, Proceedings of the London Mathematical Society, vol. 88, 2004, pp. 545564.
 Hsiaofeng Lu, P. V. Kumar and Enhui Yang, “On the InputOutput Weight Enumerators of Product Accumulate Codes”, IEEE Communications Letters, Vol.8 , Issue: 8 , Aug. 2004, Pages:520  522
 Hsiaofeng Lu and P. V. Kumar, “On Orthogonal Designs and SpaceTime Codes,” IEEE Comm. Letters, Vol. 8, No. 4, April 2004, pp. 220222.
 D. J. Shin, P. V. Kumar and T. Helleseth, “An AssmuMattsonType Approach for Identifying 3Designs from Linear Codes over Z4,” Designs, Codes and Cryptography, vol. 31, pp. 7592, 2004.
 Hf. Lu, Y. Wang, P. V. Kumar and K. M. Chugg, “Remarks on spacetime codes including a new lower bound and an improved code,” IEEE Transactions on Information Theory, Volume:49, Issue: 10 , Oct. 2003, Pages:2752  2757.
 Hf. Lu and P.V. Kumar, “ Ratediversity tradeoff of spacetime codes with fixed alphabet and optimal constructions for PSK modulation,” IEEE Transactions on Information Theory, Volume: 49 , Issue: 10 , Oct. 2003, Pages:27472751.
 C. Xing, P. V. Kumar and C. Ding, “Lowcorrelation, large linear span sequences from function fields,” IEEE Trans. Information Theory, Volume: 49 , Issue: 6 , June 2003 Pages:1439  1446.
 DongJoon Shin, P. Vijay Kumar, Tor Helleseth: 3Designs from the Z4Goethals Codes via a New Kloosterman Sum Identity. Des. Codes Cryptography 28(3): 247263 (2003)
 D. Shin, P. V. Kumar and T. Helleseth, “5designs from the lifted Golay code over Z4 via an Assmustype approach, ” Discrete Mathematics, 241 (2001) special issue dedicated to the 65th birthday of Professor Helge Tverberg.
 K. T. Arasu, Cunsheng Ding; T. Helleseth, P. V. Kumar, H. M. Martinsen, “Almost difference sets and their sequences with optimal autocorrelation ”, IEEE Trans. Inform. Theory, vol.47, Nov 2001 pp.2934 2943
.
 K. Shum, I. Aleshnikov, P. V. Kumar, and H. Stichtenoth, “A lowcomplexity algorithm for the construction of algebraic geometric codes better than the GilbertVarshamov bound,” IEEE Trans. Inform. Theory, pp. 22252242, Sep. 2001.
 T. Helleseth, P. V. Kumar and H. Martinsen, “A new family of ternary sequences with ideal twolevel autocorrelation functions, ” Designs, Codes and Cryptography, vol 23, July 2001, pp. 157166.
 H. Dobbertin, T. Helleseth, P. V. Kumar, H. Martinsen, “Ternary msequences with threevalued crosscorrelation function: new decimations of Welch and Niho type, ” IEEE Trans. Inform. Theory, vol. 47, May 2001, pp. 1473 1481.
 I. Aleshnikov, P. V. Kumar, K. Shum, and H. Stichtenoth, “On the splitting of places in a tower of function fields meeting the DrinfeldVl˘adut¸ bound,” IEEE Trans. Inform. Theory, pp. 16131619, May, 2001.
 A. Chang, P. Gaal, S. W. Golomb, G. Gong, T. Helleseth and P. V. Kumar, “On a conjectured ideal autocorrelation sequence and a related tripleerror correcting code, ” IEEE Trans. Inform. Theory, pp. 680687, March 2000.
 K. Yang, Y. Kim, and P. V. Kumar, ” QuasiOrthogonal Sequences for CodeDivision Multiple Access Systems,” IEEE Trans. Information Theory, pp. 982993, May 2000.
 T. Helleseth, P. V. Kumar and K. Yang, ”An infinite family of 3designs from the Preparata code,” Designs, Codes and Cryptography, Vol. 15, pp 175181, 1998.
 A. G. Shanbhag, P. V. Kumar and T. Helleseth, ” An upper bound for the extended Kloosterman sum over Galois rings,” Finite Fields and their Applications, vol. 4, pp. 218238, 1998.
 P. V. Kumar and T. Helleseth, “An Expansion for the coordinates of the trace function in Galois rings,” Applicable Algebra in Engineering, Communication and Computing, Vol. 8, No. 5, pp. 353362, 1997.
 P. V . Kumar, T. Helleseth and A. R. Calderbank, A. R. Hammons, Jr., “Large Families of Quaternary Sequences with Low Correlation,” IEEE Trans. Inform. Theory, vol. 42, March 1996.
 A. R. Calderbank, G. McGuire, P. V. Kumar, T. Helleseth, “Cyclic Codes over Z4, Locator Polynomials, and Newton identities,” IEEE Trans. on Inform. Theory, vol. IT42, pp. 217226, Jan. 1996.
 A. Shanbhag, P. Vijay Kumar and T. Helleseth, “Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some qary sequences,” IEEE Trans. Inform. Theory, vol. IT42, pp. 250254, Jan. 1996.
 T. Helleseth, P. V. Kumar, O. Moreno and A. G. Shanbhag, “Improved estimates via exponential sums for the minimum distance of Z −4linear trace codes,” IEEE Trans. on Inform. Theory, pp. 12121216, July 1996.
 A. Shanbhag, P. V. Kumar and T. Helleseth, “Improved Binary Codes and Sequence Families from Z4Linear Codes, IEEE Trans. on Inform. Theory, pp. 15821586, Sep. 1996.
 K. Yang, T. Helleseth, P. V. Kumar and A. Shanbhag, “The weight hierarchy of Kerdock codes over Z4,”, IEEE Trans. Inform. Theory, vol 42, pp. 15871593, Sep. 1996.
 T. Helleseth, P. Vijay Kumar and A. G. Shanbhag, “Codes with the same weight distribution as the Goethals codes and the DelsarteGoethals codes,” Designs, Codes and Cryptography, pp. 257266, 1996.
 T. Helleseth and P. V. Kumar, “On the Weight Hierarchy of the Semiprimitive Codes,” Discrete Mathematics, vol. 152, pp. 185190, 1996.
 T. Helleseth and P. V. Kumar, “ Algebraic Decoding of the Goethals codes,” IEEE Trans. Inform. Theory, vol. IT41, pp. 20402048, Nov. 1995.
 T. Helleseth and P. V. Kumar, “The Weight Hierarchy of the Kasami Codes,” Discrete Mathematics, vol. 145, (13), pp. 133143, October 1995.
 O. Moreno, V. A. Zinoviev, and P.V. Kumar, “An Extension of the WeilCarlitzUchiyama Bound,” Finite Fields and their Applications, vol.1, no.3, July 1995, pp 306371.
 P. V. Kumar, T. Helleseth and A. R. Calderbank, “ An Upper Bound for Weil Exponential Sums over Galois Rings and Applications,” IEEE Trans. on Inform. Theory, vol. IT41, pp. 456468, March 1995.
 O. Moreno, Z. Zhang, P. V. Kumar and V. Zinoviev, “Asymptotically Optimum Families of Optical Orthogonal Codes,” IEEE Trans. on Inform. Theory, vol. 41, pp. 448455, March 1995.
 K. C. Yang, P. V. Kumar and H. Stichtenoth “On the Weight Hierarchy of Geometric Goppa Codes”, IEEE Trans. on Inform. Theory, vol. IT40, pp. 913920, May 1994.
 S. Boztas and P. V. Kumar “Binary Sequences with Goldlike Correlation but Larger Linear Span”, IEEE Trans. on Inform. Theory, vol. IT40, pp. 532537, March 1994.
 A. R. Hammons, Jr., P. Vijay Kumar, A. R. Calderbank, N. J. A. Sloane and P. Sol`e, “The Z4Linearity of Kerdock, Preparata, Goethals and Related Codes,” IEEE Trans. on Inform. Theory, vol. IT40, pp. 301319, March 1994.
 O. Moreno and P. V. Kumar, “Minimum Distance Bounds for Cyclic Codes and Deligne’s Theorem”, IEEE Trans. on Inform. Theory, vol. IT39, pp. 15241534, September 1993.
 A. R. Calderbank, A. R. Hammons, Jr., P. V. Kumar, N. J. A. Sloane and P. Sol´e, “A Linear Construction for Certain Kerdock and Preparata Codes,” Bull. Amer. Math. Society, Vol. 29, Number 2, pp. 218222, October 1993.
 A. R. Hammons, Jr., P. V. Kumar “On a Recent FourPhase Sequence Design, ” (Invited Paper), Special Issue on SpreadSpectrum Techniques and Applications of the IEICE Trans. on Communications, vol. E 76B, No. 8, pp. 804813, August 1993.
 P. V. Kumar and V. Wei, “Minimum Distance of Logarithmic and Fractional Partial mSequences”, IEEE Trans. on Inform. Theory, vol. IT38, 5, pp.14741482, September 1992.
 Ara Patapoutian and P. V. Kumar, “The (d,k)Subcode of a Linear Block Code,” IEEE Trans. on Inform. Theory, vol. IT38, 4, pp. 13751382, July 1992.
 S. Bozta¸s, R. Hammons, and P.V. Kumar, “4Phase Sequences with NearOptimum Correlation Properties”, IEEE Trans. on Inform. Theory, vol. IT38, 3, pp. 11011113, May 1992.
 P.V. Kumar and O. Moreno, “PrimePhase Sequences with Periodic Correlation Properties Better than Binary Sequences”, IEEE Trans. on Inform. Theory, vol. IT37, pp. 603616, May 1991.
 H. Chung and P.V. Kumar, “Optical Orthogonal Codes — New Bounds and an Optimal Construction,” IEEE Trans. on Inform. Theory, vol. IT36, pp. 866873, July 1990.
 P.V. Kumar and C. M. Liu, “Lower Bounds to the Maximum Correlation of Complex, RootsofUnity Sequences,” IEEE Trans. on Inform. Theory, vol. IT36, No.3, pp.633640, May 1990.
 H. Chung and P. V. Kumar, “A New General Construction for Bent Functions”, IEEE Trans. on Inform. Theory, vol. IT35, pp. 206210, January 1989.
 63. P.V. Kumar, “On the Existence of Square DotMatrix Patterns Having a Specific 3Valued PeriodicCorrelation Function,” IEEE Trans. on Inform. Theory, vol. IT34, no. 2, pp. 271278, May 1988.
 P.V. Kumar, “FrequencyHopping Code Sequences Having Large Linear Span,” IEEE Trans. on Inform. Theory, vol. IT34, no. 1, pp. 146151, January 1988.
 P.V. Kumar, R.A. Scholtz and L.R. Welch, “Generalized Bent Functions and Their Properties,” Journal of Combinatorics, Series A, vol. 40, pp. 90107, September 1985.
 P.V. Kumar and R.A. Scholtz, “Generalized GMW Sequences and an Application to Frequency Hopping,” Cryptologic Quarterly, vol. 3, nos. 12, pp. 15, SpringSummer, 1984.
 P.V. Kumar and R.A. Scholtz, “Bounds on the Linear Span of Bent Sequences,” IEEE Trans. on Inform. Theory, vol. IT29, no. 6, pp. 854862, November 1983.

