The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

P. Vijay Kumar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A. Roger Hammons Jr., P. Vijay Kumar, A. Robert Calderbank, Neil J. A. Sloane, Patrick Solé
    On the Apparent Duality of the Kerdock and Preparata Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1993, pp:13-24 [Conf]
  2. Reza Omrani, Petros Elia, P. Vijay Kumar
    New Constructions and Bounds for 2-D Optical Orthogonal Codes. [Citation Graph (0, 0)][DBLP]
    SETA, 2004, pp:389-395 [Conf]
  3. Reza Omrani, P. Vijay Kumar
    Codes for Optical CDMA. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:34-46 [Conf]
  4. Reza Omrani, Oscar Moreno, P. Vijay Kumar
    Topics on Optical Orthogonal Codes. [Citation Graph (0, 0)][DBLP]
    SETA, 2004, pp:396-405 [Conf]
  5. P. Vijay Kumar, Tor Helleseth
    An Expansion for the Coordinates of the Trace Function over Galois Rings. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:353-361 [Journal]
  6. Tor Helleseth, P. Vijay Kumar, Halvard Martinsen
    A New Family of Ternary Sequences with Ideal Two-level Autocorrelation Function. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:23, n:2, pp:157-166 [Journal]
  7. Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag
    Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:9, n:3, pp:257-266 [Journal]
  8. Tor Helleseth, P. Vijay Kumar, Kyeongcheol Yang
    An Infinite Family of 3-Designs from Preparata Codes over Z. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:15, n:2, pp:175-181 [Journal]
  9. Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth
    3-Designs from the Z4-Goethals Codes via a New Kloosterman Sum Identity. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:28, n:3, pp:247-263 [Journal]
  10. Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth
    An Assmus-Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z4. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:1, pp:75-92 [Journal]
  11. Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth
    5-Designs from the lifted Golay code over Z4 via an Assmus-Mattson type approach. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:479-487 [Journal]
  12. P. Vijay Kumar, Robert A. Scholtz, Lloyd R. Welch
    Generalized Bent Functions and Their Properties. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:1, pp:90-107 [Journal]
  13. K. T. Arasu, Cunsheng Ding, Tor Helleseth, P. Vijay Kumar, Halvard Martinsen
    Almost difference sets and their sequences with optimal autocorrelation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2934-2943 [Journal]
  14. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1613-1619 [Journal]
  15. Serdar Boztas, Roger Hammons, P. Vijay Kumar
    4-phase sequences with near-optimum correlation properties. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1101-1113 [Journal]
  16. Serdar Boztas, P. Vijay Kumar
    Binary sequences with Gold-like correlation but larger linear span. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:532-0 [Journal]
  17. A. Robert Calderbank, Gary McGuire, P. Vijay Kumar, Tor Helleseth
    Cyclic codes over Z4, locator polynomials, and Newton's identities. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:217-226 [Journal]
  18. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:680-687 [Journal]
  19. Habong Chung, P. Vijay Kumar
    A new general construction for generalized bent functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:1, pp:206-0 [Journal]
  20. Habong Chung, P. Vijay Kumar
    Optical orthogonal codes-New bounds and an optimal construction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:4, pp:866-0 [Journal]
  21. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1473-1481 [Journal]
  22. A. Roger Hammons Jr., P. Vijay Kumar, A. Robert Calderbank, Neil J. A. Sloane, Patrick Solé
    The Z4-linearity of Kerdock, Preparata, Goethals, and related codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:301-319 [Journal]
  23. Tor Helleseth, P. Vijay Kumar
    The algebraic decoding of the Z4-linear Goethals code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:2040-2048 [Journal]
  24. Tor Helleseth, P. Vijay Kumar, Oscar Moreno, Abhijit G. Shanbhag
    Improved estimates via exponential sums for the minimum distance of Z4-linear trace codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1212-1216 [Journal]
  25. P. Vijay Kumar
    On bent sequences and generalized bent functions (Ph.D. thesis abstr.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:450-0 [Journal]
  26. P. Vijay Kumar
    Frequency-hopping code sequence designs having large linear span. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:1, pp:146-0 [Journal]
  27. P. Vijay Kumar
    On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:271-277 [Journal]
  28. P. Vijay Kumar
    Review of 'Algebraic Function Fields and Codes' (Stichtenoth, H.; 1993). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:676- [Journal]
  29. P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank
    An upper bound for Weft exponential sums over Galois tings and applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:456-468 [Journal]
  30. P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank, A. Roger Hammons Jr.
    Large families of quaternary sequences with low correlation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:579-592 [Journal]
  31. P. Vijay Kumar, Chao-Ming Liu
    On lower bounds to the maximum correlation of complex roots-of-unity sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:633-0 [Journal]
  32. P. Vijay Kumar, Oscar Moreno
    Prime-phase sequences with periodic correlation properties better than binary sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:603-616 [Journal]
  33. P. Vijay Kumar, Robert A. Scholtz
    Bounds on the linear span of bent sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:854-862 [Journal]
  34. P. Vijay Kumar, Victor K.-W. Wei
    Minimum distance of logarithmic and fractional partial m-sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:5, pp:1474-1482 [Journal]
  35. Hsiao-feng Lu, P. Vijay Kumar
    Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions for PSK modulation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:10, pp:2747-2751 [Journal]
  36. Hsiao-feng Lu, P. Vijay Kumar
    A unified construction of space-time codes with optimal rate-diversity tradeoff. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:5, pp:1709-1730 [Journal]
  37. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:10, pp:2752-2757 [Journal]
  38. Oscar Moreno, P. Vijay Kumar
    Minimum distance bounds for cyclic codes and Deligne's theorem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1524-1534 [Journal]
  39. Oscar Moreno, Zhen Zhang, P. Vijay Kumar, Victor Zinoviev
    New constructions of optimal cyclically permutable constant weight codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:448-455 [Journal]
  40. Jong-Seon No, P. Vijay Kumar
    A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:2, pp:371-379 [Journal]
  41. Ara Patapoutian, P. Vijay Kumar
    The (d, k) subdoce of a linear block code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1375-0 [Journal]
  42. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:250-254 [Journal]
  43. Abhijit G. Shanbhag, P. Vijay Kumar, Tor Helleseth
    Improved binary codes and sequence families from Z4-linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1582-1587 [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2225-2241 [Journal]
  45. Chaoping Xing, P. Vijay Kumar, Cunsheng Ding
    Low-correlation, large linear span sequences from function fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:6, pp:1439-1446 [Journal]
  46. Kyeongcheol Yang, Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag
    On the weight hierarchy of Kerdock codes over Z4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1587-1593 [Journal]
  47. Kyeongcheol Yang, Young-Ky Kim, P. Vijay Kumar
    Quasi-orthogonal sequences for code-division multiple-access systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:982-993 [Journal]
  48. Kyeongcheol Yang, P. Vijay Kumar, Henning Stichtenoth
    On the weight hierarchy of geometric Goppa codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:913-0 [Journal]
  49. Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu
    Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:9, pp:3869-3884 [Journal]
  50. Oscar Moreno, Reza Omrani, P. Vijay Kumar, H.-F. Lu
    A Generalized Bose-Chowla Family of Optical Orthogonal Codes and Distinct Difference Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:5, pp:1907-1910 [Journal]
  51. P. Vijay Kumar, Reza Omrani, Joe Touch, Alan E. Willner, Poorya Saghari
    A Novel Optical CDMA Modulation Scheme: Code Cycle Modulation. [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]
  52. Petros Elia, P. Vijay Kumar
    Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  53. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  54. M. Anand, P. Vijay Kumar
    Low Correlation Sequences over QAM and AM-PSK Constellations [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  55. Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu
    Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  56. Tor Helleseth, P. Vijay Kumar
    The weight hierarchy of the Kasami codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:145, n:1-3, pp:133-143 [Journal]
  57. Tor Helleseth, P. Vijay Kumar
    On the weight hierarchy of the semiprimitive codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:185-190 [Journal]

  58. On the Average Case Communication Complexity for Detection in Sensor Networks. [Citation Graph (, )][DBLP]


  59. Two New Families of Low-Correlation Interleaved QAM Sequences. [Citation Graph (, )][DBLP]


  60. Regenerating Codes for Distributed Storage Networks. [Citation Graph (, )][DBLP]


  61. Sequences for Phase-Encoded Optical CDMA. [Citation Graph (, )][DBLP]


  62. Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas [Citation Graph (, )][DBLP]


  63. Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks [Citation Graph (, )][DBLP]


  64. Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design [Citation Graph (, )][DBLP]


  65. Diversity and Degrees of Freedom of Cooperative Wireless Networks [Citation Graph (, )][DBLP]


  66. Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks [Citation Graph (, )][DBLP]


  67. DMT of Multi-hop Cooperative Networks - Part I: Basic Results [Citation Graph (, )][DBLP]


  68. DMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks with Full-Duplex Performance [Citation Graph (, )][DBLP]


  69. Exact Regenerating Codes for Distributed Storage [Citation Graph (, )][DBLP]


  70. Explicit Codes Minimizing Repair Bandwidth for Distributed Storage [Citation Graph (, )][DBLP]


  71. Large Families of Optimal Two-Dimensional Optical Orthogonal Codes [Citation Graph (, )][DBLP]


  72. The MISER Code: An MDS Distributed Storage Code that Minimizes Repair Bandwidth for Systematic Nodes through Interference Alignment [Citation Graph (, )][DBLP]


  73. Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction [Citation Graph (, )][DBLP]


Search in 0.139secs, Finished in 0.142secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002