default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrijesh Kumar Rai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Kumar K. P. Vijith
, Brijesh Kumar Rai, Tony Jacob:
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement. IEEE Trans. Inf. Theory 69(4): 2093-2112 (2023)- [c18]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
The Optimal Rate Memory Tradeoff in Multi-Access Coded Caching: Large Cache Size. ITW 2023: 165-169 - 2021
- [j12]Behrouz Zolfaghari, Gautam Srivastava, Swapnoneel Roy, Hamid R. Nemati, Fatemeh Afghah, Takeshi Koshiba, Abolfazl Razi, Khodakhast Bibak, Pinaki Mitra, Brijesh Kumar Rai:
Content Delivery Networks: State of the Art, Trends, and Future Roadmap. ACM Comput. Surv. 53(2): 34:1-34:34 (2021) - [j11]Behrouz Zolfaghari, Vikrant Singh, Brijesh Kumar Rai, Khodakhast Bibak, Takeshi Koshiba:
Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis. Entropy 23(11): 1459 (2021) - [j10]Behrouz Zolfaghari, Vikrant Singh, Sushmitha Reddy, Brijesh Kumar Rai, Khodakhast Bibak, Ali Dehghantanha:
Lower Bounds on Bandwidth Requirements of Regenerating Code Parameter Scaling in Distributed Storage Systems. IEEE Commun. Lett. 25(5): 1477-1481 (2021) - [c17]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching. ISIT 2021: 2537-2541 - [i15]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
The Exact Rate Memory Tradeoff for Large Caches with Coded Placement. CoRR abs/2101.09785 (2021) - [i14]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
The Exact Rate Memory Tradeoff for Small Caches with Coded Placement. CoRR abs/2102.04797 (2021) - 2020
- [j9]Vikrant Singh, Behrouz Zolfaghari, Chunduri Venkata Dheeraj Kumar, Brijesh Kumar Rai, Khodakhast Bibak, Gautam Srivastava, Swapnoneel Roy, Takeshi Koshiba:
Generalized Mm, r-Network: A Case for Fixed Message Dimensions. IEEE Commun. Lett. 24(1): 38-42 (2020) - [j8]Niladri Das, Brijesh Kumar Rai:
Characteristic Sets of Fixed-Dimension Vector Linear Codes for Non-Multicast Networks. IEEE Trans. Inf. Theory 66(12): 7408-7426 (2020) - [c16]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Towards the Exact Memory Rate Tradeoff for the (4, 5) Cache Network. SPCOM 2020: 1-5
2010 – 2019
- 2019
- [j7]Niladri Das, Brijesh Kumar Rai:
Vector Linear Solution iff Dimension ≥ m. IEEE Commun. Lett. 23(9): 1470-1473 (2019) - [c15]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Fundamental Limits of Coded Caching: The Memory Rate Pair (K - 1 - 1/K, 1/(K-1)). ISIT 2019: 2624-2628 - [c14]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Pareto Optimal Schemes in Coded Caching. ISIT 2019: 2629-2633 - [c13]Kumar K. P. Vijith, Brijesh Kumar Rai, Tony Jacob:
Towards the Exact Rate Memory Tradeoff in Coded Caching. NCC 2019: 1-6 - [i13]Niladri Das, Brijesh Kumar Rai:
Linear Network Coding: Effects of Varying the Message Dimension on the Set of Characteristics. CoRR abs/1901.04820 (2019) - [i12]Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Fundamental Limits of Coded Caching: The Memory Rate Pair (K-1-1/K, 1/(K-1)). CoRR abs/1905.08471 (2019) - 2018
- [c12]Niladri Das, Brijesh Kumar Rai:
On the Power of Vector Linear Network Coding. ISITA 2018: 232-236 - 2017
- [j6]Niladri Das, Brijesh Kumar Rai:
On achievability of an ( r , l ) fractional linear network code. IET Networks 6(3): 54-61 (2017) - [j5]Brijesh Kumar Rai, Niladri Das:
On characteristics dependent linear coding capacity of sum-networks. IET Networks 6(5): 133-137 (2017) - [j4]Ripudaman Singh, Brijesh Kumar Rai, Sanjay K. Bose:
A Joint Routing and MAC Protocol for Transmission Delay Reduction in Many-to-One Communication Paradigm for Wireless Sensor Networks. IEEE Internet Things J. 4(4): 1031-1045 (2017) - [c11]Niladri Das, Brijesh Kumar Rai:
Generalized Fano and non-Fano networks. NCC 2017: 1-6 - [c10]Niladri Das, Brijesh Kumar Rai:
On fractional linear network coding solution of multiple-unicast networks. NCC 2017: 1-6 - [c9]Niladri Das, Brijesh Kumar Rai:
Sum-networks: Dependency on characteristic of the finite field under linear network coding. NCC 2017: 1-6 - [i11]Niladri Das, Brijesh Kumar Rai:
On the Dependence of Linear Coding Rates on the Characteristic of the Finite Field. CoRR abs/1709.05970 (2017) - 2016
- [j3]Niladri Das, Brijesh Kumar Rai:
On the Message Dimensions of Vector Linearly Solvable Networks. IEEE Commun. Lett. 20(9): 1701-1704 (2016) - [i10]Niladri Das, Brijesh Kumar Rai:
On the Message Dimensions of Vector Linearly Solvable Networks. CoRR abs/1606.05904 (2016) - [i9]Niladri Das, Brijesh Kumar Rai:
On Achievability of an (r, l) Fractional Linear Network Code. CoRR abs/1607.01736 (2016) - [i8]Ripudaman Singh, Brijesh Kumar Rai, Sanjay Kumar Bose:
A Cross-layer Contention Based Synchronous MAC Protocol for Transmission Delay Reduction in Multi-Hop WSNs. CoRR abs/1609.01622 (2016) - [i7]Niladri Das, Brijesh Kumar Rai:
Generalized Fano and non-Fano networks. CoRR abs/1609.05815 (2016) - [i6]Niladri Das, Brijesh Kumar Rai:
On Fractional Linear Network Coding Solution of Multiple-Unicast Networks. CoRR abs/1610.08004 (2016) - [i5]Niladri Das, Brijesh Kumar Rai:
Sum-networks: Dependency on Characteristic of the Finite Field under Linear Network Coding. CoRR abs/1610.08408 (2016) - 2015
- [c8]Brijesh Kumar Rai:
Adaptive erasure code based distributed storage systems. CWIT 2015: 174-177 - [c7]Brijesh Kumar Rai, Vommi Dhoorjati, Lokesh Saini, Amit K. Jha:
On adaptive distributed storage systems. ISIT 2015: 1482-1486 - [c6]Niladri Das, Brijesh Kumar Rai:
On the number of sources and terminals of sum-networks with capacity p/q. NCC 2015: 1-6 - [c5]Brijesh Kumar Rai:
On adaptive (functional MSR code based) distributed storage systems. NetCod 2015: 46-50 - 2013
- [j2]Brijesh Kumar Rai, Niladri Das:
Sum-Networks: Min-Cut = 2 Does Not Guarantee Solvability. IEEE Commun. Lett. 17(11): 2144-2147 (2013) - [c4]Brijesh Kumar Rai, Niladri Das:
On the capacity of sum-networks. Allerton 2013: 1545-1552 - [c3]Brijesh Kumar Rai, Niladri Das:
On the capacity of ms/3t and 3s/nt sum-networks. ITW 2013: 1-5 - [c2]Pinaki Sarkar, Brijesh Kumar Rai, Aritra Dhar:
Connecting, scaling and securing RS code and TD based KPDs in WSNs: deterministic merging. MobiHoc 2013: 301-304 - 2012
- [j1]Brijesh Kumar Rai, Bikash Kumar Dey:
On Network Coding for Sum-Networks. IEEE Trans. Inf. Theory 58(1): 50-63 (2012)
2000 – 2009
- 2009
- [c1]Brijesh Kumar Rai, Bikash Kumar Dey:
Feasible alphabets for communicating the sum of sources over a network. ISIT 2009: 1353-1357 - [i4]Brijesh Kumar Rai, Bikash Kumar Dey:
Feasible alphabets for communicating the sum of sources over a network. CoRR abs/0901.2198 (2009) - [i3]Brijesh Kumar Rai, Bikash Kumar Dey:
Sum-networks: System of polynomial equations, unachievability of coding capacity, reversibility, insufficiency of linear network coding. CoRR abs/0906.0695 (2009) - [i2]Brijesh Kumar Rai, Bikash Kumar Dey:
Classification of \textit{sum-networks} based on network coding capacity. CoRR abs/0907.2090 (2009) - 2008
- [i1]Brijesh Kumar Rai, Bikash Kumar Dey, Abhay Karandikar:
Some results on communicating the sum of sources over a network. CoRR abs/0811.0285 (2008)
Coauthor Index
aka: Vijith Kumar K. P
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 22:46 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:
