受强制性开放获取政策约束的文章 - Vinayak Ramkumar了解详情
无法在其他位置公开访问的文章：7 篇
Simple streaming codes for reliable, low-latency communication
MN Krishnan, V Ramkumar, M Vajha, PV Kumar
IEEE Communications Letters 24 (2), 249-253, 2019
强制性开放获取政策： Department of Science & Technology, India
Coded MapReduce schemes based on placement delivery array
V Ramkumar, PV Kumar
2019 IEEE International Symposium on Information Theory (ISIT), 3087-3091, 2019
强制性开放获取政策： Department of Science & Technology, India
Rate-optimal streaming codes with smaller field size under less-stringent decoding-delay requirements
S Bhatnagar, V Ramkumar, PV Kumar
2022 IEEE Information Theory Workshop (ITW), 612-617, 2022
强制性开放获取政策： Department of Science & Technology, India
On Information-Debt-Optimal Streaming Codes With Small Memory
V Ramkumar, MN Krishnan, M Vajha, PV Kumar
2022 IEEE International Symposium on Information Theory (ISIT), 1578-1583, 2022
强制性开放获取政策： Department of Science & Technology, India
On Multi-Path Streaming Codes
V Ramkumar, S Bhatnagar, PV Kumar
2024 National Conference on Communications (NCC), 1-6, 2024
强制性开放获取政策： Department of Science & Technology, India
Coefficient complexity in low-access quantized linear computations
V Ramkumar, N Raviv, I Tamo
2023 59th Annual Allerton Conference on Communication, Control, and …, 2023
强制性开放获取政策： European Commission
Near-optimal streaming codes with linear field size
V Ramkumar, S Bhatnagar, PV Kumar
2023 IEEE International Symposium on Information Theory (ISIT), 1118-1123, 2023
强制性开放获取政策： Department of Science & Technology, India
可在其他位置公开访问的文章：12 篇
Erasure coding for distributed storage: An overview
SB Balaji, MN Krishnan, M Vajha, V Ramkumar, B Sasidharan, PV Kumar
Science China Information Sciences 61, 1-45, 2018
强制性开放获取政策： US National Science Foundation
Clay codes: Moulding {MDS} codes to yield an {MSR} code
M Vajha, V Ramkumar, B Puranik, G Kini, E Lobo, B Sasidharan, ...
16th USENIX Conference on File and Storage Technologies (FAST 18), 139-154, 2018
强制性开放获取政策： US National Science Foundation
Binary, shortened projective Reed Muller codes for coded private information retrieval
M Vajha, V Ramkumar, PV Kumar
2017 IEEE International Symposium on Information Theory (ISIT), 2648-2652, 2017
强制性开放获取政策： US National Science Foundation
Explicit rate-optimal streaming codes with smaller field size
M Vajha, V Ramkumar, MN Krishnan, PV Kumar
IEEE Transactions on Information Theory, 2023
强制性开放获取政策： Department of Science & Technology, India
Staggered diagonal embedding based linear field size streaming codes
V Ramkumar, M Vajha, MN Krishnan, PV Kumar
2020 IEEE International Symposium on Information Theory (ISIT), 503-508, 2020
强制性开放获取政策： Department of Science & Technology, India
On the performance analysis of streaming codes over the gilbert-elliott channel
M Vajha, V Ramkumar, M Jhamtani, PV Kumar
2021 IEEE Information Theory Workshop (ITW), 1-6, 2021
强制性开放获取政策： Department of Science & Technology, India
Locally recoverable streaming codes for packet-erasure recovery
V Ramkumar, M Vajha, PV Kumar
2021 IEEE Information Theory Workshop (ITW), 1-6, 2021
强制性开放获取政策： Department of Science & Technology, India
On sliding window approximation of gilbert-elliott channel for delay constrained setting
M Vajha, V Ramkumar, M Jhamtani, PV Kumar
CoRR, 2020
强制性开放获取政策： Department of Science & Technology, India
Determining the generalized hamming weight hierarchy of the binary projective Reed-Muller code
V Ramkumar, M Vajha, PV Kumar
2018 Twenty Fourth National Conference on Communications (NCC), 1-5, 2018
强制性开放获取政策： US National Science Foundation
Generalized simple streaming codes from mds codes
V Ramkumar, M Vajha, PV Kumar
2021 IEEE International Symposium on Information Theory (ISIT), 878-883, 2021
强制性开放获取政策： Department of Science & Technology, India
Access-redundancy tradeoffs in quantized linear computations
V Ramkumar, N Raviv, I Tamo
IEEE Transactions on Information Theory, 2024
强制性开放获取政策： European Commission
Explicit information-debt-optimal streaming codes with small memory
MN Krishnan, M Vajha, V Ramkumar, PV Kumar
2023 IEEE International Symposium on Information Theory (ISIT), 1112-1117, 2023
强制性开放获取政策： Department of Science & Technology, India
出版信息和资助信息由计算机程序自动确定