Conference
2017
S. B. Balaji, Ganesh R. Kini and P. Vijay Kumar: A Tight Rate Bound and a Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures. Finalist  Jack Keil Wolf Student Paper Award, ISIT 2017 [ArXiv]
Myna Vajha, Vinayak Ramkumar and P. Vijay Kumar: Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval. ISIT 2017 [Arxiv]
S.B.Balaji, P.Vijay Kumar: Bounds on Codes with Locality and Availability. ISIT 2017 [ArXiv]
M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo and Alexander Barg: A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes. ISIT 2017 [ArXiv]
Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar: An Explicit, CoupledLayer Construction of a HighRate MSR Code with Low SubPacketization Level, Small Field Size and d<(n1). ISIT 2017 [ArXiv]
2016
Tarun Choubisa, Raviteja Upadrashta, Sumankumar Panchal, A. Praneeth, Ranjitha H. V., Kaushik Senthoor, Abhijit Bhattacharya, S. V. R. Anand, Malati Hegde, Anurag Kumar, P. Vijay Kumar, Madhuri Sheethala Iyer, Abhirami Sampath, Prabhakar T. V., Joy Kuri, Ashwath Narayan Singh, Challenges in Developing and Deploying a PIR SensorBased Intrusion Classfication System for an Outdoor Environment, Eleventh IEEE International Workshop on Practical Issues in Building Sensor Network Applications (IEEE SenseApp 2016), November, 2016, Dubai, United Arab Emirates (UAE)
S. B. Balaji, K. P. Prasanth, P. Vijay Kumar: Binary codes with locality for multiple erasures having short block length. ISIT 2016 [ArXiv] [ISIT].
M Nikhil Krishnan, P. Vijay Kumar: On MBR codes with replication. ISIT 2016 [ArXiv] [ISIT].
2015
Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar: Codes with hierarchical locality. ISIT 2015: 12571261
S. B. Balaji, P. Vijay Kumar: On partial maximallyrecoverable and maximallyrecoverable codes. ISIT 2015: 18811885
Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar: A highrate MSR code with polynomial subpacketization level. ISIT 2015: 20512055
Raviteja Upadrashta, Tarun Choubisa, V. S. Aswath, A. Praneeth, Ajit Prabhu, Siddhant Raman, Tony Gracious, P. Vijay Kumar, Sripad S. Kowshik, Madhuri Sheethala Iyer, Tamma V. Prabhakar: An animationandchirplet based approach to intruder classification using PIR sensing. ISSNIP 2015: 16
Kaushik Senthoor, Birenjith Sasidharan, P. Vijay Kumar: Improved layered regenerating codes characterizing the exactrepair storagerepair bandwidth tradeoff for certain parameter sets. ITW 2015: 15
2014
M. Nikhil Krishnan, N. Prakash, V. Lalitha, Birenjith Sasidharan, P. Vijay Kumar, Srinivasan Narayanamurthy, Ranjit Kumar, Siddhartha Nandi: Evaluation of Codes with Inherent Double Replication for Hadoop. HotStorage 2014
N. Prakash, V. Lalitha, P. Vijay Kumar: Codes with locality for two erasures. ISIT 2014: 19621966
Birenjith Padmakumari Sasidharan, Kaushik Senthoor, P. Vijay Kumar: An improved outer bound on the storagerepairbandwidth tradeoff of exactrepair regenerating codes. ISIT 2014: 24302434
2013
Govinda M. Kamath, Natalia Silberstein, N. Prakash, Ankit Singh Rawat, V. Lalitha, Onur Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath:Explicit MBR allsymbol locality codes. ISIT 2013: 504508
Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar: Codes with local regeneration. ISIT 2013: 16061610
Birenjith Sasidharan, P. Vijay Kumar:Highrate regenerating codes through layering.ISIT 2013: 16111615
Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:Codes with local regeneration. ITA 2013: 15
2012
K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar: Regenerating codes for errors and erasures in distributed storage. ISIT 2012: 12021206
N. Prakash, Govinda M. Kamath, V. Lalitha, P. Vijay Kumar: Optimal linear codes with a localerrorcorrection property. ISIT 2012: 27762780
Govinda M. Kamath, N. Prakash, V. Lalitha, and P. Vijay Kumar. “Optimal Linear Codes with a LocalErrorCorrection Capability” (Invited) in IEEE Information Theory and Applications (ITA) workshop, San Diego, Feb. 2012.
Govinda M. Kamath and P. Vijay Kumar. “Regenerating Codes: A Reformulated Storage Bandwidth Tradeoff and a New Construction.” in Proc. of the National Conference on Communation 2012(NCC 2012), IIT Karagpur, India.
V. Lalitha, N. Prakash, Govinda M. Kamath and P. Vijay Kumar. “On TDesigns and Bounds Relating Query Complexity to Error Resilience in Locally Correctable Codes.” in Proc of the National Conference on Communation 2012(NCC 2012), IIT Karagpur, India.
2011
N. E. Venkatesan, Tarun Agarwal, V. Lalitha, P. Vijay Kumar: Distributed intrusion detection in the presence of correlated sensor readings: Signalspace and communicationcomplexity viewpoint. Ad Hoc Networks 9(6): 10151027 (2011)
V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan: A nested linear codes approach to distributed function computation over subspaces. Allerton 2011: 12021209
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar: InformationTheoretically Secure Regenerating Codes for Distributed Storage. GLOBECOM 2011: 15
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar: Enabling node repair in any erasure code for distributed storage. ISIT 2011: 12351239
2010
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran: Explicit and optimal exactregenerating codes for the minimumbandwidth point in distributed storage. ISIT 2010: 19381942
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar: A flexible class of regenerating codes for distributed storage. ISIT 2010: 19431947
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran: Explicit and optimal codes for distributed storage. ITA 2010: 240244
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran: Regenerating Codes for Distributed Storage Networks. WAIFI 2010: 215223
K. Vinodh, V. Lalitha, N. Prakash, “On the Achievable Rates of Sources having a Group Alphabet in a Distributed Source Coding Setting,” FortyEighth Annual Allerton Conference on Communication, Control, and Computing, September 29 October 1, 2010, Allerton Retreat Center, Monticello, Illinois.
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar and Kannan Ramchandran, “Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage,” presented at the The Sixteenth National Conference on Communications (NCC 2010), IIT Madras, Jan. 2831, 2010.
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar and Kannan Ramchandran, “Interference Alignment as a Tool in Network Coding as Applied to Distributed Storage,” presented at the The Sixteenth National Conference on Communications (NCC 2010), IIT Madras, Jan. 2831, 2010.
K. Vinodh, Avik Ray and P. Vijay Kumar, “On Approximately Universal Schemes for Twohop Network,” presented at the The Sixteenth National Conference on Communications (NCC 2010), IIT Madras, Jan. 2831, 2010.
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran, “Explicit Codes Minimizing Repair Bandwidth for Distributed Storage,” presented at the 2010 IEEE Inform. Th. Workshop, Cairo, Jan. 68, 2010.
K. Sreeram, P. S. Birenjith, P. Vijay Kumar, “ DMT of Multihop Cooperative Networks,” (invited paper) presented at the 2010 IEEE Inform. Th. Workshop, Cairo, Jan. 68, 2010.
2005  2009
K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar and Kannan Ramchandran, “Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage,” Proc. Allerton Conference on Control, Computing and Communication, UrbanaChampaign, Sep. 2009.
Abu Sajana R., Ramanathan Subramanian, P. Vijay Kumar, Syam Krishnan, Bharadwaj Amrutur,Jeena Sebastian, Malati Hegde, S. V. R. Anand, “A LowComplexity Algorithm for Intrusion Detection in a PIRBased Wireless Sensor Network,” proceedings of the Fifth International Conference on Intelligent Sensors, Sensor Networks and Information Processing, Melbourne, December 710, 2009.
Petros Elia, P. Vijay Kumar: Spacetime codes that are approximately universal for the parallel, multiblock and cooperative DDF channels. ISIT 2009: 28132817
Avik Ray, Ghaya RekayaBen Othman, P. Vijay Kumar, K. Vinodh: Ideal structure of the Silver code. ISIT 2009: 28182822
R. N. Krishna Kumar, N. Naveen, K. Sreeram and P. Vijay Kumar, “ “Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks,” presented at the Forty Sixth Annual Allerton Conference on Communication, Control, and Computing, University of Illinois at UrbanaChampaign, Sep 2326, 2008.
G. Garg, P. Vijay Kumar and C. E. Veni Madhavan, “ Two new families of lowcorrelation interleaved QAM sequences ”, presented at the International Conference on Sequences and Their Applications (SETA), University of Kentucky, Lexington, KY, Sept. 1418, 2008.
K. Sreeram , S. Birenjith, P. Vijay Kumar, “Multihop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design,” invited paper presented at the Information Theory and Applications Workshop , University of California, San Diego, Feb 2008.
R. N. Krishnakumar, N. Naveen, K. Sreeram and P. Vijay Kumar, “On the Successive Refinability of MIMO channels: DMT and codes,,” Proceedings National Conference in Communications, IIT Mumbai, Feb 2008.
Gagan Garg, P. Vijay Kumar and C. E. Veni Madhavan, “Low correlation interleaved QAM sequences,” Proceedings of National Conference in Communication, Feb 2008.
N. E. Venkatesan, Tarun Agarwal, P. Vijay Kumar: On the Average Case Communication Complexity for Detection in Sensor Networks. DCOSS 2008: 176189
K. Sreeram, S. Birenjith, P. Vijay Kumar: Diversity and degrees of freedom of cooperative wireless networks. ISIT 2008: 12531257
Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan: Low correlation interleaved QAM sequences. ISIT 2008: 19351939
K. Sreeram, S. Birenjith, P. Vijay Kumar: DMT of multihop cooperative networksPart I: KParallelPath networks. ISIT 2008: 20762080
K. Sreeram, S. Birenjith, P. Vijay Kumar: DMT of multihop cooperative networksPart II: Layered and multiantenna networks. ISIT 2008: 20812085
Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan: Two New Families of LowCorrelation Interleaved QAM Sequences. SETA 2008: 130141
Reza Omrani, Pankaj Bhambhani, P. Vijay Kumar: Sequences for PhaseEncoded Optical CDMA. SSC 2007: 95105
Tarun Agarwal, Venkatesan N. E, and Mohan Rao Sasanapuri, P. Vijay Kumar, “Intruder detection over sensor placement in a hexagonal lattice,” Wireless Personal Multimedia Communications (WPMC’ 07), Jaipur, Dec. 2007.
K. Sreeram , S. Birenjith, K. Vinodh, M. Anand, P. Vijay Kumar, “On the throughput, DMT and optimal code construction of the Kparallelpath cooperative wireless fading network,” Wireless Personal Multimedia Communications (WPMC’ 07), Jaipur, Dec. 2007.
Petros Elia, K. Vinodh, M. Anand, P. Vijay Kumar, “DMG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols,” IEEE Intl. Symp. Inform.Theory, Nice, June 2007, pp.681686.
M. Anand, P. Vijay Kumar “Low Correlation Sequences over AMPSK and QAM Alphabets,” IEEE Intl. Symp. Inform. Theory, Nice, June 2007, pp.25212525.
P. Vijay Kumar, K. Vinodh, M. Anand, P. Elia, “DiversityMultiplexing Gain Tradeoff and DMTOptimal Distributed SpaceTime Codes for Certain Certain Cooperative Communication Protocols: Overview and Recent Results,” invited paper at the Information Theory and Applications Workshop , UCSD, Feb 2007.
P. Vijay Kumar “Cooperative Diversity in Fading Wireless Networks Through Distributed SpaceTime Codes,” invited talk given at the 13th National Conference on Communications (NCC 2007), January 2628, 2007, Indian Institute of Technology, Kanpur.
P. Vijay Kumar, Reza Omrani, Joe Touch, Alan E. Willner, Poorya Saghari: A Novel Optical CDMA Modulation Scheme: Code Cycle Modulation. GLOBECOM 2006
Reza Omrani, P. Vijay Kumar:Codes for Optical CDMA. SETA 2006: 3446
P. Vijay Kumar, Petros Elia and K. Vinodh, “Efficient SpaceTime Codes from Cyclic Division Algebras,” Miltiary Communications Conference (MILCOM 2006), Washington DC, 2006, Oct. 2325.
Reza Omrani and P. Vijay Kumar, “Spreading Sequences for Asynchronous Spectrally Phase Encoded Optical CDMA,” presented at the IEEE Int. Symp. Inform Theory, Seattle, July 914, 2006.
Reza Omrani and P. Vijay Kumar, “OOCs, Partial Relative Difference Families, and a Conjecture of Golomb” presented at the IEEE Int. Symp. Inform Theory, Seattle, July 914, 2006.
Petros Elia and P. Vijay Kumar, “Unified Constructions of Cooperative Diversity Schemes for Asynchronous Wireless Networks,” presented at the IEEE Int. Symp. Inform Theory, Seattle, July 914, 2006.
Petros Elia, Frederique Oggier and P. Vijay Kumar, “Asymptotically Optimal Cooperative Wireless Networks without Constellation Expansion,” presented at the IEEE Int. Symp. Inform Theory, Seattle, July 914, 2006.
P. Vijay Kumar, “Achieving the DMG and DMD Tradeoffs of MIMO Fading Channels, ” Workshop on Information Theory & Applications, University of California San Diego, La Jolla, CA, Feb. 610, 2006.
P.Vijay Kumar,A.Chockalingam, Vinay Gangadhar, Nandita Lavanis ”Design of a Constrained High Data Rate CDMA System” accepted for the presentation in the National Conference on Communications (NCC 2006), Jan 2729,2006, New Delhi.
P. Elia and P.Vijay Kumar “Diversity Multiplexing Gain Optimality and Explicit Coding for Wireless Relay Networks”, presented at the FortyThird Allerton Conference on Communication, Control, and Computing, Sep. 2830, 2005.
P. Elia and P. Vijay Kumar, “Approximately Universal Schemes for Cooperative Diversity in Wireless Networks,” presented at the FortyThird Annual Allerton Conference on Communication, Control, and Computing, Sep. 2830,2005.
Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar and Hsiaofeng Lu “Explicit, SpaceTime Codes that achieve The DiversityMultiplexing Gain Tradeoff, ” Proc. IEEE Int.Symp. Inform. Theory, Sep 49, 2005, Adelaide, pp 896900.
Reza Omrani and P.Vijay Kumar, “Improved Constructions and Bounds for 2D Optical Orthogonal Codes,” Proc. IEEE Int. Symp.Inform Theory, Sep 49, 2005, Adelaide, pp.127131.
Reza Omrani, Oscar Moreno and P.Vijay Kumar, “Improved Johnson Bounds for Optical Orthogonal Codes with l > 1 and Some Optimal Constructions, ” Proc. IEEE Int. Symp. Inform Theory, Sep 49, 2005, Adelaide, PP259263.
Hsiaofeng Lu, Petros Elia, K. Raj Kumar, Sameer A. Pawar, and P. Vijay Kumar “SpaceTime codes meeting the DMG Tradeoff with low signaling complexity, ” 39th Annual Conference on Information Sciences and Systems, John Hopkins University, March 2005.
K.Raj Kumar, Sameer A. Pawar , Petros Elia, P.Vijay Kumar , and Hsiaofeng Lu ”Two Generalizations of the RankDistance SpaceTime Code”, Proc. National Conference on Communications, Jan 2830 ,2005, IIT, Kharagpur,India, pp. 492496.
K.Raj Kumar, Sameer A. Pawar , Petros Elia, P.Vijay Kumar , and Hsiaofeng Lu ” SpaceTime Codes Optimal Under the DiversityMultiplexing Gain Tradeoff”, Proc. National Conference on Communications, Jan 2830 ,2005, IIT, Kharagpur,India, pp. 487491.
2000  2004
Vummintala Shashidhar, B. Sundar Rajan, P. Vijay Kumar: Asymptoticinformationlossless designs and diversitymultiplexing tradeoff. GLOBECOM 2004: 366370
Reza Omrani, Petros Elia, P. Vijay Kumar: New Constructions and Bounds for 2D Optical Orthogonal Codes. SETA 2004: 389395
Reza Omrani, Oscar Moreno, P. Vijay Kumar: Topics on Optical Orthogonal Codes. SETA 2004: 396405
P.Elia, P.V.Kumar, S.A.Pawar, K.R.Kumar,B.S. Rajan,H.F.Lu ”DiversityMultiplexing Tradeoff Analysis of a Few Algebraic SpaceTime Constructions”, presented at the 2004 Allerton Conference , Sep 29Oct 1, 2004, Allerton House, University of Illinois.
Hsiaofeng Lu, Prof. P. Vijay Kumar, “Optimal Constructions of SpaceTime Codes over Multiple Fading Blocks”, Proc. IEEE Int. Symp. Inform. Theory, June 27  July 2, 2004, Chicago, pp. 408.
Hsiaofeng Lu, Prof. P. Vijay Kumar, “Generalized Unified Construction of SpaceTime Codes with Optimal RateDiversity Tradeoff”, Proc. IEEE Int. Symp. Inform. Theory, June 27  July 2, 2004, Chicago, pp. 95.
Yuankai Wang, Reza Omrani, Keith. M. Chugg and P. Vijay Kumar, “ LowDensity ParityCheck SpaceTime Codes: Performance Analysis and Code Construction,” Proc. IEEE Int. Symp. Inform. Theory, June 27  July 2, 2004, Chicago, pp. 156.
P. Vijay Kumar and Hsiaofeng (Francis) Lu, “On the Decoding and DiversityMultiplexing Gain Tradeoff of a Recent Multilevel Construction of SpaceTime Codes, ” Proc. IEEE Int. Symp. Inform. Theory, June 27  July 2, 2004, Chicago, pp. 128.
V. Shashidhar, B.Sundar Rajan and P.Vijay Kumar, “STBCs with optimal diversitymultiplexing tradeoff for 2,3 and 4 transmit antennas,” Proc. IEEE Int. Symp. Inform. Theory, June 27  July 2, 2004, Chicago, pp. 125.
Hsiaofeng Lu, Prof. P. Vijay Kumar, “ A Unified Construction of SpaceTime Codes with Optimal rateDiversity Tradeoff,” Proc. Tenth National Communications Conference (NCC 2004), Indian Institute of Science, Bangalore, Jan. 30  Feb. 1, 2004, p. 234.
Hsiaofeng Lu, P. Vijay Kumar: Constructing optimal spacetime codes over various signal constellations. GLOBECOM 2003: 19731977
Hsiaofeng Lu, P. Vijay Kumar: Algebraic constructions of optimal spacetime trellis codes. GLOBECOM 2003: 19841988.
H. F. Lu and P. V. Kumar, Ratediversity tradeoff of spacetime codes with fixed alphabet and optimal constructions for PSK modulation, in Proc. IEEE ISIT 2003, p. 242, Yokohama,Japan, June 2003.
O. Moreno, P. V. Kumar, and H. F. Lu, New constructions for optical orthogonal codes, distinct different sets, and difference triangle sets, in Proc. IEEE ISIT 2003, p. 327, Yokohama, Japan, June 2003
R. Omrani, H. F. Lu, P. V. Kumar, and O. Moreno, LDPC codes from optical orthogonal codes, in Proc. IEEE ISIT 2003, p. 60, Yokohama, Japan, June 2003.
Carlos Corrada, R. A. Scholtz, P. V. Kumar, “Permutation polynomials for interleavers in turbo codes,” Proc. IEEE International Symposium on Information Theory, June 29 – July 4, 2003, pp. 318.
Reza Omrani and P. V. Kumar, “2D Optical orthogonal Codes, ” Proc. 41st Annual Allerton Conference on Communication, Constrol and Computing, Oct. 13, 2003, pp. 885894.
Reza Omrani, P. Elia, Hsiaofeng Lu and P. V. Kumar, “Packing related bounds on the distance distribution of binary unrestricted codes,” Proc. 41st Annual Allerton Conference on Communication, Constrol and Computing, Oct. 13, 2003, pp. 502509.
“On The Performance of SpaceTime Codes,” Hsiaofeng Lu, Yuankai Wang, P. Vijay Kumar, and Keith M. Chugg, invited paper presented at the IEEE Information Theory Workshop, October 2125, 2002, Bangalore, India.
“On The Performance of SpaceTime Codes,” Hsiaofeng Lu, Yuankai Wang, P. Vijay Kumar, and Keith M. Chugg, presented at the International Symposium on Inform. Theory, June 2529, Lausanne, Switzerland, 2002.
“On Orthogonal Designs and SpaceTime Codes, ” Hsiaofeng Lu, P. Vijay Kumar and Habong Chung, presented at the International Symposium on Inform. Theory, June 2529, Lausanne, Switzerland, 2002.
“On the Distance Distribution of CDMA Multiuser Signal Set.” H.F. Francis Lu and P. Vijay Kumar, presented at the IEEE International Symposium on Information Theory,Washington, D.C. June 24  June 29, 2001./
“A Low Complexity Algorithm for the Construction of Algebraic Geometric Codes better than the GilbertVarshamov Bound,” Kenneth W. Shum, Ilia Aleshnikov, P. Vijay Kumar, Henning Stichtenoth, presented at the IEEE International Symposium on Information Theory, Washington, D.C. June 24  June 29, 2001.
R. A. Scholtz, P. V. Kumar and C. Corrada, “Signal Design for Ultrawideband Radio,” Sequences and their Applications, SETA’01, MAY 13–17, 2001 Bergen, Norway.
H. Stichtenoth, K. Shum, I. Aleshnikov, P. V. Kumar and Deolalikar, V. “A low complexity Algorithm for the Construction of Algebraic Geometric Codes better than the GilbertVarshomov Bound”, Sixth International Conference on Finite Fields and Applications, (Fq6,Oaxaca, Mexico, May 2125, 2001.
P. V. Kumar, H. F. Francis Lu, T. Helleseth, D.J. Shin, “On the Large Family of Low Correlation Quaternary Sequences S(2),” IEEE Intnl. Conf. Personal Wireless Comm., (ICPWC’2000), Hyderbad, December 1720, 2000.
H.F.F. Lu and P.V. Kumar, “A Novel Suboptimal CDMA Multiuser Detector,” ThirtyEighth Annual Allerton Conference on Communication, Control, and Computing, Allerton House, Monticello, Illinois, Oct. 36, 2000.
K. Shum, I. Aleshnikov, P. Vijay Kumar and H. Stichtenoth, “ An Order N3 Complexity Algorithm for Constructing Generator Matrices for AG Codes that Beat the GV Bound,” ThirtyEighth Annual Allerton Conference on Communication, Control, and Computing, Allerton House, Monticello, Illinois Oct. 3  6, 2000.
I. Aleshnikov, H. Stichtenoth, V. Deolalikar, P. Vijay Kumar, K. Shum “Results relating to code construction on a tower of function fields meeting the DrinfeldVladut bound” IEEE Intnl. Symp. Inform. Theory, Sorrento, Italy June 2530, 2000.
Hans Dobbertin, Tor Helleseth, P. Vijay Kumar, Halvard Movik Martinsen, “Ternary mSequences with ThreeValued Crosscorrelation Function: Two New Decimations,” IEEE Intnl. Symp. Inform. Theory, Sorrento, Italy June 2530, 2000.
I. Aleshnikov, P.V. Kumar, K. Shum, H. Stichtenoth, “Integral bases in a tower of function fields,” Proceedings of the Seventh International Workshop on Algebraic and Combinatorial Coding Theory, pp.2328, Bansko, Bulgaria, 1824 June 2000.
1990  1999
Ilia Aleshnikov, Vinay Deolalikar, P.Vijay Kumar, Ken Shum and Henning Stichtenoth, Towards a basis for the space of regular functions in a tower of function fields meeting the DrinfeldVladut bound” , invited long talk presented at the Seventh International Conference on Arithmetic, Geometry and Coding Theory (AGCT7), C.I.R.M. MarseilleLuminy, 2429 October, 1999.
Ilia Aleshnikov, Vinay Deolalikar, P.Vijay Kumar and Henning Stichtenoth, “Towards a basis for the space of regular functions in a tower of function fields meeting the DrinfeldVladut bound” , presented at the Fifth International Conference on Finite Fields and Applications, August 2  6, 1999, University of Augsburg, Germany.
Oscar Moreno, K. W. Shum, F. Castro and P. Vijay Kumar “A tight bound on the divisibility of exponential sums, ” presented at the Fifth International Conference on Finite Fields and Applications, August 2  6, 1999, University of Augsburg, Germany.
K. Shum, P. Vijay Kumar and T. Helleseth “On the zeta function of the Gold exponential sum,” presented at the Fifth International Conference on Finite Fields and Applications, August 2  6, 1999, University of Augsburg, Germany.
P. Vijay Kumar, “Recent Results on Sequences with Low Correlation,” 1999 IEEE Information Theory Workshop, Kruger National Park, South Africa, JUNE 20  25, 1999.
T. Helleseth, P. V. Kumar, H. M. Martinsen and P. Vijay Kumar, “Correlation Distribution of the Quaternary Kasami Sequences,” Proceedings of Sequences and their application (SETA98), December 1417, 1998.
P. Vijay Kumar, ”Sequences with low correlation and large linear span,” invited talk presented at the Summer Program: Coding and Cryptography, held at the Institute for Mathematics and its Applications, Minnesota, July 618, 1998.
P. Vijay Kumar, ”Z4Codes and Sequences,” invited talk presented at the NATO Advanced Study Institute Programme on Difference Sets, Sequences and their Correlation Properties, Aug. 214, Bad Windsheim, Germany, 1998.
A. Chang, T. Helleseth and P. Vijay Kumar, ”Further results on a conjectured 2level autocorrelation sequence,” invited talk presented at the 36th Annual Allerton Conference on Communication, Control and Computing, Allerton, IL, September 2325, 1998.
P. Vijay Kumar, ”An overview of recent developments on ideal autocorrelation sequences, ” invited talk presented at the International Conference on Sequences and their Applications, Singapore, Dec. 1417, 1998.
A. Chang, P. Gaal, S. W. Golomb, G. Gong and P. V. Kumar, ”On a sequence conjectured to have ideal 2level autocorrelation,” presented at the 1998 IEEE International Symposium on Information Theory, MIT, August 1621, 1998.
P. Vijay Kumar, Tor Helleseth: An Expansion for the Coordinates of the Trace Function over Galois Rings. Appl. Algebra Eng. Commun. Comput. 8(5): 353361 (1997)
P. V. Kumar and T. Helleseth, “Coordinates of trace sequences in Galois rings,” presented at the Arithmetic, Geometry and Coding Theory (AGCT6) Conference, C.I.R.M., Luminy, Marseille, France, June 2327, 1997.
T. Helleseth, P. V. Kumar, K. Yang and C. Rong, “On infinite families of 3designs from Preparata codes and related codes over Z4,” invited paper presented at the Thirty Fifth Annual Allerton Conference on Communication, Control and Computing, Urbana, IL, Sep. 29  Oct. 1, 1997.
A. G. Shanbhag and P. V. Kumar, “AlgebraicGeometric codes over Z4,” presented at the 1997 IEEE Int. Symp. Inform. Theory, Ulm, June 29July 4.
P. V. Kumar and T. Helleseth, “Coordinates of trace sequences in Galois rings,” presented at the Arithmetic, Geometry and Coding Theory (AGCT6) Conference, C.I.R.M., Luminy, Marseille, France, June 2327, 1997.
T. Helleseth, P. V. Kumar, A. Shanbhag and K. Yang, “ On the weight hierarchy of some Z4 codes,” presented at the Arithmetic, Geometry and Coding Theory (AGCT6) Conference, C.I.R.M., Luminy, Marseille, France, June 2327, 1997.
P. V. Kumar, “An overview of algebraic geometry codes,” presented at the 12th annual conference of the Ramanujan Mathematical Society, Shimoga, India, May 2224, 199
P. V. Kumar, DongJoon Shin and K. Shum, “On Sequence Design for CDMA,” Proceedings of the IEEE International Symp. on SpreadSpectrum Tech. and their Applns, Sep. 2225, Mainz, 1996.
T. Helleseth, P. V. Kumar and A. Shanbhag, “Exponential sums over Galois rings and their applications,” 3rd International Conference on Finite Fields and their Applications, Glasgow, U.K., July 1114, 1995
T. Helleseth, P. Vijay Kumar and A. G. Shanbhag, “Codes with the same weight distribution as the Goethals codes and the DelsarteGoethals codes,”, 900th meeting of the AMS, DePaul University, Chicago, March 2425, 1995.
P. V. Kumar, T. Helleseth and A. R. Calderbank, “An upper bound forWeil exponential sums over Galois rings and applications,” 900th meeting of the AMS, DePaul University, Chicago, March 2425, 1995.
T. Helleseth and P. V. Kumar, “A new proof of the minimum distance of the quaternary Preparata code and the Goethals code,” Proceedings on Optimal Codes and Related Topics, Sozopol, Bulgaria, May 26June 1, Bulgaria, (1995), 6973.
P. V. Kumar, T. Helleseth and P. V. Kumar, “Quaternary and binary sequences with low correlation,” IEEE Inform. Theory Workshop, Rydzyna, Poland, June 2529, 1995.
P. V. Kumar, T. Helleseth, H. Stichtenoth and A. G. Shanbhag, “Exponential sums over Galois rings,” Fifth conference on Algebraic Geometry and Coding Theory, Luminy, France, June 2630, 1995.
A. G. Shanbhag, P. V. Kumar and T. Helleseth, “An upper bound for extended Kloosterman sums over Galois rings,” IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sep. 1722, 1995.
A. G. Shanbhag, P. V. Kumar and T. Helleseth, “An upper bound for the aperiodic correlation of weighteddegree CDMA sequences,” IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sep. 1722, 1995.
T. Helleseth, P. V. Kumar and A. G. Shanbhag, “New codes with the same weight distributions as the Goethals codes and the DelsarteGoethals codes,” IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sep. 1722, 1995.
T. Helleseth, P. V. Kumar O. Moreno and A. G. Shanbhag, “Improved estimates for the minimum distance of weighteddegree Z −4trace codes,” IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sep. 1722, 1995.
T. Helleseth and P. V. Kumar, “The algebraic decoding of the Z4linear Goethals code,” IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sep. 1722, 1995.
P. V. Kumar, T. Helleseth, H. Stichtenoth and A. G. Shanbhag, “Exponential sums over Galois rings,” Fifth conference on Algebraic Geometry and Coding Theory, Luminy, France, June 2630, 1995.
T. Helleseth, P. V. Kumar, A. G. Shanbhag and K. Yang, “ On Galois rings: a HasseDavenporttype relation for Z4linear Kerdock code and applications,” presented at the 33rd annual Allerton Conference on Communication, Control and Computing, Allerton House, Monticello, Illinois, Oct. 46, 1995.
T. Helleseth and P. V. Kumar, “On the Weight Hierarchy of the Semiprimitive Codes,” presented at the Fourth International Workshop on Algebraic and Combinatorial Coding Theory, Novgorod, Russia, Sep. 1117, 1994.
O. Moreno, V. Zinoviev and P.V. Kumar, “The Exact Minimum Distance of Some Cyclic Codes,” Proc. Fourth International Workshop of Algebraic and Combinatorial Coding Theory, pp 150153, Novgorod, Russia September, 1994.
A. Shanbhag, P. V. Kumar and T. Helleseth, “Improved Binary Codes and Sequence Families from Z4Linear Codes, (invited) talk presented at the 32nd annual Allerton Conference on Communication, Control and Computing, Allerton House, Monticello, Illinois, Sep. 2830, 1994.
P. V. Kumar, T. Helleseth and A. R. Calderbank, “ An Upper Bound for Some Exponential Sums over Galois Rings of Even Characteristic and Applications,” (Long Paper) presented at the IEEE Int. Symp. on Inform. Theory, June 27July 2, Trondheim, Norway, 1994.
T. Helleseth and P. V. Kumar, “The Weight Hierarchy of the Kasami Codes,” presented at the IEEE Int. Symp. on Inform. Theory, June 27July 2, Trondheim, Norway, 1994.
P. V. Kumar, T. Helleseth and A. R. Calderbank, “ Large Families of Quaternary Sequences with Low Correlation,” presented at the IEEE Int. Symp. on Inform. Theory, June 27July 2, Trondheim, Norway, 1994.
P. V. Kumar, “ Exponential Sums over Galois Rings and their Applications,” (invited) talk given at the Coding Theory Gathering, June 2425, University of Bergen, Norway, 199
K. C. Yang, P. V. Kumar and H. Stichtenoth “On the Weight Hierarchy of Hermitian and Related Codes”, 4th Int. Workshop on Coding Theory and Algebraic Geometry, Luminy, France, June 28  July 2, 1993.
A. R. Hammons, Jr. and P. Vijay Kumar, “On the Apparent Duality of the Kerdock and Preparata Codes”, the IEEE Int. Symp. on Inform. Theory, January 1722, San Antonio, 1993.
O. Moreno, V. Zinoviev, Z. Zhang and P. V. Kumar, “A Family of Asymptotically Optical Orthogonal Codes”, the IEEE Int. Symp. on Inform. Theory, January 1722, San Antonio, 1993.
A. Roger Hammons Jr., P. Vijay Kumar, A. Robert Calderbank, Neil J. A. Sloane, Patrick Sole: On the Apparent Duality of the Kerdock and Preparata Codes. AAECC 1993: 1324
A. R. Hammons, Jr., P. V. Kumar “On a Recent FourPhase Sequence Design, ” (Invited Keynote Talk) delivered at the Second IEEE Int. Symp. on SpreadSpectrum Techniques and their Applications, Yokohama, Nov. 29 Dec.2 1992./
K. Yang and P. Vijay Kumar, “ On the True Minimum Distance of Hermitian Codes”, Lecture Notes in Mathematics, Vol. 1518, SpringerVerlag, pp. 99107, proceedings of the International Workshop on Coding Theory and Algebraic Geometry, Luminy, France, June 1721, 1991
A. Patapoutian and P. V. Kumar, “The (d, k) subcode of a Linear Block Code”, presented at the 1991 IEEE Int. Symp. on Inform. Theory, Budapest, Hungary, June 2428, 1991.
S. Bozta¸s, A.R. Hammons and P.V. Kumar, “NearOptimal 4phase Sequences for CDMA”, presented at the 1991 IEEE Int. Symp. on Inform. Theory, Budapest, Hungary, June 2428, 1991.
S. Bozta¸s and P. V. Kumar “Binary Goldlike Sequences with Larger Linear Span”, presented at the 1991 IEEE Int. Symp. on Inform. Theory, Budapest, Hungary, June 2428, 1991.
P. V. Kumar and V. Wei, “Minimum Distance of Logarithmic and Fractional Partial mSequences”, presented at the 1991 IEEE Int. Symp. on Inform. Theory, Budapest, Hungary, June 2428, 1991
P. V. Kumar and O. Moreno “Exponential Sums and Sequence Design,” presented at the Conference on Applications of Algebraic Geometry , Rio Piedras, Puerto Rico, January 812, 1990.
P. V. Kumar and O. Moreno “Primephase Sequences with Periodic Correlation Better than Binary Sequences”, IEEE Int. Symp. on Inform. Theory, San Diego, January 1419, 1990.
1983  1989
P. V. Kumar, “Connections Between Exponential Sums, Algebraic Curves and Sequence Design”, invited paper presented at the IEEE Inform. Theory Workshop, Ithaca, June 1989.
H. Chung and P.V. Kumar, “Optical Orthogonal Codes — New Bounds and an Optimal Construction,” presented at the TwentySixth Annual Allerton Conference, Urbana, IL, September 2830, 1988.
C.M. Liu and P.V. Kumar, “An Improved Decoding Algorithm for a Certain Class of Elliptic Codes,” presented at the TwentySixth Annual Allerton Conference, Urbana, IL, September 2830, 1988.
J.S. No and P.V. Kumar, “Exact Linear Span Expressions for a Family of Recently Discovered Binary Pseudorandom Sequences,” presented at the IEEE Int. Symp. on Inform. Theory, Kobe, Japan, June 1923, 1988.
P.V. Kumar, “Improving the Welch Lower Bound,” presented at the IEEE Int. Symp. on Inform. Theory, Kobe, Japan, June 1923, 1988.
J.S. No and P.V. Kumar, “A New Family of Binary Pseudorandom Sequences Having Optimal Periodic Correlation Properties and Large Linear Span,” presented at the IEEE Int. Communications Conference, Philadelphia, June 1215, 1988.
J.S. No and P.V. Kumar, “On the PartialPeriod Correlation Moments of GMW Sequences,” presented at the IEEE Military Communications Conference, Washington, D.C, October 1922, 1987.
C.M. Liu and P.V. Kumar, “On the Maximum Length of Goppa Codes over Elliptic Curves,” presented at the Conference on Coding and Algebraic Geometry, held in Luminy, France, October 1921, 1987.
H. Chung and P.V. Kumar, “Generalized Bent Functions  Some New General Constructions and Nonexistence Tests,” presented at the 1986 IEEE Int. Symp. on Inform. Theory, October 69, Ann Arbor, Michigan.
P.V. Kumar, “On the Existence of Square DotMatrix Patterns Having a Specific 3Valued PeriodicCorrelation Function,” presented at the 1985 IEEE Int. Symp. on Inform. Theory, June 2328, Brighton, England.
P.V. Kumar, “The PartialPeriod Correlation Moments of Arbitrary Binary Sequences,” 1985 IEEE Global Telecommunications Conference Record, pp. 499503, December 25, New Orleans, Louisiana.
P.V. Kumar, “FrequencyHopping Code Sequences Having Large Linear Span,” 1984 IEEE Global Telecommunications Conference Record, pp. 989993, November 2629.
P.V. Kumar, “Bent Functions  Their Properties and Applications,” Proc. of the Int. Conference on Computers, Systems and Signal Processing, Bangalore, India, December 1012, 1984.
P.V. Kumar and R.A. Scholtz, “Bounds on the Linear Span of Bent Sequences,” presented at the 1983 IEEE Int. Symp. on Inform. Theory, September 2630, St. Jovite, Canada.
