Brijesh Kumar Rai

Orcid: 0000-0001-9719-956X

According to our database1, Brijesh Kumar Rai authored at least 40 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement.
IEEE Trans. Inf. Theory, April, 2023

The Optimal Rate Memory Tradeoff in Multi-Access Coded Caching: Large Cache Size.
Proceedings of the IEEE Information Theory Workshop, 2023

2021
Lower Bounds on Bandwidth Requirements of Regenerating Code Parameter Scaling in Distributed Storage Systems.
IEEE Commun. Lett., 2021

Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis.
Entropy, 2021

Content Delivery Networks: State of the Art, Trends, and Future Roadmap.
ACM Comput. Surv., 2021

The Exact Rate Memory Tradeoff for Small Caches with Coded Placement.
CoRR, 2021

The Exact Rate Memory Tradeoff for Large Caches with Coded Placement.
CoRR, 2021

Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Characteristic Sets of Fixed-Dimension Vector Linear Codes for Non-Multicast Networks.
IEEE Trans. Inf. Theory, 2020

Generalized M<sub>m, r</sub>-Network: A Case for Fixed Message Dimensions.
IEEE Commun. Lett., 2020

Towards the Exact Memory Rate Tradeoff for the (4, 5) Cache Network.
Proceedings of the International Conference on Signal Processing and Communications, 2020

2019
Vector Linear Solution iff Dimension ≥ m.
IEEE Commun. Lett., 2019

Linear Network Coding: Effects of Varying the Message Dimension on the Set of Characteristics.
CoRR, 2019

Towards the Exact Rate Memory Tradeoff in Coded Caching.
Proceedings of the National Conference on Communications, 2019

Pareto Optimal Schemes in Coded Caching.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Fundamental Limits of Coded Caching: The Memory Rate Pair (K - 1 - 1/K, 1/(K-1)).
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On the Power of Vector Linear Network Coding.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
A Joint Routing and MAC Protocol for Transmission Delay Reduction in Many-to-One Communication Paradigm for Wireless Sensor Networks.
IEEE Internet Things J., 2017

On characteristics dependent linear coding capacity of sum-networks.
IET Networks, 2017

On achievability of an ( <i>r</i> , <i>l</i> ) fractional linear network code.
IET Networks, 2017

On the Dependence of Linear Coding Rates on the Characteristic of the Finite Field.
CoRR, 2017

Sum-networks: Dependency on characteristic of the finite field under linear network coding.
Proceedings of the Twenty-third National Conference on Communications, 2017

On fractional linear network coding solution of multiple-unicast networks.
Proceedings of the Twenty-third National Conference on Communications, 2017

Generalized Fano and non-Fano networks.
Proceedings of the Twenty-third National Conference on Communications, 2017

2016
On the Message Dimensions of Vector Linearly Solvable Networks.
IEEE Commun. Lett., 2016

A Cross-layer Contention Based Synchronous MAC Protocol for Transmission Delay Reduction in Multi-Hop WSNs.
CoRR, 2016

On Achievability of an (r, l) Fractional Linear Network Code.
CoRR, 2016

2015
On adaptive (functional MSR code based) distributed storage systems.
Proceedings of the 2015 International Symposium on Network Coding, 2015

On the number of sources and terminals of sum-networks with capacity p/q.
Proceedings of the Twenty First National Conference on Communications, 2015

On adaptive distributed storage systems.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Adaptive erasure code based distributed storage systems.
Proceedings of the 14th IEEE Canadian Workshop on Information Theory, 2015

2013
Sum-Networks: Min-Cut = 2 Does Not Guarantee Solvability.
IEEE Commun. Lett., 2013

Connecting, scaling and securing RS code and TD based KPDs in WSNs: deterministic merging.
Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2013

On the capacity of ms/3t and 3s/nt sum-networks.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

On the capacity of sum-networks.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
On Network Coding for Sum-Networks.
IEEE Trans. Inf. Theory, 2012

2009
Classification of \textit{sum-networks} based on network coding capacity
CoRR, 2009

Sum-networks: System of polynomial equations, unachievability of coding capacity, reversibility, insufficiency of linear network coding
CoRR, 2009

Feasible alphabets for communicating the sum of sources over a network.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Some results on communicating the sum of sources over a network
CoRR, 2008


  Loading...