( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Binary codes with locality for multiple erasures having short block length.

, , и . ISIT, стр. 655-659. IEEE, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Balaji Samikannu

Hari Balaji

Babu Halan

R Srinivasan

Babu Vijayanath

 

Другие публикации лиц с тем же именем

Binary codes with locality for multiple erasures having short block length., , и . ISIT, стр. 655-659. IEEE, (2016)A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes., и . ISIT, стр. 2381-2385. IEEE, (2018)A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures., , и . ISIT, стр. 1778-1782. IEEE, (2017)Codes With Locality for Two Erasures., , , и . IEEE Trans. Inf. Theory, 65 (12): 7771-7789 (2019)On the Consistency of Output Code Based Learning Algorithms for Multiclass Learning Problems., , , и . COLT, том 35 из JMLR Workshop and Conference Proceedings, стр. 885-902. JMLR.org, (2014)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)A Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes., и . CoRR, (2017)Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions., и . CoRR, (2018)Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size., , и . IEEE Trans. Inf. Theory, 69 (7): 4303-4332 (июля 2023)Erasure coding for distributed storage: an overview., , , , , и . Sci. China Inf. Sci., 61 (10): 100301:1-100301:45 (2018)