Myna Vajha
Orcid: 0000-0002-7770-2583
According to our database1,
Myna Vajha
authored at least 25 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
IEEE Trans. Inf. Theory, May, 2024
Proceedings of the IEEE International Symposium on Information Theory, 2024
2023
Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size.
IEEE Trans. Inf. Theory, July, 2023
Proceedings of the IEEE International Symposium on Information Theory, 2023
2022
Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound.
IEEE Trans. Inf. Theory, 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
2021
Proceedings of the IEEE Information Theory Workshop, 2021
Proceedings of the IEEE Information Theory Workshop, 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
IEEE Commun. Lett., 2020
On Sliding Window Approximation of Gilbert-Elliott Channel for Delay Constrained Setting.
CoRR, 2020
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code.
CoRR, 2018
Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d=k+1, k+2, k+3$.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018
2017
Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval.
CoRR, 2017
Binary, shortened projective reed muller codes for coded private information retrieva.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and d < (n - 1).
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
2016
Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes.
Int. J. Inf. Coding Theory, 2016
An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair.
CoRR, 2016
Outer Bounds on the Storage-Repair Bandwidth Tradeoff of Exact-Repair Regenerating Codes.
CoRR, 2016