Zobrazeno 1 - 10
of 1 457
pro vyhledávání: '"Lalitha V"'
Autor:
Rameshwar, V. Arvind, Lalitha, V.
In this paper, we revisit the Recursive Projection-Aggregation (RPA) decoder, of Ye and Abbe (2020), for Reed-Muller (RM) codes. Our main contribution is an explicit upper bound on the probability of incorrect decoding, using the RPA decoder, over a
Externí odkaz:
http://arxiv.org/abs/2412.08129
We consider a distributed multi-user secret sharing (DMUSS) setting in which there is a dealer, $n$ storage nodes, and $m$ secrets. Each user demands a $t$-subset of $m$ secrets. Earlier work in this setting dealt with the case of $t=1$; in this work
Externí odkaz:
http://arxiv.org/abs/2312.15763
Maximally recoverable codes are a class of codes which recover from all potentially recoverable erasure patterns given the locality constraints of the code. In earlier works, these codes have been studied in the context of codes with locality. The no
Externí odkaz:
http://arxiv.org/abs/2105.03328
Autor:
Gupta, Shreya, Lalitha, V.
In distributed storage systems, cooperative regenerating codes tradeoff storage for repair bandwidth in the case of multiple node failures. In rack-aware distributed storage systems, there is no cost associated with transferring symbols within a rack
Externí odkaz:
http://arxiv.org/abs/2102.12421
We consider a generalization of the gradient coding framework where a dataset is divided across $n$ workers and each worker transmits to a master node one or more linear combinations of the gradients over its assigned data subsets. Unlike the convent
Externí odkaz:
http://arxiv.org/abs/2102.10163
Blockchain is a distributed ledger with wide applications. Due to the increasing storage requirement for blockchains, the computation can be afforded by only a few miners. Sharding has been proposed to scale blockchains so that storage and transactio
Externí odkaz:
http://arxiv.org/abs/2011.06201
The problem of data exchange between multiple nodes with storage and communication capabilities models several current multi-user communication problems like Coded Caching, Data Shuffling, Coded Computing, etc. The goal in such problems is to design
Externí odkaz:
http://arxiv.org/abs/2010.10459
Distributed databases often suffer unequal distribution of data among storage nodes, which is known as `data skew'. Data skew arises from a number of causes such as removal of existing storage nodes and addition of new empty nodes to the database. Da
Externí odkaz:
http://arxiv.org/abs/2001.04939
An index code for broadcast channel with receiver side information is locally decodable if each receiver can decode its demand by observing only a subset of the transmitted codeword symbols instead of the entire codeword. Local decodability in index
Externí odkaz:
http://arxiv.org/abs/1910.08745
Publikováno v:
IEEE Transactions on Communications, 2020
Coding theoretic techniques have been proposed for synchronous Gradient Descent (GD) on multiple servers to mitigate stragglers. These techniques provide the flexibility that the job is complete when any $k$ out of $n$ servers finish their assigned t
Externí odkaz:
http://arxiv.org/abs/1909.02516