A high-rate MSR code with polynomial sub-packetization level
B Sasidharan, GK Agarwal… - 2015 IEEE International …, 2015 - ieeexplore.ieee.org
We present a high-rate (n, k, d= n− 1)-MSR code with a sub-packetization level that is
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
A High-Rate MSR Code With Polynomial Sub-Packetization Level
B Sasidharan, GK Agarwal, P Vijay Kumar - arXiv e-prints, 2015 - ui.adsabs.harvard.edu
We present a high-rate $(n, k, d= n-1) $-MSR code with a sub-packetization level that is
polynomial in the dimension $ k $ of the code. While polynomial sub-packetization level was …
polynomial in the dimension $ k $ of the code. While polynomial sub-packetization level was …
A high-rate MSR code with polynomial sub-packetization level
B Sasidharan, GK Agarwal, PV Kumar - 2015 IEEE International Symposium on … - infona.pl
We present a high-rate (n, k, d= n− 1)-MSR code with a sub-packetization level that is
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
A High-Rate MSR Code With Polynomial Sub-Packetization Level
B Sasidharan, GK Agarwal, PV Kumar - arXiv preprint arXiv:1501.06662, 2015 - arxiv.org
We present a high-rate $(n, k, d= n-1) $-MSR code with a sub-packetization level that is
polynomial in the dimension $ k $ of the code. While polynomial sub-packetization level was …
polynomial in the dimension $ k $ of the code. While polynomial sub-packetization level was …
[PDF][PDF] A High-Rate MSR Code With Polynomial Sub-Packetization Level
B Sasidharan, GK Agarwal… - arXiv preprint arXiv …, 2015 - researchgate.net
We present a high-rate (n, k, d= n− 1)-MSR code with a sub-packetization level that is
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
A high-rate MSR code with polynomial sub-packetization level
B Sasidharan, GK Agarwal… - … on Information Theory …, 2015 - research.monash.edu
We present a high-rate (n, k, d= n-1)-MSR code with a sub-packetization level that is
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
High-Rate MSR Code With Polynomial Sub-Packetization Level
B Sasidharan, GK Agarwal, VP Kumar - 2015 - eprints.iisc.ac.in
We present a high-rate (n, k, d= n-1)-MSR code with a sub-packetization level that is
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
High-Rate MSR Code With Polynomial Sub-Packetization Level
B Sasidharan, GK Agarwal, VP Kumar - 2015 - eprints.iisc.ac.in
We present a high-rate (n, k, d= n-1)-MSR code with a sub-packetization level that is
polynomial in the dimension k of the code. While polynomial sub-packetization level was …
polynomial in the dimension k of the code. While polynomial sub-packetization level was …