Journals

2021 - 2023

1. Myna Vajha, Vinayak Ramkumar, M Nikhil Krishnan, P. Vijay Kumar, ”Explicit Rate-Optimal Streaming Codes With Smaller Field Size”, IEEE Transactions on Information Theory, Oct. 2023.

2. Myna Vajha, SB Balaji, P Vijay Kumar,”,Small-d MSR Codes with Optimal Access, Optimal Sub-Packetization and Linear Field Size”, IEEE Transactions on Information Theory, Vol. 69, No. 7, July. 2023, pp.4303-4332.

3. SB Balaji, M Vajha, PV Kumar,”,Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound”,IEEE Transactions on Information Theory, Vol. 68, No. 10, Jun 2022, PP. 6452-6471.

2015 - 2020

1. M. Nikhil Krishnan, Deeptanshu Shukla, and P. Vijay Kumar,“Low Field-size, Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures”, IEEE Communications Letters (accepted)

2. M. Nikhil Krishnan, Deeptanshu Shukla, and P. Vijay Kumar, “Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures,”IEEE Trans. on Information Theory, Vol. 66, No. 8, Aug. 2020, pp.4869-4891

3. S. B. Balaji, Ganesh R. Kini , and P. Vijay Kumar , “A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures,” IEEE Trans. on Information Theory, Vol. 66, No. 2, Feb. 2020, pp.1023-1052.

4. Nikhil Krishnan*, Vinayak Ramkumar*, Myna Vajha*, P. Vijay Kumar*, “Simple Streaming Codes for Reliable, Low-Latency Communication,” in IEEE Communications Letters, Vol. 24, No. 2, pp. 249-253, Feb. 2020.

5. N. Prakash, V. Lalitha, S. B. Balaji, P. Vijay Kumar, “Codes with Locality for Two Erasures”, IEEE Trans. Inform. Theory,Vol. 65 No. 12 pp. 7771 - 7789, Dec. 2019.

6. Balaji S. B, M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, P. Vijay Kumar, ‘‘Erasure coding for distributed storage: an overview,’’ Sci China Inf Sci, October 2018.

7. M Nikhil Krishnan, Bhagyashree Puranik, P Vijay Kumar, Itzhak Tamo, Alexander Barg: Exploiting Locality for Improved Decoding of Binary Cyclic Codes. IEEE Transactions on Communications Vol.66 No.6 pp.2346 - 2358, June 2018.

8. Guang Gong, Tor Helleseth, P. Vijay Kumar: Solomon W. Golomb - Mathematician, Engineer, and Pioneer. IEEE Trans. Information Theory, Vol.64 No.4, pp. 2844 - 2857, April 2018.

9. K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar: Information-Theoretically Secure Erasure Codes for Distributed Storage. IEEE Trans. Information Theory Vol.64 No.3, pp. March 2018.

10. Birenjith Sasidharan, N. Prakash, M. Nikhil Krishnan, Myna Vajha, Kaushik Senthoor and P. Vijay Kumar: Outer Bounds on the Storage-Repair Bandwidth Tradeoff of Exact-Repair Regenerating Codes. International Journal of Information and Coding Theory, Special Issue on “Information and Coding Theory for Data Storage” (2016). pdf

11. Chao Tian, Birenjith Sasidharan, Vaneet Aggarwal, Vinay A. Vaishampayan, P. Vijay Kumar: Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs. IEEE Trans. Information Theory Vol.61, No.4,pp. 1933-1947, 2015.

2010 - 2014

1. Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar: Codes With Local Regeneration and Erasure Correction. IEEE Trans. Information Theory 60(8): 4637-4660 (2014).

2. V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan: Linear Coding Schemes for the Distributed Computation of Subspaces. IEEE Journal on Selected Areas in Communications 31(4): 678-690 (2013).

3. K. Sreeram, S. Birenjith, P. Vijay Kumar: DMT of Parallel-Path and Layered Networks Under the Half-Duplex Constraint. IEEE Trans. Information Theory 59(6): 3875-3891 (2013).

4. K. Sreeram, S. Birenjith, P. Vijay Kumar:DMT of Multihop Networks: End Points and Computational Tools. IEEE Trans. Information Theory 58(2): 804-819 (2012).

5. Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia, Pankaj Bhambhani: Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes. IEEE Trans. Information Theory 58(2): 1163-1185 (2012).

6. Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran: Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff. IEEE Trans. Information Theory 58(3): 1837-1852 (2012).

7. Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran: Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions. IEEE Trans. Information Theory 58(4): 2134-2158 (2012).

8. Swaprava Nath, Venkatesan N. Ekambaram, Anurag Kumar, P. Vijay Kumar: Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks. TOSN 8(4): 35 (2012).

9. Korlakai Vinayak Rashmi, Nihar B. Shah, P. Vijay Kumar: Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction. IEEE Trans. Information Theory 57(8): 5227-5239 (2011).

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

11. S. Ijeri, U. Raviteja, B. Vanamali and P. V. Kumar, “Algebriac approaches to Space-Time Code Construction for Multiple-Antenna Communication,” to appear in the Journal of the Indian Institute of Science, special issue on Algebra, Vol.91, No.1, 2011.

12. K. Vinodh, N. Prakash, V. Lalitha, P. Vijay Kumar: DMT of Wireless Networks: An Overview (Invited Paper). JCM 5(4): 265-281 (2010).

13. 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. 347-380, July-September 2010 (invited).

14. K. V. Rashmi, Nihar B. Shah and P. Vijay Kumar, “Network Coding,” Resonance, vol. 15, no. 7, pp. 604-621, Jul. 2010.

2005 - 2009

1. Vummintala Shashidhar, B. Sundar Rajan, P. Vijay Kumar: Asymptotic-Information-Lossless Designs and the Diversity-Multiplexing Tradeoff. IEEE Trans. Information Theory 55(1): 255-268 (2009).

2. Sameer A. Pawar, K. Raj Kumar, Petros Elia, P. Vijay Kumar, B. A. Sethuraman: Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel. IEEE Trans. Information Theory 55(7): 3101-3114 (2009).

3. 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 Trans. Information Theory 55(7): 3161-3185 (2009).

4. M. Anand and P. Vijay Kumar,“Low Correlation Sequences over a QAM Constellation,” IEEE Trans. Inform. Theory, vol.54, No. 2, Feb 2008, pp. 791-810.

5. Petros Elia, Frederique E. Oggier, P. Vijay Kumar: Asymptotically optimal cooperative wireless networks with reduced signaling complexity. IEEE Journal on Selected Areas in Communications 25(2): 258-267 (2007).

6. Oscar Moreno, Reza Omrani, P. Vijay Kumar, H.-f. Lu: A Generalized Bose-Chowla Family of Optical Orthogonal Codes and Distinct Difference Sets. IEEE Trans. Information Theory 53(5): 1907-1910 (2007).

7. Petros Elia, B. A. Sethuraman, P. Vijay Kumar: Perfect Space-Time Codes for Any Number of Antennas. IEEE Trans. Information Theory 53(11): 3853-3868 (2007).

8. Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu: Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff. IEEE Trans. Information Theory 52(9): 3869-3884 (2006).

9. Hsiao-feng Lu, P. Vijay Kumar: A unified construction of space-time codes with optimal rate-diversity tradeoff. IEEE Trans. Information Theory 51(5): 1709-1730 (2005).

10. P. Saghari, R. Omrani, A. E. Willner, and P. V. Kumar, ”Analytical Interference model for 2-Dimensional (Time-Wavelength) Asynchronous O-CDMA Systems Using various Receiver Structure”, Journal of Lightwave Technology, vol. 23, pp. 3260-3269, Oct. 2005.

2000 - 2004

1. F. N. Castro, P. V. Kumar, O. Moreno and K. W. Shum, “Improvements on the Chevalley-Warning, Ax-Katz, Deligne, and Serre bound for singular and nonsingular varieties”, Proceedings of the London Mathematical Society, vol. 88, 2004, pp. 545-564.

2. Hsiao-feng Lu, P. Vijay Kumar, Habong Chung: On orthogonal designs and space-time codes. IEEE Communications Letters 8(4): 220-222 (2004).

3. Hsiao-feng Lu, P. Vijay Kumar, En-Hui Yang: On the input-output weight enumerators of product accumulate codes. IEEE Communications Letters 8(8): 520-522 (2004).

4. Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth: An Assmus-Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z4. Des. Codes Cryptography 31(1): 75-92 (2004)

5. Chaoping Xing, P. Vijay Kumar, Cunsheng Ding: Low-correlation, large linear span sequences from function fields. IEEE Trans. Information Theory 49(6): 1439-1446 (2003).

6. Hsiao-feng Lu, P. Vijay Kumar: Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions for PSK modulation. IEEE Trans. Information Theory 49(10): 2747-2751 (2003)

7. Hsiao-feng Lu, Yuankai Wang, P. Vijay Kumar, Keith M. Chugg: Remarks on space-time codes including a new lower bound and an improved code. IEEE Trans. Information Theory 49(10): 2752-2757 (2003).

8. Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth: 3-Designs from the Z4-Goethals Codes via a New Kloosterman Sum Identity. Des. Codes Cryptography 28(3): 247-263 (2003).

9. Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth: 5-Designs from the lifted Golay code over Z4 via an Assmus-Mattson type approach. Discrete Mathematics 241(1-3): 479-487 (2001).

10. Hans Dobbertin, Tor Helleseth, P. Vijay Kumar, Halvard Martinsen: Ternary m-sequences with three-valued cross-correlation function: New decimations of Welch and Niho type. IEEE Trans. Information Theory 47(4): 1473-1481 (2001).

11. Ilia Aleshnikov, P. Vijay Kumar, Kenneth W. Shum, Henning Stichtenoth: On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound. IEEE Trans. Information Theory 47(4): 1613-1619 (2001).

12. Kenneth W. Shum, Ilia Aleshnikov, P. Vijay Kumar, Henning Stichtenoth, Vinay Deolalikar: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Trans. Information Theory 47(6): 2225-2241 (2001)

13. K. T. Arasu, Cunsheng Ding, Tor Helleseth, P. Vijay Kumar, Halvard Martinsen: Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Information Theory 47(7): 2934-2943 (2001)

14. Tor Helleseth, P. Vijay Kumar, Halvard Martinsen: A New Family of Ternary Sequences with Ideal Two-level Autocorrelation Function. Des. Codes Cryptography 23(2): 157-166 (2001)

15. Anchung Chang, Peter Gaal, Solomon W. Golomb, Guang Gong, Tor Helleseth, P. Vijay Kumar: On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code. IEEE Trans. Information Theory 46(2): 680-687 (2000).

16. Kyeongcheol Yang, Young-Ky Kim, P. Vijay Kumar: Quasi-orthogonal sequences for code-division multiple-access systems. IEEE Trans. Information Theory 46(3): 982-993 (2000).

1995 - 1999

1. Tor Helleseth, P. Vijay Kumar, Kyeongcheol Yang: An Infinite Family of 3-Designs from Preparata Codes over Z. Des. Codes Cryptography 15(2): 175-181 (1998).

2. 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. 218-238, 1998

3. 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. 353-362, 1997.

4. Tor Helleseth, P. Vijay Kumar: On the weight hierarchy of the semiprimitive codes. Discrete Mathematics 152(1-3): 185-190 (1996)

5. A. Robert Calderbank, Gary McGuire, P. Vijay Kumar, Tor Helleseth: Cyclic codes over Z4, locator polynomials, and Newton's identities. IEEE Trans. Information Theory 42(1): 217-226 (1996)

6. Abhijit G. Shanbhag, P. Vijay Kumar, Tor Helleseth: Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences. IEEE Trans. Information Theory 42(1): 250-254 (1996).

7. P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank, A. Roger Hammons Jr.: Large families of quaternary sequences with low correlation. IEEE Trans. Information Theory 42(2): 579-592 (1996)

8. P. Vijay Kumar: Review of “Algebraic Function Fields and Codes” (Stichtenoth, H.; 1993). IEEE Trans. Information Theory 42(2): 676 (1996).

9. Tor Helleseth, P. Vijay Kumar, Oscar Moreno, Abhijit G. Shanbhag: Improved estimates via exponential sums for the minimum distance of Z4-linear trace codes. IEEE Trans. Information Theory 42(4): 1212-1216 (1996).

10. Abhijit G. Shanbhag, P. Vijay Kumar, Tor Helleseth: Improved binary codes and sequence families from Z4-linear codes. IEEE Trans. Information Theory 42(5): 1582-1587 (1996).

11. Kyeongcheol Yang, Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag: On the weight hierarchy of Kerdock codes over Z4. IEEE Trans. Information Theory 42(5): 1587-1593 (1996).

12. Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag: Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes. Des. Codes Cryptography 9(3): 257-266 (1996)

13. Tor Helleseth, P. Vijay Kumar: The weight hierarchy of the Kasami codes. Discrete Mathematics 145(1-3): 133-143 (1995).

14. Oscar Moreno, Zhen Zhang, P. Vijay Kumar, Victor Zinoviev: New constructions of optimal cyclically permutable constant weight codes. IEEE Trans. Information Theory 41(2): 448-455 (1995).

15. P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank: An upper bound for Weft exponential sums over Galois tings and applications. IEEE Trans. Information Theory 41(2): 456-468 (1995).

16. Tor Helleseth, P. Vijay Kumar: The algebraic decoding of the Z4-linear Goethals code. IEEE Trans. Information Theory 41(6): 2040-2048 (1995)

17. O. Moreno, V. A. Zinoviev, and P.V. Kumar, “An Extension of the Weil-Carlitz-Uchiyama Bound,” Finite Fields and their Applications, vol.1, no.3, July 1995, pp 306-371.

18. 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. 448-455, March 1995.

1990 - 1994

1. A. Roger Hammons Jr., P. Vijay Kumar, A. Robert Calderbank, Neil J. A. Sloane, Patrick Sole: The Z4-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Information Theory 40(2): 301-319 (1994).

2. Serdar Boztas, P. Vijay Kumar: Binary sequences with Gold-like correlation but larger linear span. IEEE Trans. Information Theory 40(2): 532-537 (1994).

3. Kyeongcheol Yang, P. Vijay Kumar, Henning Stichtenoth: On the weight hierarchy of geometric Goppa codes. IEEE Trans. Information Theory 40(3): 913-920 (1994).

4. Oscar Moreno, P. Vijay Kumar: Minimum distance bounds for cyclic codes and Deligne's theorem. IEEE Trans. Information Theory 39(5): 1524-1534 (1993).

5. 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. 218-222, October 1993

6. A. R. Hammons, Jr., P. V. Kumar “On a Recent Four-Phase Sequence Design, ” (Invited Paper), Special Issue on Spread-Spectrum Techniques and Applications of the IEICE Trans. on Communications, vol. E 76-B, No. 8, pp. 804-813, August 1993.

7. Serdar Boztas, Roger Hammons, P. Vijay Kumar: 4-phase sequences with near-optimum correlation properties. IEEE Trans. Information Theory 38(3): 1101-1113 (1992).

8. Ara Patapoutian, P. Vijay Kumar: The (d, k) subdoce of a linear block code. IEEE Trans. Information Theory 38(4): 1375-1382 (1992).

9. P. Vijay Kumar, Victor K.-W. Wei: Minimum distance of logarithmic and fractional partial m-sequences. IEEE Trans. Information Theory 38(5): 1474-1482 (1992).

10. P. Vijay Kumar, Oscar Moreno: Prime-phase sequences with periodic correlation properties better than binary sequences. IEEE Trans. Information Theory 37(3): 603-616 (1991).

11. P. Vijay Kumar, Chao-Ming Liu: On lower bounds to the maximum correlation of complex roots-of-unity sequences. IEEE Trans. Information Theory 36(3): 633-640 (1990).

12. Habong Chung, P. Vijay Kumar:Optical orthogonal codes-New bounds and an optimal construction. IEEE Trans. Information Theory 36(4): 866-873 (1990).

1983 - 1989

1. Habong Chung, P. Vijay Kumar: A new general construction for generalized bent functions. IEEE Trans. Information Theory 35(1): 206-209 (1989)

2. Jong-Seon No, P. Vijay Kumar: A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span. IEEE Trans. Information Theory 35(2): 371-379 (1989).

3. P. Vijay Kumar: Frequency-hopping code sequence designs having large linear span. IEEE Trans. Information Theory 34(1): 146-151 (1988).

4. P. Vijay Kumar: On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function. IEEE Trans. Information Theory 34(2): 271-277 (1988).

5. P. Vijay Kumar, Robert A. Scholtz, Lloyd R. Welch: Generalized Bent Functions and Their Properties. J. Comb. Theory, Ser. A 40(1): 90-107 (1985).

6. P. Vijay Kumar: On bent sequences and generalized bent functions (Ph.D. thesis abstr.). IEEE Trans. Information Theory 30(2): 450- (1984).

7. P.V. Kumar and R.A. Scholtz, “Generalized GMW Sequences and an Application to Frequency Hopping,” Cryptologic Quarterly, vol. 3, nos. 1-2, pp. 1-5, Spring-Summer, 1984.

8. P. Vijay Kumar, Robert A. Scholtz: Bounds on the linear span of bent sequences. IEEE Trans. Information Theory 29(6): 854-862 (1983).