default search action
Myna Vajha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Myna Vajha
, Vinayak Ramkumar
Explicit Rate-Optimal Streaming Codes With Smaller Field Size. IEEE Trans. Inf. Theory 70(5): 3242-3261 (2024) - [c13]Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan:
Streaming Codes for Three-Node Relay Networks with Burst Erasures. ISIT 2024: 1979-1984 - 2023
- [j6]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) - [c12]M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar:
Explicit Information-Debt-Optimal Streaming Codes With Small Memory. ISIT 2023: 1112-1117 - [i14]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
- [j5]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) - [j4]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) - [c11]Vinayak Ramkumar, M. Nikhil Krishnan, Myna Vajha, P. Vijay Kumar:
On Information-Debt-Optimal Streaming Codes With Small Memory. ISIT 2022: 1578-1583 - 2021
- [c10]Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan
Explicit Rate-Optimal Streaming Codes with Smaller Field Size. ISIT 2021: 736-741 - [c9]Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Generalized Simple Streaming Codes from MDS Codes. ISIT 2021: 878-883 - [c8]Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Locally Recoverable Streaming Codes for Packet-Erasure Recovery. ITW 2021: 1-6 - [c7]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 - [i13]Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Generalized Simple Streaming Codes from MDS Codes. CoRR abs/2104.07005 (2021) - [i12]Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan, P. Vijay Kumar:
Explicit Rate-Optimal Streaming Codes with Smaller Field Size. CoRR abs/2105.04432 (2021) - [i11]Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Locally Recoverable Streaming Codes for Packet-Erasure Recovery. CoRR abs/2109.03168 (2021) - 2020
- [j3]M. Nikhil Krishnan
Simple Streaming Codes for Reliable, Low-Latency Communication. IEEE Commun. Lett. 24(2): 249-253 (2020) - [c6]Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes. ISIT 2020: 503-508 - [i10]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) - [i9]Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar:
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes. CoRR abs/2005.07113 (2020) - [i8]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
- [c5]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 - 2018
- [j2]Balaji Srinivasan Babu, M. Nikhil Krishnan
Erasure coding for distributed storage: an overview. Sci. China Inf. Sci. 61(10): 100301:1-100301:45 (2018) - [c4]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 - [c3]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 - [i7]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) - [i6]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) - [i5]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) - 2017
- [c2]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 - [c1]Myna Vajha, Vinayak Ramkumar, R. Vijay Kumar:
Binary, shortened projective reed muller codes for coded private information retrieva. ISIT 2017: 2648-2652 - [i4]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) - [i3]Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar:
Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval. CoRR abs/1702.05074 (2017) - 2016
- [j1]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) - [i2]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) - [i1]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)
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-10-13 18:03 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: