default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahesh Babu Vaddi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c15]Mahesh Babu Vaddi, B. Sundar Rajan:
Weight Enumerating Function, Number of Full Rank Sub-matrices and Network Coding. ISIT 2019: 867-871- [c14]Mahesh Babu Vaddi, B. Sundar Rajan:
Reduced Complexity Index Codes and Improved Upperbound on Broadcast Rate for Neighboring Interference Problems. ISIT 2019: 1247-1251 - [c13]Mahesh Babu Vaddi, B. Sundar Rajan:
A Generalisation of Interlinked Cycle Structures and Their Index Coding Capacity. ISIT 2019: 1252-1256 - [c12]Mahesh Babu Vaddi, B. Sundar Rajan:
On the Minrank of Symmetric and Neighboring Side-information Index Coding Problems. ITW 2019: 1-5 - [c11]Mahesh Babu Vaddi, B. Sundar Rajan:
A Field-Size Independent Code Construction for Groupcast Index Coding Problems. ITW 2019: 1-5 - [i15]Mahesh Babu Vaddi, B. Sundar Rajan:
A Field-Size Independent Code Construction for Groupcast Index Coding Problems. CoRR abs/1901.00164 (2019) - [i14]Mahesh Babu Vaddi, B. Sundar Rajan:
A Relation Between Weight Enumerating Function and Number of Full Rank Sub-matrices. CoRR abs/1901.05721 (2019) - [i13]Mahesh Babu Vaddi, B. Sundar Rajan:
A Generalisation of Interlinked Cycle Structures and Their Index Coding Capacity. CoRR abs/1901.06804 (2019) - [i12]Mahesh Babu Vaddi, B. Sundar Rajan:
Reduced Complexity Index Codes and Improved Upperbound on Broadcast Rate for Neighboring Interference Problems. CoRR abs/1901.07123 (2019) - 2018
- [j2]Mahesh Babu Vaddi
, B. Sundar Rajan:
Optimal Index Codes for a New Class of Interlinked Cycle Structure. IEEE Commun. Lett. 22(4): 684-687 (2018) - [j1]Mahesh Babu Vaddi, B. Sundar Rajan:
Capacity of Symmetric Index Coding Problems With X-Network Setting With 2×2 Local Connectivity. IEEE Wirel. Commun. Lett. 7(3): 396-399 (2018) - [c10]Mahesh Babu Vaddi, B. Sundar Rajan:
Optimal error correcting index codes for two classes of index coding problems. CISS 2018: 1-5 - [c9]Mahesh Babu Vaddi, B. Sundar Rajan:
A New Upperbound on the Broadcast Rate and Near-Optimal Vector Linear Codes for Index Coding Problems with Symmetric Neighboring Interference. ISIT 2018: 601-605 - [c8]Mahesh Babu Vaddi, B. Sundar Rajan:
On the Conjectures on Optimality of Index Codes from Interlinked Cycle Cover Scheme. ISIT 2018: 606-610 - [c7]Mahesh Babu Vaddi, B. Sundar Rajan:
Reduced Dimensional Optimal Vector Linear Index Codes for Index Coding Problems with Symmetric Neighboring and Consecutive Side-information. ISITA 2018: 95-99 - [c6]Mahesh Babu Vaddi, B. Sundar Rajan:
On the Broadcast Rate of Index Coding Problems with Symmetric and Consecutive Interference. ISITA 2018: 110-114 - [c5]Mahesh Babu Vaddi, B. Sundar Rajan:
Low Complexity Decoding and Capacity of Index Coding Problems with Symmetric Side-Information. ITW 2018: 1-5 - [c4]Mahesh Babu Vaddi, B. Sundar Rajan:
On the Broadcast Rate and Fractional Clique Cover of Single Unicast Index Coding Problems. ITW 2018: 1-5 - [i11]Mahesh Babu Vaddi, B. Sundar Rajan:
Reduced Dimensional Optimal Vector Linear Index Codes for Index Coding Problems with Symmetric Neighboring and Consecutive Side-information. CoRR abs/1801.00406 (2018) - [i10]Mahesh Babu Vaddi, B. Sundar Rajan:
On the Broadcast Rate of Index Coding Problems with Symmetric and Consecutive Interference. CoRR abs/1801.08865 (2018) - [i9]Mahesh Babu Vaddi, B. Sundar Rajan:
Optimal Scalar Linear Index Codes for Symmetric and Neighboring Side-information Problems. CoRR abs/1811.05794 (2018) - 2017
- [c3]Mahesh Babu Vaddi, B. Sundar Rajan:
On the capacity of index coding problems with symmetric neighboring interference. ITW 2017: 294-298 - [i8]Mahesh Babu Vaddi, B. Sundar Rajan:
Low-Complexity Decoding for Symmetric, Neighboring and Consecutive Side-information Index Coding Problems. CoRR abs/1705.03192 (2017) - [i7]Mahesh Babu Vaddi, B. Sundar Rajan:
Capacity of Some Index Coding Problems with Symmetric Neighboring Interference. CoRR abs/1705.05060 (2017) - [i6]Mahesh Babu Vaddi, B. Sundar Rajan:
Near-Optimal Vector Linear Index Codes For Single Unicast Index Coding Problems with Symmetric Neighboring Interference. CoRR abs/1705.10614 (2017) - [i5]Mahesh Babu Vaddi, B. Sundar Rajan:
A New Upperbound on the Broadcast Rate of Index Coding Problems with Symmetric Neighboring Interference. CoRR abs/1707.00455 (2017) - 2016
- [c2]Mahesh Babu Vaddi, B. Sundar Rajan:
Optimal Scalar Linear Index Codes for One-Sided Neighboring Side-Information Problems. GLOBECOM Workshops 2016: 1-6 - [c1]Mahesh Babu Vaddi, B. Sundar Rajan:
Optimal vector linear index codes for some symmetric side information problems. ISIT 2016: 125-129 - [i4]Mahesh Babu Vaddi, B. Sundar Rajan:
Optimal Scalar Linear Index Codes for One-Sided Neighboring Side-Information Problems. CoRR abs/1605.08998 (2016) - 2015
- [i3]Mahesh Babu Vaddi, Roop Kumar Bhattaram, B. Sundar Rajan:
Optimal Scalar Linear Index Codes for Some Symmetric Multiple Unicast Problems. CoRR abs/1510.05435 (2015) - [i2]Roop Kumar Bhattaram, Mahesh Babu Vaddi, B. Sundar Rajan:
A Lifting Construction for Scalar Linear Index Codes. CoRR abs/1510.08592 (2015) - [i1]Mahesh Babu Vaddi, B. Sundar Rajan:
Optimal Vector Linear Index Codes for Some Symmetric Side Information Problems. CoRR abs/1511.00542 (2015)
Coauthor Index
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-04-24 23:16 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:
