P Vijay Kumar
Home
Biography
Courses
Research
Awards & Honors
Books
Monograph
Conference
Conference Organization
Google Scholar
Journals
Patents
Recent Publications
Project
CSD Lab
Home
Members

Conference

2023

  • M N Krishnan M; Myna Vajha; Vinayak Ramkumar; P Vijay Kumar: Explicit Information-Debt-Optimal Streaming Codes with Small Memory. ISIT 2023.

  • Vinayak Ramkumar; Shobhit Bhatnagar; P Vijay Kumar: Near-Optimal Streaming Codes with Linear Field Size. ISIT 2023.

2022

  • V Ramkumar, MN Krishnan, M Vajha, PV Kumar: On Information-Debt-Optimal Streaming Codes With Small Memory, ISIT 2022.

  • S Singhvi, R Gayathri, PV Kumar: Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network, ISIT 2022.

  • S Bhatnagar, V Ramkumar, PV Kumar: Rate-Optimal Streaming Codes with Smaller Field Size Under Less-Stringent Decoding-Delay Requirements, ITW 2022.

2021

  • Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar: Locally Recoverable Streaming Codes for Packet-Erasure Recovery. ITW 2021.

  • Shobhit Bhatnagar, Biswadip Chakraborti and P. Vijay Kumar: Streaming codes for handling a combination of burst and random erasures. ITW 2021.

  • Myna Vajha, Vinayak Ramkumar, Mayank Jhamtani, P. Vijay Kumar: On the Performance Analysis of Streaming Codes over the Gilbert-Elliott Channel. ITW 2021.

  • Myna Vajha,Vinayak Ramkumar, M Nikhil Krishnan,P. Vijay Kumar: Explicit Rate-Optimal Streaming Codes with Smaller Field Size. ISIT 2021

  • Vinayak Ramkumar, Myna Vajha, P Vijay Kumar, Generalized Simple Streaming Codes from MDS Codes. ISIT 2021.

  • P Vijay Kumar, Dileep Dharmappa, Sugandh Mishra: Interleaved Z4-Linear Sequences with Improved Correlation for Satellite Navigation. ISIT 2021.

2020

  • Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar: Staggered Diagonal Embedding Based Linear Field Size Streaming Codes. ISIT 2020.

2019

  • M. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar: A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures. Finalist - Jack Keil Wolf Student Paper Award, ISIT 2019

  • Myna Vajha, V. S. Chaitanya Mukka, P. Vijay Kumar:Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes. ISIT 2019.

  • Vinayak Ramkumar, P Vijay Kumar: Coded MapReduce Schemes Based on Placement Delivery Array. ISIT 2019.

2018

  • M. Nikhil Krishnan, Anantha Narayanan R., P. Vijay Kumar: Codes with Combined Locality and Regeneration Having Optimal Rate, dmin and Linear Field Size. ISIT 2018

  • M N Krishnan, P V Kumar: Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures. ISIT 2018

  • M Vajha, B S Babu, P V Kumar: Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for d= k+1, k+2, k+3. ISIT 2018

  • S B Balaji, P V Kumar: A Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes. ISIT 2018

  • Balaji Srinivasan Babu, Ganesh Kini and P Vijay Kumar: A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length. NCC 2018

  • Vinayak Ramkumar, Myna Vajha and P Vijay Kumar: Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code. NCC 2018

  • Myna Vajha, Vinayak Ramkumar, Bhagyashree Puranik, Ganesh R. Kini, Elita Lobo, Birenjith Sasidharan, P. Vijay Kumar, Alexandar Barg, Min Ye, Srinivasan Narayanamurthy, Syed Hussain, Siddhartha Nandi: Clay Codes: Moulding MDS Codes to Yield an MSR Code. USENIX, FAST 2018 [pdf]

2017

  • Tarun Choubisa, Mohan Kashyap, Sampad B. Mohanty, P. Vijay Kumar: Comparing chirplet-based classification with alternate feature-extraction approaches for outdoor intrusion detection using a pir sensor platform. ICACCI 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, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and d<(n-1). ISIT 2017 [ArXiv]

  • Tarun Choubisa, Sampad B. Mohanty, Mohan Kashyap, Shivangi Gambhir, Kodur Krishna Chaitanya, A. Sridhar, P. Vijay Kumar: An Optical-Camera Complement to a PIR Sensor Array for Intrusion Detection and Classfication in an Outdoor Environment. LCN Workshops 2017

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 Sensor-Based 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

  1. Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar: Codes with hierarchical locality. ISIT 2015: 1257-1261

  2. S. B. Balaji, P. Vijay Kumar: On partial maximally-recoverable and maximally-recoverable codes. ISIT 2015: 1881-1885

  3. Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar: A high-rate MSR code with polynomial sub-packetization level. ISIT 2015: 2051-2055

  4. 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 animation-and-chirplet based approach to intruder classification using PIR sensing. ISSNIP 2015: 1-6

  5. Kaushik Senthoor, Birenjith Sasidharan, P. Vijay Kumar: Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets. ITW 2015: 1-5

2014

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

  2. N. Prakash, V. Lalitha, P. Vijay Kumar: Codes with locality for two erasures. ISIT 2014: 1962-1966

  3. Birenjith Padmakumari Sasidharan, Kaushik Senthoor, P. Vijay Kumar: An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codes. ISIT 2014: 2430-2434

2013

  • Birenjith Sasidharan, P. Vijay Kumar: On the interior points of the storage-repair bandwidth tradeoff of regenerating codes. Allerton 2013: 788-795

  1. Govinda M. Kamath, Natalia Silberstein, N. Prakash, Ankit Singh Rawat, V. Lalitha, Onur Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath:Explicit MBR all-symbol locality codes. ISIT 2013: 504-508

  2. Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar: Codes with local regeneration. ISIT 2013: 1606-1610

  3. Birenjith Sasidharan, P. Vijay Kumar:High-rate regenerating codes through layering.ISIT 2013: 1611-1615

  4. Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:Codes with local regeneration. ITA 2013: 1-5

2012

  1. K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar: Regenerating codes for errors and erasures in distributed storage. ISIT 2012: 1202-1206

  2. N. Prakash, Govinda M. Kamath, V. Lalitha, P. Vijay Kumar: Optimal linear codes with a local-error-correction property. ISIT 2012: 2776-2780

  3. Govinda M. Kamath, N. Prakash, V. Lalitha, and P. Vijay Kumar. “Optimal Linear Codes with a Local-Error-Correction Capability” (Invited) in IEEE Information Theory and Applications (ITA) workshop, San Diego, Feb. 2012.

  4. Govinda M. Kamath and P. Vijay Kumar. “Regenerating Codes: A Reformulated Storage- Bandwidth Trade-off and a New Construction.” in Proc. of the National Conference on Communation 2012(NCC 2012), IIT Karagpur, India.

  5. V. Lalitha, N. Prakash, Govinda M. Kamath and P. Vijay Kumar. “On T-Designs 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

  1. N. E. Venkatesan, Tarun Agarwal, V. Lalitha, P. Vijay Kumar: Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point. Ad Hoc Networks 9(6): 1015-1027 (2011)

  2. 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: 1202-1209

  3. Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar: Information-Theoretically Secure Regenerating Codes for Distributed Storage. GLOBECOM 2011: 1-5

  4. K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar: Enabling node repair in any erasure code for distributed storage. ISIT 2011: 1235-1239

2010

  1. K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran: Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage. ISIT 2010: 1938-1942

  2. Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar: A flexible class of regenerating codes for distributed storage. ISIT 2010: 1943-1947

  3. K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran: Explicit and optimal codes for distributed storage. ITA 2010: 240-244

  4. Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran: Regenerating Codes for Distributed Storage Networks. WAIFI 2010: 215-223

  5. K. Vinodh, V. Lalitha, N. Prakash, “On the Achievable Rates of Sources having a Group Alphabet in a Distributed Source Coding Setting,” Forty-Eighth Annual Allerton Conference on Communication, Control, and Computing, September 29 October 1, 2010, Allerton Retreat Center, Monticello, Illinois.

  6. 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. 28-31, 2010.

  7. 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. 28-31, 2010.

  8. 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. 28-31, 2010.

  9. 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. 6-8, 2010.

  10. K. Sreeram, P. S. Birenjith, P. Vijay Kumar, “ DMT of Multi-hop Cooperative Networks,” (invited paper) presented at the 2010 IEEE Inform. Th. Workshop, Cairo, Jan. 6-8, 2010.

2005 - 2009

  1. 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, Urbana-Champaign, Sep. 2009.

  2. Abu Sajana R., Ramanathan Subramanian, P. Vijay Kumar, Syam Krishnan, Bharadwaj Amrutur,Jeena Sebastian, Malati Hegde, S. V. R. Anand, “A Low-Complexity Algorithm for Intrusion Detection in a PIR-Based Wireless Sensor Network,” proceedings of the Fifth International Conference on Intelligent Sensors, Sensor Networks and Information Processing, Melbourne, December 7-10, 2009.

  3. Petros Elia, P. Vijay Kumar: Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels. ISIT 2009: 2813-2817

  4. Avik Ray, Ghaya Rekaya-Ben Othman, P. Vijay Kumar, K. Vinodh: Ideal structure of the Silver code. ISIT 2009: 2818-2822

  5. 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 Urbana-Champaign, Sep 23-26, 2008.

  6. G. Garg, P. Vijay Kumar and C. E. Veni Madhavan, “ Two new families of low-correlation interleaved QAM sequences ”, presented at the International Conference on Sequences and Their Applications (SETA), University of Kentucky, Lexington, KY, Sept. 14-18, 2008.

  7. K. Sreeram , S. Birenjith, P. Vijay Kumar, “Multi-hop 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.

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

  9. Gagan Garg, P. Vijay Kumar and C. E. Veni Madhavan, “Low correlation interleaved QAM sequences,” Proceedings of National Conference in Communication, Feb 2008.

  10. N. E. Venkatesan, Tarun Agarwal, P. Vijay Kumar: On the Average Case Communication Complexity for Detection in Sensor Networks. DCOSS 2008: 176-189

  11. K. Sreeram, S. Birenjith, P. Vijay Kumar: Diversity and degrees of freedom of cooperative wireless networks. ISIT 2008: 1253-1257

  12. Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan: Low correlation interleaved QAM sequences. ISIT 2008: 1935-1939

  13. K. Sreeram, S. Birenjith, P. Vijay Kumar: DMT of multi-hop cooperative networks-Part I: K-Parallel-Path networks. ISIT 2008: 2076-2080

  14. K. Sreeram, S. Birenjith, P. Vijay Kumar: DMT of multi-hop cooperative networks-Part II: Layered and multi-antenna networks. ISIT 2008: 2081-2085

  15. Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan: Two New Families of Low-Correlation Interleaved QAM Sequences. SETA 2008: 130-141

  16. Reza Omrani, Pankaj Bhambhani, P. Vijay Kumar: Sequences for Phase-Encoded Optical CDMA. SSC 2007: 95-105

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

  18. K. Sreeram , S. Birenjith, K. Vinodh, M. Anand, P. Vijay Kumar, “On the throughput, DMT and optimal code construction of the K-parallel-path cooperative wireless fading network,” Wireless Personal Multimedia Communications (WPMC’ 07), Jaipur, Dec. 2007.

  19. Petros Elia, K. Vinodh, M. Anand, P. Vijay Kumar, “D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols,” IEEE Intl. Symp. Inform.Theory, Nice, June 2007, pp.681-686.

  20. M. Anand, P. Vijay Kumar “Low Correlation Sequences over AM-PSK and QAM Alphabets,” IEEE Intl. Symp. Inform. Theory, Nice, June 2007, pp.2521-2525.

  21. P. Vijay Kumar, K. Vinodh, M. Anand, P. Elia, “Diversity-Multiplexing Gain Tradeoff and DMT-Optimal Distributed Space-Time Codes for Certain Certain Cooperative Communication Protocols: Overview and Recent Results,” invited paper at the Information Theory and Applications Workshop , UCSD, Feb 2007.

  22. P. Vijay Kumar “Cooperative Diversity in Fading Wireless Networks Through Distributed Space-Time Codes,” invited talk given at the 13th National Conference on Communications (NCC 2007), January 26-28, 2007, Indian Institute of Technology, Kanpur.

  23. P. Vijay Kumar, Reza Omrani, Joe Touch, Alan E. Willner, Poorya Saghari: A Novel Optical CDMA Modulation Scheme: Code Cycle Modulation. GLOBECOM 2006

  24. Reza Omrani, P. Vijay Kumar:Codes for Optical CDMA. SETA 2006: 34-46

  25. P. Vijay Kumar, Petros Elia and K. Vinodh, “Efficient Space-Time Codes from Cyclic Division Algebras,” Miltiary Communications Conference (MILCOM 2006), Washington DC, 2006, Oct. 23-25.

  26. 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 91-4, 2006.

  27. 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 91-4, 2006.

  28. 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 91-4, 2006.

  29. 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 91-4, 2006.

  30. P. Vijay Kumar, “Achieving the D-MG and DMD Tradeoffs of MIMO Fading Channels, ” Workshop on Information Theory & Applications, University of California San Diego, La Jolla, CA, Feb. 6-10, 2006.

  31. 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 27-29,2006, New Delhi.

  32. P. Elia and P.Vijay Kumar “Diversity Multiplexing Gain Optimality and Explicit Coding for Wireless Relay Networks”, presented at the Forty-Third Allerton Conference on Communication, Control, and Computing, Sep. 28-30, 2005.

  33. P. Elia and P. Vijay Kumar, “Approximately Universal Schemes for Cooperative Diversity in Wireless Networks,” presented at the Forty-Third Annual Allerton Conference on Communication, Control, and Computing, Sep. 28-30,2005.

  34. Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar and Hsiao-feng Lu “Explicit, Space-Time Codes that achieve The Diversity-Multiplexing Gain Tradeoff, ” Proc. IEEE Int.Symp. Inform. Theory, Sep 4-9, 2005, Adelaide, pp 896-900.

  35. Reza Omrani and P.Vijay Kumar, “Improved Constructions and Bounds for 2-D Optical Orthogonal Codes,” Proc. IEEE Int. Symp.Inform Theory, Sep 4-9, 2005, Adelaide, pp.127-131.

  36. 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 4-9, 2005, Adelaide, PP-259-263.

  37. Hsiao-feng Lu, Petros Elia, K. Raj Kumar, Sameer A. Pawar, and P. Vijay Kumar “Space-Time codes meeting the D-MG Tradeoff with low signaling complexity, ” 39th Annual Conference on Information Sciences and Systems, John Hopkins University, March 2005.

  38. K.Raj Kumar, Sameer A. Pawar , Petros Elia, P.Vijay Kumar , and Hsiao-feng Lu ”Two Generalizations of the Rank-Distance Space-Time Code”, Proc. National Conference on Communications, Jan 28-30 ,2005, IIT, Kharagpur,India, pp. 492-496.

  39. K.Raj Kumar, Sameer A. Pawar , Petros Elia, P.Vijay Kumar , and Hsiao-feng Lu ” Space-Time Codes Optimal Under the Diversity-Multiplexing Gain Tradeoff”, Proc. National Conference on Communications, Jan 28-30 ,2005, IIT, Kharagpur,India, pp. 487-491.

2000 - 2004

  1. Vummintala Shashidhar, B. Sundar Rajan, P. Vijay Kumar: Asymptotic-information-lossless designs and diversity-multiplexing tradeoff. GLOBECOM 2004: 366-370

  2. Reza Omrani, Petros Elia, P. Vijay Kumar: New Constructions and Bounds for 2-D Optical Orthogonal Codes. SETA 2004: 389-395

  3. Reza Omrani, Oscar Moreno, P. Vijay Kumar: Topics on Optical Orthogonal Codes. SETA 2004: 396-405

  4. P.Elia, P.V.Kumar, S.A.Pawar, K.R.Kumar,B.S. Rajan,H.-F.Lu ”DiversityMultiplexing Tradeoff Analysis of a Few Algebraic Space-Time Constructions”, presented at the 2004 Allerton Conference , Sep 29-Oct 1, 2004, Allerton House, University of Illinois.

  5. Hsiao-feng Lu, Prof. P. Vijay Kumar, “Optimal Constructions of Space-Time Codes over Multiple Fading Blocks”, Proc. IEEE Int. Symp. Inform. Theory, June 27 - July 2, 2004, Chicago, pp. 408.

  6. Hsiao-feng Lu, Prof. P. Vijay Kumar, “Generalized Unified Construction of Space-Time Codes with Optimal Rate-Diversity Tradeoff”, Proc. IEEE Int. Symp. Inform. Theory, June 27 - July 2, 2004, Chicago, pp. 95.

  7. Yuankai Wang, Reza Omrani, Keith. M. Chugg and P. Vijay Kumar, “ Low-Density Parity-Check Space-Time Codes: Performance Analysis and Code Construction,” Proc. IEEE Int. Symp. Inform. Theory, June 27 - July 2, 2004, Chicago, pp. 156.

  8. P. Vijay Kumar and Hsiao-feng (Francis) Lu, “On the Decoding and Diversity-Multiplexing Gain Tradeoff of a Recent Multilevel Construction of Space-Time Codes, ” Proc. IEEE Int. Symp. Inform. Theory, June 27 - July 2, 2004, Chicago, pp. 128.

  9. V. Shashidhar, B.Sundar Rajan and P.Vijay Kumar, “STBCs with optimal diversity-multiplexing tradeoff for 2,3 and 4 transmit antennas,” Proc. IEEE Int. Symp. Inform. Theory, June 27 - July 2, 2004, Chicago, pp. 125.

  10. Hsiao-feng Lu, Prof. P. Vijay Kumar, “ A Unified Construction of Space-Time Codes with Optimal rate-Diversity Tradeoff,” Proc. Tenth National Communications Conference (NCC 2004), Indian Institute of Science, Bangalore, Jan. 30 - Feb. 1, 2004, p. 234.

  11. Hsiao-feng Lu, P. Vijay Kumar: Constructing optimal space-time codes over various signal constellations. GLOBECOM 2003: 1973-1977

  12. Hsiao-feng Lu, P. Vijay Kumar: Algebraic constructions of optimal space-time trellis codes. GLOBECOM 2003: 1984-1988.

  13. H. F. Lu and P. V. Kumar, Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions for PSK modulation, in Proc. IEEE ISIT 2003, p. 242, Yokohama,Japan, June 2003.

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

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

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

  17. Reza Omrani and P. V. Kumar, “2-D Optical orthogonal Codes, ” Proc. 41st Annual Allerton Conference on Communication, Constrol and Computing, Oct. 1-3, 2003, pp. 885-894.

  18. Reza Omrani, P. Elia, Hsiao-feng 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. 1-3, 2003, pp. 502-509.

  19. “On The Performance of Space-Time Codes,” Hsiao-feng Lu, Yuankai Wang, P. Vijay Kumar, and Keith M. Chugg, invited paper presented at the IEEE Information Theory Workshop, October 21-25, 2002, Bangalore, India.

  20. “On The Performance of Space-Time Codes,” Hsiao-feng Lu, Yuankai Wang, P. Vijay Kumar, and Keith M. Chugg, presented at the International Symposium on Inform. Theory, June 25-29, Lausanne, Switzerland, 2002.

  21. “On Orthogonal Designs and Space-Time Codes, ” Hsiao-feng Lu, P. Vijay Kumar and Habong Chung, presented at the International Symposium on Inform. Theory, June 25-29, Lausanne, Switzerland, 2002.

  22. “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./

  23. “A Low Complexity Algorithm for the Construction of Algebraic Geometric Codes better than the Gilbert-Varshamov 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.

  24. R. A. Scholtz, P. V. Kumar and C. Corrada, “Signal Design for Ultra-wideband Radio,” Sequences and their Applications, SETA’01, MAY 13–17, 2001 Bergen, Norway.

  25. 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 Gilbert-Varshomov Bound”, Sixth International Conference on Finite Fields and Applications, (Fq6,Oaxaca, Mexico, May 21-25, 2001.

  26. 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 17-20, 2000.

  27. H.F.F. Lu and P.V. Kumar, “A Novel Suboptimal CDMA Multiuser Detector,” Thirty-Eighth Annual Allerton Conference on Communication, Control, and Computing, Allerton House, Monticello, Illinois, Oct. 3-6, 2000.

  28. 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 G-V Bound,” Thirty-Eighth Annual Allerton Conference on Communication, Control, and Computing, Allerton House, Monticello, Illinois Oct. 3 - 6, 2000.

  29. I. Aleshnikov, H. Stichtenoth, V. Deolalikar, P. Vijay Kumar, K. Shum “Results relating to code construction on a tower of function fields meeting the Drinfeld-Vladut bound” IEEE Intnl. Symp. Inform. Theory, Sorrento, Italy June 25-30, 2000.

  30. Hans Dobbertin, Tor Helleseth, P. Vijay Kumar, Halvard Movik Martinsen, “Ternary m-Sequences with Three-Valued Cross-correlation Function: Two New Decimations,” IEEE Intnl. Symp. Inform. Theory, Sorrento, Italy June 25-30, 2000.

  31. 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.23-28, Bansko, Bulgaria, 18-24 June 2000.

1990 - 1999

  1. 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 Drinfeld-Vladut bound” , invited long talk presented at the Seventh International Conference on Arithmetic, Geometry and Coding Theory (AGCT-7), C.I.R.M. Marseille-Luminy, 24-29 October, 1999.

  2. 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 Drinfeld-Vladut bound” , presented at the Fifth International Conference on Finite Fields and Applications, August 2 - 6, 1999, University of Augsburg, Germany.

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

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

  5. P. Vijay Kumar, “Recent Results on Sequences with Low Correlation,” 1999 IEEE Information Theory Workshop, Kruger National Park, South Africa, JUNE 20 - 25, 1999.

  6. 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 (SETA-98), December 14-17, 1998.

  7. 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 6-18, 1998.

  8. P. Vijay Kumar, ”Z4-Codes and Sequences,” invited talk presented at the NATO Advanced Study Institute Programme on Difference Sets, Sequences and their Correlation Properties, Aug. 2-14, Bad Windsheim, Germany, 1998.

  9. A. Chang, T. Helleseth and P. Vijay Kumar, ”Further results on a conjectured 2-level autocorrelation sequence,” invited talk presented at the 36th Annual Allerton Conference on Communication, Control and Computing, Allerton, IL, September 23-25, 1998.

  10. 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. 14-17, 1998.

  11. A. Chang, P. Gaal, S. W. Golomb, G. Gong and P. V. Kumar, ”On a sequence conjectured to have ideal 2-level autocorrelation,” presented at the 1998 IEEE International Symposium on Information Theory, MIT, August 16-21, 1998.

  12. P. Vijay Kumar, Tor Helleseth: An Expansion for the Coordinates of the Trace Function over Galois Rings. Appl. Algebra Eng. Commun. Comput. 8(5): 353-361 (1997)

  13. P. V. Kumar and T. Helleseth, “Coordinates of trace sequences in Galois rings,” presented at the Arithmetic, Geometry and Coding Theory (AGCT-6) Conference, C.I.R.M., Luminy, Marseille, France, June 23-27, 1997.

  14. T. Helleseth, P. V. Kumar, K. Yang and C. Rong, “On infinite families of 3-designs 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.

  15. A. G. Shanbhag and P. V. Kumar, “Algebraic-Geometric codes over Z4,” presented at the 1997 IEEE Int. Symp. Inform. Theory, Ulm, June 29-July 4.

  16. P. V. Kumar and T. Helleseth, “Coordinates of trace sequences in Galois rings,” presented at the Arithmetic, Geometry and Coding Theory (AGCT-6) Conference, C.I.R.M., Luminy, Marseille, France, June 23-27, 1997.

  17. 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 (AGCT-6) Conference, C.I.R.M., Luminy, Marseille, France, June 23-27, 1997.

  18. P. V. Kumar, “An overview of algebraic geometry codes,” presented at the 12th annual conference of the Ramanujan Mathematical Society, Shimoga, India, May 22-24, 199

  19. P. V. Kumar, Dong-Joon Shin and K. Shum, “On Sequence Design for CDMA,” Proceedings of the IEEE International Symp. on Spread-Spectrum Tech. and their Applns, Sep. 22-25, Mainz, 1996.

  20. 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 11-14, 1995

  21. T. Helleseth, P. Vijay Kumar and A. G. Shanbhag, “Codes with the same weight distribution as the Goethals codes and the Delsarte-Goethals codes,”, 900th meeting of the AMS, DePaul University, Chicago, March 24-25, 1995.

  22. 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 24-25, 1995.

  23. 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 26-June 1, Bulgaria, (1995), 69-73.

  24. P. V. Kumar, T. Helleseth and P. V. Kumar, “Quaternary and binary sequences with low correlation,” IEEE Inform. Theory Workshop, Rydzyna, Poland, June 25-29, 1995.

  25. 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 26-30, 1995.

  26. 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. 17-22, 1995.

  27. A. G. Shanbhag, P. V. Kumar and T. Helleseth, “An upper bound for the aperiodic correlation of weighted-degree CDMA sequences,” IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sep. 17-22, 1995.

  28. T. Helleseth, P. V. Kumar and A. G. Shanbhag, “New codes with the same weight distributions as the Goethals codes and the Delsarte-Goethals codes,” IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sep. 17-22, 1995.

  29. T. Helleseth, P. V. Kumar O. Moreno and A. G. Shanbhag, “Improved estimates for the minimum distance of weighted-degree Z −4-trace codes,” IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sep. 17-22, 1995.

  30. T. Helleseth and P. V. Kumar, “The algebraic decoding of the Z4-linear Goethals code,” IEEE Int. Symp. Inform. Theory, Whistler, Canada, Sep. 17-22, 1995.

  31. 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 26-30, 1995. T. Helleseth, P. V. Kumar, A. G. Shanbhag and K. Yang, “ On Galois rings: a Hasse-Davenport-type relation for Z4-linear Kerdock code and applications,” presented at the 33rd annual Allerton Conference on Communication, Control and Computing, Allerton House, Monticello, Illinois, Oct. 4-6, 1995.

  32. 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. 11-17, 1994.

  33. 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 150-153, Novgorod, Russia September, 1994.

  34. A. Shanbhag, P. V. Kumar and T. Helleseth, “Improved Binary Codes and Sequence Families from Z4-Linear Codes, (invited) talk presented at the 32nd annual Allerton Conference on Communication, Control and Computing, Allerton House, Monticello, Illinois, Sep. 28-30, 1994.

  35. 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 27-July 2, Trondheim, Norway, 1994.

  36. T. Helleseth and P. V. Kumar, “The Weight Hierarchy of the Kasami Codes,” presented at the IEEE Int. Symp. on Inform. Theory, June 27-July 2, Trondheim, Norway, 1994.

  37. 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 27-July 2, Trondheim, Norway, 1994.

  38. P. V. Kumar, “ Exponential Sums over Galois Rings and their Applications,” (invited) talk given at the Coding Theory Gathering, June 24-25, University of Bergen, Norway, 199

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

  40. 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 17-22, San Antonio, 1993.

  41. 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 17-22, San Antonio, 1993.

  42. 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: 13-24

  43. A. R. Hammons, Jr., P. V. Kumar “On a Recent Four-Phase Sequence Design, ” (Invited Keynote Talk) delivered at the Second IEEE Int. Symp. on Spread-Spectrum Techniques and their Applications, Yokohama, Nov. 29- Dec.2 1992./

  44. K. Yang and P. Vijay Kumar, “ On the True Minimum Distance of Hermitian Codes”, Lecture Notes in Mathematics, Vol. 1518, Springer-Verlag, pp. 99-107, proceedings of the International Workshop on Coding Theory and Algebraic Geometry, Luminy, France, June 17-21, 1991

  45. 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 24-28, 1991.

  46. S. Bozta¸s, A.R. Hammons and P.V. Kumar, “Near-Optimal 4-phase Sequences for CDMA”, presented at the 1991 IEEE Int. Symp. on Inform. Theory, Budapest, Hungary, June 24-28, 1991.

  47. S. Bozta¸s and P. V. Kumar “Binary Gold-like Sequences with Larger Linear Span”, presented at the 1991 IEEE Int. Symp. on Inform. Theory, Budapest, Hungary, June 24-28, 1991.

  48. P. V. Kumar and V. Wei, “Minimum Distance of Logarithmic and Fractional Partial m-Sequences”, presented at the 1991 IEEE Int. Symp. on Inform. Theory, Budapest, Hungary, June 24-28, 1991

  49. 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 8-12, 1990.

  50. P. V. Kumar and O. Moreno “Prime-phase Sequences with Periodic Correlation Better than Binary Sequences”, IEEE Int. Symp. on Inform. Theory, San Diego, January 14-19, 1990.

1983 - 1989

  1. P. V. Kumar, “Connections Between Exponential Sums, Algebraic Curves and Sequence Design”, invited paper presented at the IEEE Inform. Theory Workshop, Ithaca, June 1989.

  2. H. Chung and P.V. Kumar, “Optical Orthogonal Codes — New Bounds and an Optimal Construction,” presented at the Twenty-Sixth Annual Allerton Conference, Urbana, IL, September 28-30, 1988.

  3. C.M. Liu and P.V. Kumar, “An Improved Decoding Algorithm for a Certain Class of Elliptic Codes,” presented at the Twenty-Sixth Annual Allerton Conference, Urbana, IL, September 28-30, 1988.

  4. 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 19-23, 1988.

  5. P.V. Kumar, “Improving the Welch Lower Bound,” presented at the IEEE Int. Symp. on Inform. Theory, Kobe, Japan, June 19-23, 1988.

  6. 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 12-15, 1988.

  7. J.S. No and P.V. Kumar, “On the Partial-Period Correlation Moments of GMW Sequences,” presented at the IEEE Military Communications Conference, Washington, D.C, October 19-22, 1987.

  8. 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 19-21, 1987.

  9. 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 6-9, Ann Arbor, Michigan.

  10. P.V. Kumar, “On the Existence of Square Dot-Matrix Patterns Having a Specific 3-Valued Periodic-Correlation Function,” presented at the 1985 IEEE Int. Symp. on Inform. Theory, June 23-28, Brighton, England.

  11. P.V. Kumar, “The Partial-Period Correlation Moments of Arbitrary Binary Sequences,” 1985 IEEE Global Telecommunications Conference Record, pp. 499-503, December 2-5, New Orleans, Louisiana.

  12. P.V. Kumar, “Frequency-Hopping Code Sequences Having Large Linear Span,” 1984 IEEE Global Telecommunications Conference Record, pp. 989-993, November 26-29.

  13. P.V. Kumar, “Bent Functions - Their Properties and Applications,” Proc. of the Int. Conference on Computers, Systems and Signal Processing, Bangalore, India, December 10-12, 1984.

  14. 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 26-30, St. Jovite, Canada.