default search action
P. Vijay Kumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j84]S. R. Malathi, P. Vijay Kumar:
MULTI-head self-attention-based recurrent neural network with dwarf mongoose optimization algorithm-espoused QRS detector design. Signal Image Video Process. 18(5): 4935-4944 (2024) - [j83]P. Vijay Kumar
, Dileep Dharmappa, Sugandh Mishra:
Interleaved Z4-Linear Sequences With Low Correlation for Global Navigation Satellite Systems. IEEE Trans. Inf. Theory 70(3): 2224-2253 (2024) - [j82]Myna Vajha
Explicit Rate-Optimal Streaming Codes With Smaller Field Size. IEEE Trans. Inf. Theory 70(5): 3242-3261 (2024) - [c99]Srivathsa Acharya, P. Vijay Kumar, Viveck R. Cadambe:
On Existence of Latency Optimal Uncoded Storage Schemes in Geo-Distributed Data Storage Systems. ISIT 2024: 1462-1467 - [c98]Shobhit Bhatnagar, P. Vijay Kumar:
On Streaming Codes for Burst and Random Errors. ISIT 2024: 1782-1787 - [c97]Shobhit Bhatnagar, Biswadip Chakraborty, P. Vijay Kumar:
On Streaming Codes for Simultaneously Correcting Burst and Random Erasures. ISIT 2024: 1991-1996 - [c96]Vinayak Ramkumar, Shobhit Bhatnagar, P. Vijay Kumar:
On Multi-Path Streaming Codes. NCC 2024: 1-6 - [i67]Shobhit Bhatnagar, P. Vijay Kumar:
On Streaming Codes for Burst and Random Errors. CoRR abs/2405.06606 (2024) - [i66]Shobhit Bhatnagar, Biswadip Chakraborty, P. Vijay Kumar:
On Streaming Codes for Simultaneously Correcting Burst and Random Erasures. CoRR abs/2405.06621 (2024) - [i65]Srivathsa Acharya, P. Vijay Kumar, Viveck R. Cadambe:
On Existence of Latency Optimal Uncoded Storage Schemes in Geo-Distributed Data Storage Systems. CoRR abs/2405.06641 (2024) - 2023
- [j81]S. R. Malathi
A High-Performance Low Complex Design and Implementation of QRS Detector Using Modified MaMeMi Filter Optimized with Mayfly Optimization Algorithm. J. Circuits Syst. Comput. 32(4): 2350056:1-2350056:25 (2023) - [j80]Myna Vajha
Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size. IEEE Trans. Inf. Theory 69(7): 4303-4332 (2023) - [c95]M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar:
Explicit Information-Debt-Optimal Streaming Codes With Small Memory. ISIT 2023: 1112-1117 - [c94]Vinayak Ramkumar, Shobhit Bhatnagar, P. Vijay Kumar:
Near-Optimal Streaming Codes with Linear Field Size. ISIT 2023: 1118-1123 - [i64]M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar:
Explicit Information-Debt-Optimal Streaming Codes With Small Memory. CoRR abs/2305.06303 (2023) - 2022
- [j79]Vinayak Ramkumar, Balaji Srinivasan Babu, Birenjith Sasidharan, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar:
Codes for Distributed Storage. Found. Trends Commun. Inf. Theory 19(4): 547-813 (2022) - [j78]Balaji Srinivasan Babu, Myna Vajha
Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound. IEEE Trans. Inf. Theory 68(10): 6452-6471 (2022) - [c93]Vinayak Ramkumar, M. Nikhil Krishnan, Myna Vajha, P. Vijay Kumar:
On Information-Debt-Optimal Streaming Codes With Small Memory. ISIT 2022: 1578-1583 - [c92]Shubhransh Singhvi, Gayathri R., P. Vijay Kumar:
Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network. ISIT 2022: 1957-1962 - [c91]Shobhit Bhatnagar, Vinayak Ramkumar, P. Vijay Kumar:
Rate-Optimal Streaming Codes with Smaller Field Size Under Less-Stringent Decoding-Delay Requirements. ITW 2022: 612-617 - [c90]Harsha Sharma, Parth Thakkar, Sagar Bharadwaj, Ranjita Bhagwan, Venkata N. Padmanabhan, Yogesh Bansal, P. Vijay Kumar, Kathleen Voelbel:
Optimizing Network Provisioning through Cooperation. NSDI 2022: 1179-1194 - [i63]Shubhransh Singhvi, Gayathri R., P. Vijay Kumar:
Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network. CoRR abs/2207.04025 (2022) - 2021
- [c89]Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan
Explicit Rate-Optimal Streaming Codes with Smaller Field Size. ISIT 2021: 736-741 - [c88]Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Generalized Simple Streaming Codes from MDS Codes. ISIT 2021: 878-883 - [c87]P. Vijay Kumar, Dileep Dharmappa, Sugandh Mishra:
Interleaved $Z_{4}$-Linear Sequences with Improved Correlation for Satellite Navigation. ISIT 2021: 1665-1670 - [c86]Shobhit Bhatnagar, Biswadip Chakraborti, P. Vijay Kumar:
Streaming Codes for Handling a Combination of Burst and Random Erasures. ITW 2021: 1-6 - [c85]Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Locally Recoverable Streaming Codes for Packet-Erasure Recovery. ITW 2021: 1-6 - [c84]Myna Vajha, Vinayak Ramkumar, Mayank Jhamtani, P. Vijay Kumar:
On the Performance Analysis of Streaming Codes over the Gilbert-Elliott Channel. ITW 2021: 1-6 - [i62]Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Generalized Simple Streaming Codes from MDS Codes. CoRR abs/2104.07005 (2021) - [i61]Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan, P. Vijay Kumar:
Explicit Rate-Optimal Streaming Codes with Smaller Field Size. CoRR abs/2105.04432 (2021) - [i60]Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Locally Recoverable Streaming Codes for Packet-Erasure Recovery. CoRR abs/2109.03168 (2021) - 2020
- [j77]M. Nikhil Krishnan
Simple Streaming Codes for Reliable, Low-Latency Communication. IEEE Commun. Lett. 24(2): 249-253 (2020) - [j76]Balaji Srinivasan Babu, Ganesh R. Kini
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures. IEEE Trans. Inf. Theory 66(2): 1023-1052 (2020) - [j75]M. Nikhil Krishnan
Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures. IEEE Trans. Inf. Theory 66(8): 4869-4891 (2020) - [c83]Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes. ISIT 2020: 503-508 - [i59]Myna Vajha, Vinayak Ramkumar, Mayank Jhamtani, P. Vijay Kumar:
On Sliding Window Approximation of Gilbert-Elliott Channel for Delay Constrained Setting. CoRR abs/2005.06921 (2020) - [i58]Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar:
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes. CoRR abs/2005.07113 (2020) - [i57]Vinayak Ramkumar, Myna Vajha, S. B. Balaji, M. Nikhil Krishnan, Birenjith Sasidharan, P. Vijay Kumar:
Codes for Distributed Storage. CoRR abs/2010.01344 (2020)
2010 – 2019
- 2019
- [j74]N. Prakash
Codes With Locality for Two Erasures. IEEE Trans. Inf. Theory 65(12): 7771-7789 (2019) - [c82]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: 31-35 - [c81]M. Nikhil Krishnan
A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures. ISIT 2019: 852-856 - [c80]Vinayak Ramkumar, P. Vijay Kumar:
Coded MapReduce Schemes Based on Placement Delivery Array. ISIT 2019: 3087-3091 - [i56]M. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar:
Low Field-size, Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures. CoRR abs/1903.06210 (2019) - 2018
- [j73]Balaji Srinivasan Babu, M. Nikhil Krishnan
Erasure coding for distributed storage: an overview. Sci. China Inf. Sci. 61(10): 100301:1-100301:45 (2018) - [j72]M. Nikhil Krishnan
Exploiting Locality for Improved Decoding of Binary Cyclic Codes. IEEE Trans. Commun. 66(6): 2346-2358 (2018) - [j71]K. V. Rashmi
Information-Theoretically Secure Erasure Codes for Distributed Storage. IEEE Trans. Inf. Theory 64(3): 1621-1646 (2018) - [j70]Guang Gong
Solomon W. Golomb - Mathematician, Engineer, and Pioneer. IEEE Trans. Inf. Theory 64(4): 2844-2857 (2018) - [c79]Myna Vajha, Vinayak Ramkumar, Bhagyashree Puranik, Ganesh R. Kini, Elita A. Lobo, Birenjith Sasidharan, P. Vijay Kumar, Alexander Barg, Min Ye, Srinivasan Narayanamurthy, Syed Hussain, Siddhartha Nandi:
Clay Codes: Moulding MDS Codes to Yield an MSR Code. FAST 2018: 139-154 - [c78]M. Nikhil Krishnan
Codes with Combined Locality and Regeneration Having Optimal Rate, $d_{\min}$ and Linear Field Size. ISIT 2018: 1196-1200 - [c77]M. Nikhil Krishnan
Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures. ISIT 2018: 1809-1813 - [c76]Myna Vajha, Balaji Srinivasan Babu, P. Vijay Kumar:
Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d=k+1, k+2, k+3$. ISIT 2018: 2376-2380 - [c75]Balaji Srinivasan Babu, P. Vijay Kumar:
A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes. ISIT 2018: 2381-2385 - [i55]M. Nikhil Krishnan, P. Vijay Kumar:
Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures. CoRR abs/1801.05919 (2018) - [i54]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length. CoRR abs/1801.06794 (2018) - [i53]M. Nikhil Krishnan, Anantha Narayanan R., P. Vijay Kumar:
Codes with Combined Locality and Regeneration Having Optimal Rate, dmin and Linear Field Size. CoRR abs/1804.00564 (2018) - [i52]Myna Vajha, Balaji Srinivasan Babu, P. Vijay Kumar:
Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for d = k+1, k+2, k+3. CoRR abs/1804.00598 (2018) - [i51]Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code. CoRR abs/1806.02028 (2018) - [i50]Balaji Srinivasan Babu, M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, P. Vijay Kumar:
Erasure Coding for Distributed Storage: An Overview. CoRR abs/1806.04437 (2018) - [i49]Balaji Srinivasan Babu, P. Vijay Kumar:
Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions. CoRR abs/1806.04474 (2018) - [i48]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures. CoRR abs/1812.02502 (2018) - 2017
- [c74]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: 371-379 - [c73]M. Nikhil Krishnan
A study on the impact of locality in the decoding of binary cyclic codes. ISIT 2017: 176-180 - [c72]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures. ISIT 2017: 1778-1782 - [c71]Birenjith Sasidharan
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: 2048-2052 - [c70]Balaji Srinivasan Babu, P. Vijay Kumar:
Bounds on the rate and minimum distance of codes with availability. ISIT 2017: 3155-3159 - [c69]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: 44-52 - [i47]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). CoRR abs/1701.07447 (2017) - [i46]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes. CoRR abs/1702.03786 (2017) - [i45]Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar:
Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval. CoRR abs/1702.05074 (2017) - [i44]Balaji Srinivasan Babu, P. Vijay Kumar:
A Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes. CoRR abs/1710.05876 (2017) - 2016
- [j69]Birenjith Sasidharan, N. Prakash, M. Nikhil Krishnan, Myna Vajha, Kaushik Senthoor, P. Vijay Kumar:
Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes. Int. J. Inf. Coding Theory 3(4): 255-298 (2016) - [c68]Muralee Nikhil Krishnan
On MBR codes with replication. ISIT 2016: 71-75 - [c67]Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar:
Binary codes with locality for multiple erasures having short block length. ISIT 2016: 655-659 - [c66]Tarun Choubisa, Raviteja Upadrashta, Sumankumar D. Panchal, A. Praneeth, H. V. Ranjitha, Kaushik Senthoor, Abhijit Bhattacharya, S. V. R. Anand, Malati Hegde, Anurag Kumar
Challenges in Developing and Deploying a PIR Sensor-Based Intrusion Classification System for an Outdoor Environment. LCN Workshops 2016: 148-155 - [i43]Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar:
Binary Codes with Locality for Multiple Erasures Having Short Block Length. CoRR abs/1601.07122 (2016) - [i42]M. Nikhil Krishnan, P. Vijay Kumar:
On MBR codes with replication. CoRR abs/1601.08190 (2016) - [i41]Raviteja Upadrashta, Tarun Choubisa, A. Praneeth, Tony Gracious, V. S. Aswath, P. Vijay Kumar, Sripad S. Kowshik, Hari Prasad Gokul R, Tamma V. Prabhakar:
Animation and Chirplet-Based Development of a PIR Sensor Array for Intruder Classification in an Outdoor Environment. CoRR abs/1604.03829 (2016) - [i40]Birenjith Sasidharan, N. Prakash, M. Nikhil Krishnan, Myna Vajha, Kaushik Senthoor, P. Vijay Kumar:
Outer Bounds on the Storage-Repair Bandwidth Tradeoff of Exact-Repair Regenerating Codes. CoRR abs/1606.04467 (2016) - [i39]Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar:
Binary Codes with Locality for Four Erasures. CoRR abs/1607.02817 (2016) - [i38]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 All-Node Repair. CoRR abs/1607.07335 (2016) - [i37]Balaji Srinivasan Babu, P. Vijay Kumar:
Bounds on Codes with Locality and Availability. CoRR abs/1611.00159 (2016) - [i36]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A Bound on Rate of Codes with Locality with Sequential Recovery from Multiple Erasures. CoRR abs/1611.08561 (2016) - 2015
- [j68]Chao Tian, Birenjith Sasidharan
Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs. IEEE Trans. Inf. Theory 61(4): 1933-1947 (2015) - [c65]Birenjith Sasidharan
Codes with hierarchical locality. ISIT 2015: 1257-1261 - [c64]Balaji Srinivasan Babu, P. Vijay Kumar:
On partial maximally-recoverable and maximally-recoverable codes. ISIT 2015: 1881-1885 - [c63]Birenjith Sasidharan
A high-rate MSR code with polynomial sub-packetization level. ISIT 2015: 2051-2055 - [c62]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 - [c61]Kaushik Senthoor, Birenjith Sasidharan
Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets. ITW 2015: 1-5 - [c60]Gaurav Kumar Agarwal, Birenjith Sasidharan
An alternate construction of an access-optimal regenerating code with optimal sub-packetization level. NCC 2015: 1-6 - [i35]Gaurav Kumar Agarwal, Birenjith Sasidharan, P. Vijay Kumar:
An Alternate Construction of an Access-Optimal Regenerating Code with Optimal Sub-Packetization Level. CoRR abs/1501.04760 (2015) - [i34]Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar:
A High-Rate MSR Code With Polynomial Sub-Packetization Level. CoRR abs/1501.06662 (2015) - [i33]Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar:
Codes With Hierarchical Locality. CoRR abs/1501.06683 (2015) - [i32]Balaji Srinivasan Babu, P. Vijay Kumar:
On Partial Maximally-Recoverable and Maximally-Recoverable Codes. CoRR abs/1501.07130 (2015) - [i31]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran, P. Vijay Kumar:
Information-theoretically Secure Erasure Codes for Distributed Storage. CoRR abs/1508.03787 (2015) - 2014
- [j67]Govinda M. Kamath, N. Prakash
Codes With Local Regeneration and Erasure Correction. IEEE Trans. Inf. Theory 60(8): 4637-4660 (2014) - [c59]Kevin C. Almeroth, P. Vijay Kumar, Venkat N. Padmanabhan:
Message from general chairs. COMSNETS 2014: 1-2 - [c58]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 - [c57]Birenjith Sasidharan
Optimality of the product-matrix construction for secure MSR regenerating codes. ISCCSP 2014: 10-14 - [c56]N. Prakash
Codes with locality for two erasures. ISIT 2014: 1962-1966 - [c55]Birenjith Padmakumari Sasidharan
An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codes. ISIT 2014: 2430-2434 - [i30]N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with Locality for Two Erasures. CoRR abs/1401.2422 (2014) - [i29]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. CoRR abs/1406.6783 (2014) - [i28]Chao Tian, Birenjith Sasidharan, Vaneet Aggarwal, Vinay A. Vaishampayan, P. Vijay Kumar:
Layered, Exact-Repair Regenerating Codes Via Embedded Error Correction and Block Designs. CoRR abs/1408.0377 (2014) - 2013
- [j66]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
Linear Coding Schemes for the Distributed Computation of Subspaces. IEEE J. Sel. Areas Commun. 31(4): 678-690 (2013) - [j65]K. Sreeram, Birenjith Sasidharan
DMT of Parallel-Path and Layered Networks Under the Half-Duplex Constraint. IEEE Trans. Inf. Theory 59(6): 3875-3891 (2013) - [c54]Birenjith Sasidharan, P. Vijay Kumar:
On the interior points of the storage-repair bandwidth tradeoff of regenerating codes. Allerton 2013: 788-795 - [c53]Govinda M. Kamath, Natalia Silberstein, N. Prakash
Explicit MBR all-symbol locality codes. ISIT 2013: 504-508 - [c52]Govinda M. Kamath, N. Prakash
Codes with local regeneration. ISIT 2013: 1606-1610 - [c51]Birenjith Sasidharan
High-rate regenerating codes through layering. ISIT 2013: 1611-1615 - [c50]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with local regeneration. ITA 2013: 1-5 - [i27]Birenjith Sasidharan, P. Vijay Kumar:
High-Rate Regenerating Codes Through Layering. CoRR abs/1301.6157 (2013) - [i26]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar, Natalia Silberstein, Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath:
Explicit MBR All-Symbol Locality Codes. CoRR abs/1302.0744 (2013) - [i25]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
Linear Coding Schemes for the Distributed Computation of Subspaces. CoRR abs/1302.5021 (2013) - [i24]Birenjith Sasidharan, Kaushik Senthoor, P. Vijay Kumar:
An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes. CoRR abs/1312.6079 (2013) - 2012
- [j64]K. Sreeram, Birenjith Sasidharan
DMT of Multihop Networks: End Points and Computational Tools. IEEE Trans. Inf. Theory 58(2): 804-819 (2012) - [j63]Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia
Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes. IEEE Trans. Inf. Theory 58(2): 1163-1185 (2012) - [j62]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. Inf. Theory 58(3): 1837-1852 (2012) - [j61]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. Inf. Theory 58(4): 2134-2158 (2012) - [j60]Swaprava Nath
Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks. ACM Trans. Sens. Networks 8(4): 35:1-35:38 (2012) - [c49]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar:
Regenerating codes for errors and erasures in distributed storage. ISIT 2012: 1202-1206 - [c48]N. Prakash
Optimal linear codes with a local-error-correction property. ISIT 2012: 2776-2780 - [i23]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar:
Regenerating Codes for Errors and Erasures in Distributed Storage. CoRR abs/1202.1050 (2012) - [i22]N. Prakash, Govinda M. Kamath, V. Lalitha, P. Vijay Kumar:
Optimal Linear Codes with a Local-Error-Correction Property. CoRR abs/1202.2414 (2012) - [i21]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with Local Regeneration. CoRR abs/1211.1932 (2012) - 2011
- [j59]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) - [j58]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. Inf. Theory 57(8): 5227-5239 (2011) - [c47]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 - [c46]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
Information-Theoretically Secure Regenerating Codes for Distributed Storage. GLOBECOM 2011: 1-5 - [c45]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar:
Enabling node repair in any erasure code for distributed storage. ISIT 2011: 1235-1239 - [i20]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar:
Enabling Node Repair in Any Erasure Code for Distributed Storage. CoRR abs/1101.0133 (2011) - [i19]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
Information-theoretically Secure Regenerating Codes for Distributed Storage. CoRR abs/1107.5279 (2011) - 2010
- [j57]K. Vinodh, N. Prakash, V. Lalitha, P. Vijay Kumar
DMT of Wireless Networks: An Overview (Invited Paper). J. Commun. 5(4): 265-281 (2010) - [c44]K. Vinodh, V. Lalitha, N. Prakash
On the achievable rates of sources having a group alphabet in a distributed source coding setting. Allerton 2010: 479-486 - [c43]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 - [c42]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
A flexible class of regenerating codes for distributed storage. ISIT 2010: 1943-1947 - [c41]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran:
Explicit and optimal codes for distributed storage. ITA 2010: 240-244 - [c40]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Regenerating Codes for Distributed Storage Networks. WAIFI 2010: 215-223 - [i18]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
The MISER Code: An MDS Distributed Storage Code that Minimizes Repair Bandwidth for Systematic Nodes through Interference Alignment. CoRR abs/1005.1634 (2010) - [i17]K. V. 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. CoRR abs/1005.4178 (2010) - [i16]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff. CoRR abs/1011.2361 (2010)
2000 – 2009
- 2009
- [j56]Vummintala Shashidhar, B. Sundar Rajan, P. Vijay Kumar:
Asymptotic-Information-Lossless Designs and the Diversity-Multiplexing Tradeoff. IEEE Trans. Inf. Theory 55(1): 255-268 (2009) - [j55]Sameer A. Pawar, K. Raj Kumar, Petros Elia
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel. IEEE Trans. Inf. Theory 55(7): 3101-3114 (2009) - [j54]Petros Elia
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols. IEEE Trans. Inf. Theory 55(7): 3161-3185 (2009) - [c39]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar
Explicit construction of optimal exact regenerating codes for distributed storage. Allerton 2009: 1243-1249 - [c38]Petros Elia
Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels. ISIT 2009: 2813-2817 - [c37]Avik Ray, Ghaya Rekaya-Ben Othman, P. Vijay Kumar, K. Vinodh:
Ideal structure of the Silver code. ISIT 2009: 2818-2822 - [i15]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran:
Exact Regenerating Codes for Distributed Storage. CoRR abs/0906.4913 (2009) - [i14]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Explicit Codes Minimizing Repair Bandwidth for Distributed Storage. CoRR abs/0908.2984 (2009) - [i13]Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia, Pankaj Bhambhani:
Large Families of Optimal Two-Dimensional Optical Orthogonal Codes. CoRR abs/0911.0143 (2009) - 2008
- [j53]M. Anand, P. Vijay Kumar:
Low-Correlation Sequences Over the QAM Constellation. IEEE Trans. Inf. Theory 54(2): 791-810 (2008) - [c36]R. N. Krishnakumar, Naveen Naveen, K. Sreeram, P. Vijay Kumar:
Diversity multiplexing tradeoff of asynchronous cooperative relay networks. Allerton 2008: 103-110 - [c35]N. E. Venkatesan, Tarun Agarwal, P. Vijay Kumar:
On the Average Case Communication Complexity for Detection in Sensor Networks. DCOSS 2008: 176-189 - [c34]K. Sreeram, Birenjith Sasidharan
Diversity and degrees of freedom of cooperative wireless networks. ISIT 2008: 1253-1257 - [c33]Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan:
Low correlation interleaved QAM sequences. ISIT 2008: 1935-1939 - [c32]K. Sreeram, Birenjith Sasidharan
DMT of multi-hop cooperative networks-Part I: K-Parallel-Path networks. ISIT 2008: 2076-2080 - [c31]K. Sreeram, Birenjith Sasidharan
DMT of multi-hop cooperative networks-Part II: Layered and multi-antenna networks. ISIT 2008: 2081-2085 - [c30]Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan:
Two New Families of Low-Correlation Interleaved QAM Sequences. SETA 2008: 130-141 - [i12]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design. CoRR abs/0802.1888 (2008) - [i11]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
Diversity and Degrees of Freedom of Cooperative Wireless Networks. CoRR abs/0802.1893 (2008) - [i10]R. N. Krishnakumar, Naveen Naveen, P. Vijay Kumar:
Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks. CoRR abs/0807.0204 (2008) - [i9]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of Multi-hop Cooperative Networks - Part I: Basic Results. CoRR abs/0808.0234 (2008) - [i8]K. Sreeram, Birenjith Sasidharan, P. Vijay Kumar:
DMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks with Full-Duplex Performance. CoRR abs/0808.0235 (2008) - 2007
- [j52]Petros Elia
Asymptotically optimal cooperative wireless networks with reduced signaling complexity. IEEE J. Sel. Areas Commun. 25(2): 258-267 (2007) - [j51]Oscar Moreno, Reza Omrani, P. Vijay Kumar, Hsiao-feng Lu:
A Generalized Bose-Chowla Family of Optical Orthogonal Codes and Distinct Difference Sets. IEEE Trans. Inf. Theory 53(5): 1907-1910 (2007) - [j50]Petros Elia
Perfect Space-Time Codes for Any Number of Antennas. IEEE Trans. Inf. Theory 53(11): 3853-3868 (2007) - [c29]Petros Elia
D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols. ISIT 2007: 681-685 - [c28]M. Anand, P. Vijay Kumar:
Low Correlation Sequences over AM-PSK and QAM Alphabets. ISIT 2007: 2521-2525 - [c27]Reza Omrani, Pankaj Bhambhani, P. Vijay Kumar:
Sequences for Phase-Encoded Optical CDMA. SSC 2007: 95-105 - [e2]Tor Helleseth, P. Vijay Kumar, Øyvind Ytrehus:
Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, July 1-6, 2007, Solstrand, Norway. IEEE 2007, ISBN 1-4244-1199-8 [contents] - [i7]Petros Elia, P. Vijay Kumar:
Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels. CoRR abs/0706.3502 (2007) - 2006
- [j49]Petros Elia
Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff. IEEE Trans. Inf. Theory 52(9): 3869-3884 (2006) - [c26]P. Vijay Kumar
A Novel Optical CDMA Modulation Scheme: Code Cycle Modulation. GLOBECOM 2006 - [c25]Oscar Moreno, Reza Omrani, P. Vijay Kumar, Solomon W. Golomb:
OOCs, Partial Relative Difference Families and a Conjecture of Golomb. ISIT 2006: 2632-2636 - [c24]Reza Omrani, P. Vijay Kumar:
Spreading Sequences for Asynchronous Spectrally Phase Encoded Optical CDMA. ISIT 2006: 2642-2646 - [c23]Petros Elia
Constructions of Cooperative Diversity Schemes for Asynchronous Wireless Networks. ISIT 2006: 2724-2728 - [c22]Petros Elia
Asymptotically Optimal Cooperative Wireless Networks without Constellation Expansion. ISIT 2006: 2729-2733 - [c21]Reza Omrani, P. Vijay Kumar:
Codes for Optical CDMA. SETA 2006: 34-46 - [i6]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff. CoRR abs/cs/0602054 (2006) - [i5]M. Anand, P. Vijay Kumar:
Low Correlation Sequences over QAM and AM-PSK Constellations. CoRR abs/cs/0610025 (2006) - [i4]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. CoRR abs/cs/0611156 (2006) - 2005
- [j48]Hsiao-feng Lu, P. Vijay Kumar:
A unified construction of space-time codes with optimal rate-diversity tradeoff. IEEE Trans. Inf. Theory 51(5): 1709-1730 (2005) - [c20]Reza Omrani, P. Vijay Kumar:
Improved constructions and bounds for 2-D optical orthogonal codes. ISIT 2005: 127-131 - [c19]Reza Omrani, Oscar Moreno, P. Vijay Kumar:
Improved Johnson bounds for optical orthogonal codes with λ > 1 and some optimal constructions. ISIT 2005: 259-263 - [c18]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff. ISIT 2005: 896-900 - [c17]Sameer A. Pawar, K. Raj Kumar, P. Vijay Kumar, Petros Elia, B. A. Sethuraman:
Achieving the DMD tradeoff of the MIMO-ARQ channel. ISIT 2005: 901-905 - [i3]Petros Elia, B. A. Sethuraman, P. Vijay Kumar:
Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas. CoRR abs/cs/0512023 (2005) - [i2]Petros Elia, P. Vijay Kumar:
Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks. CoRR abs/cs/0512028 (2005) - 2004
- [j47]Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth:
An Assmus-Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z4. Des. Codes Cryptogr. 31(1): 75-92 (2004) - [j46]Hsiao-feng Lu, P. Vijay Kumar, Habong Chung:
On orthogonal designs and space-time codes. IEEE Commun. Lett. 8(4): 220-222 (2004) - [j45]Hsiao-feng Lu, P. Vijay Kumar, En-Hui Yang:
On the input-output weight enumerators of product accumulate codes. IEEE Commun. Lett. 8(8): 520-522 (2004) - [c16]Vummintala Shashidhar, B. Sundar Rajan, P. Vijay Kumar:
Asymptotic-information-lossless designs and diversity-multiplexing tradeoff. GLOBECOM 2004: 366-370 - [c15]Hsiao-feng Lu, P. Vijay Kumar:
Generalized unified construction of space-time codes with optimal rate-diversity tradeoff. ISIT 2004: 95 - [c14]Vummintala Shashidhar, B. Sundar Rajan, P. Vijay Kumar:
STBCs with optimal diversity-multiplexing tradeoff for 2, 3 and 4 transmit antennas. ISIT 2004: 125 - [c13]P. Vijay Kumar, Hsiao-feng Lu, Sameer A. Pawar:
On the decoding and diversity-multiplexing gain tradeoff of a recent multilevel construction of space-time codes. ISIT 2004: 128 - [c12]Yuankai Wang, Reza Omrani, Keith M. Chugg, P. Vijay Kumar:
Low-density parity-check space-time codes: performance analysis and code construction. ISIT 2004: 156 - [c11]Reza Omrani, Oscar Moreno, P. Vijay Kumar:
Optimal optical orthogonal codes with lambda > 1. ISIT 2004: 366 - [c10]Hsiao-feng Francis Lu, P. Vijay Kumar:
Optimal constructions of space-time codes over multiple fading blocks. ISIT 2004: 408 - [c9]Reza Omrani, Petros Elia, P. Vijay Kumar:
New Constructions and Bounds for 2-D Optical Orthogonal Codes. SETA 2004: 389-395 - [c8]Reza Omrani, Oscar Moreno, P. Vijay Kumar:
Topics on Optical Orthogonal Codes. SETA 2004: 396-405 - 2003
- [j44]Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth:
3-Designs from the Z4-Goethals Codes via a New Kloosterman Sum Identity. Des. Codes Cryptogr. 28(3): 247-263 (2003) - [j43]Chaoping Xing, P. Vijay Kumar, Cunsheng Ding
Low-correlation, large linear span sequences from function fields. IEEE Trans. Inf. Theory 49(6): 1439-1446 (2003) - [j42]Hsiao-feng Lu, P. Vijay Kumar:
Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions for PSK modulation. IEEE Trans. Inf. Theory 49(10): 2747-2751 (2003) - [j41]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. Inf. Theory 49(10): 2752-2757 (2003) - [c7]Hsiao-feng Lu, P. Vijay Kumar:
Constructing optimal space-time codes over various signal constellations. GLOBECOM 2003: 1973-1977 - [c6]Hsiao-feng Lu, P. Vijay Kumar:
Algebraic constructions of optimal space-time trellis codes. GLOBECOM 2003: 1984-1988 - 2002
- [c5]Hsiao-feng Lu, Yuankai Wang
On the performance of space-time codes. ITW 2002: 49-52 - [e1]Tor Helleseth, P. Vijay Kumar, Kyeongcheol Yang:
Sequences and their Applications - Proceedings of SETA 2001, Bergen, Norway, May 13-17, 2001. Discrete Mathematics and Theoretical Computer Science, Springer 2002, ISBN 978-1-85233-529-8 [contents] - 2001
- [j40]Tor Helleseth, P. Vijay Kumar, Halvard Martinsen:
A New Family of Ternary Sequences with Ideal Two-level Autocorrelation Function. Des. Codes Cryptogr. 23(2): 157-166 (2001) - [j39]Dong-Joon Shin, P. Vijay Kumar
5-Designs from the lifted Golay code over Z4 via an Assmus-Mattson type approach. Discret. Math. 241(1-3): 479-487 (2001) - [j38]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. Inf. Theory 47(4): 1473-1481 (2001) - [j37]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. Inf. Theory 47(4): 1613-1619 (2001) - [j36]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. Inf. Theory 47(6): 2225-2241 (2001) - [j35]K. T. Arasu, Cunsheng Ding
Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inf. Theory 47(7): 2934-2943 (2001) - [c4]Robert A. Scholtz, P. Vijay Kumar, Carlos J. Corrada-Bravo:
Signal Design for Ultra-wideband Radio. SETA 2001: 72-87 - 2000
- [j34]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. Inf. Theory 46(2): 680-687 (2000) - [j33]Kyeongcheol Yang, Young-Ky Kim, P. Vijay Kumar
Quasi-orthogonal sequences for code-division multiple-access systems. IEEE Trans. Inf. Theory 46(3): 982-993 (2000)
1990 – 1999
- 1998
- [j32]Tor Helleseth, P. Vijay Kumar, Kyeongcheol Yang:
An Infinite Family of 3-Designs from Preparata Codes over Z. Des. Codes Cryptogr. 15(2): 175-181 (1998) - [c3]Anchung Chang, Solomon W. Golomb, Guang Gong, P. Vijay Kumar:
On Ideal Autocorrelation Sequences Arising from Hyperovals. SETA 1998: 17-38 - [c2]Tor Helleseth, P. Vijay Kumar, H. M. Martinsen, O. N. Vassbakk:
Correlation Distribution of the Quaternary Kasami Sequences. SETA 1998: 240-253 - 1997
- [j31]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) - 1996
- [j30]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 Cryptogr. 9(3): 257-266 (1996) - [j29]Tor Helleseth, P. Vijay Kumar:
On the weight hierarchy of the semiprimitive codes. Discret. Math. 152(1-3): 185-190 (1996) - [j28]A. Robert Calderbank, Gary McGuire, P. Vijay Kumar, Tor Helleseth:
Cyclic codes over Z4, locator polynomials, and Newton's identities. IEEE Trans. Inf. Theory 42(1): 217-226 (1996) - [j27]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. Inf. Theory 42(1): 250-254 (1996) - [j26]P. Vijay Kumar
Large families of quaternary sequences with low correlation. IEEE Trans. Inf. Theory 42(2): 579-592 (1996) - [j25]P. Vijay Kumar:
Review of 'Algebraic Function Fields and Codes' (Stichtenoth, H.; 1993). IEEE Trans. Inf. Theory 42(2): 676 (1996) - [j24]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. Inf. Theory 42(4): 1212-1216 (1996) - [j23]Abhijit G. Shanbhag, P. Vijay Kumar, Tor Helleseth:
Improved binary codes and sequence families from Z4-linear codes. IEEE Trans. Inf. Theory 42(5): 1582-1587 (1996) - [j22]Kyeongcheol Yang, Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag:
On the weight hierarchy of Kerdock codes over Z4. IEEE Trans. Inf. Theory 42(5): 1587-1593 (1996) - 1995
- [j21]Tor Helleseth, P. Vijay Kumar:
The weight hierarchy of the Kasami codes. Discret. Math. 145(1-3): 133-143 (1995) - [j20]Oscar Moreno, Zhen Zhang, P. Vijay Kumar, Victor A. Zinoviev:
New constructions of optimal cyclically permutable constant weight codes. IEEE Trans. Inf. Theory 41(2): 448-455 (1995) - [j19]P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank:
An upper bound for Weft exponential sums over Galois tings and applications. IEEE Trans. Inf. Theory 41(2): 456-468 (1995) - [j18]Tor Helleseth, P. Vijay Kumar:
The algebraic decoding of the Z4-linear Goethals code. IEEE Trans. Inf. Theory 41(6): 2040-2048 (1995) - 1994
- [j17]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. IEEE Trans. Inf. Theory 40(2): 301-319 (1994) - [j16]Serdar Boztas
Binary sequences with Gold-like correlation but larger linear span. IEEE Trans. Inf. Theory 40(2): 532-537 (1994) - [j15]Kyeongcheol Yang, P. Vijay Kumar, Henning Stichtenoth:
On the weight hierarchy of geometric Goppa codes. IEEE Trans. Inf. Theory 40(3): 913-920 (1994) - 1993
- [j14]Oscar Moreno, P. Vijay Kumar:
Minimum distance bounds for cyclic codes and Deligne's theorem. IEEE Trans. Inf. Theory 39(5): 1524-1534 (1993) - [c1]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. AAECC 1993: 13-24 - [i1]A. Robert Calderbank, A. Roger Hammons Jr., P. Vijay Kumar, Neil J. A. Sloane, Patrick Solé:
A linear construction for certain Kerdock and Preparata codes. CoRR abs/math/9310227 (1993) - 1992
- [j13]Serdar Boztas
4-phase sequences with near-optimum correlation properties. IEEE Trans. Inf. Theory 38(3): 1101-1113 (1992) - [j12]Ara Patapoutian, P. Vijay Kumar:
The (d, k) subdoce of a linear block code. IEEE Trans. Inf. Theory 38(4): 1375-1382 (1992) - [j11]P. Vijay Kumar, Victor K.-W. Wei:
Minimum distance of logarithmic and fractional partial m-sequences. IEEE Trans. Inf. Theory 38(5): 1474-1482 (1992) - 1991
- [j10]P. Vijay Kumar
Prime-phase sequences with periodic correlation properties better than binary sequences. IEEE Trans. Inf. Theory 37(3): 603-616 (1991) - 1990
- [j9]P. Vijay Kumar, Chao-Ming Liu:
On lower bounds to the maximum correlation of complex roots-of-unity sequences. IEEE Trans. Inf. Theory 36(3): 633-640 (1990) - [j8]Habong Chung, P. Vijay Kumar:
Optical orthogonal codes-New bounds and an optimal construction. IEEE Trans. Inf. Theory 36(4): 866-873 (1990)
1980 – 1989
- 1989
- [j7]Habong Chung, P. Vijay Kumar:
A new general construction for generalized bent functions. IEEE Trans. Inf. Theory 35(1): 206-209 (1989) - [j6]Jong-Seon No, P. Vijay Kumar:
A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span. IEEE Trans. Inf. Theory 35(2): 371-379 (1989) - 1988
- [j5]P. Vijay Kumar:
Frequency-hopping code sequence designs having large linear span. IEEE Trans. Inf. Theory 34(1): 146-151 (1988) - [j4]P. Vijay Kumar:
On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function. IEEE Trans. Inf. Theory 34(2): 271-277 (1988) - 1985
- [j3]P. Vijay Kumar, Robert A. Scholtz, Lloyd R. Welch:
Generalized Bent Functions and Their Properties. J. Comb. Theory A 40(1): 90-107 (1985) - 1984
- [j2]P. Vijay Kumar:
On bent sequences and generalized bent functions (Ph.D. thesis abstr.). IEEE Trans. Inf. Theory 30(2): 450- (1984) - 1983
- [j1]P. Vijay Kumar, Robert A. Scholtz:
Bounds on the linear span of bent sequences. IEEE Trans. Inf. Theory 29(6): 854-862 (1983)
Coauthor Index
M. Nikhil Krishnan
aka: Muralee Nikhil Krishnan
aka: Muralee Nikhil Krishnan
Hsiao-feng Lu
aka: Hsiao-feng Francis Lu
aka: Hsiao-feng Francis Lu
K. V. Rashmi
aka: Korlakai Vinayak Rashmi
aka: Korlakai Vinayak Rashmi
Birenjith Sasidharan
aka: Birenjith Padmakumari Sasidharan
aka: Birenjith Padmakumari Sasidharan
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: