Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Sasidharan, Birenjith"'
The structure of linear dependence relations between coded symbols of a linear code, irrespective of specific coefficients involved, is referred to as the {\em topology} of the code. The specification of coefficients is referred to as an {\em instant
Externí odkaz:
http://arxiv.org/abs/2406.12160
In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have a size $M=2^k$. For every integer $\ell \geq 3$, we construct a $(n=2^\ell, M=2^{k_{\ell}}, d=2)$ constant
Externí odkaz:
http://arxiv.org/abs/2401.16647
The growing privacy concerns and the communication costs associated with transmitting raw data have resulted in techniques like federated learning, where the machine learning models are trained at the edge nodes, and the parameter updates are shared
Externí odkaz:
http://arxiv.org/abs/2311.14116
Publikováno v:
In Discrete Applied Mathematics 15 September 2024 354:214-228
Assignment of one of the two possible directions to every edge of an undirected graph $G=(V,E)$ is called an orientation of $G$. The resulting directed graph is denoted by $\overrightarrow{G}$. A strong orientation is one in which every vertex is rea
Externí odkaz:
http://arxiv.org/abs/2105.08308
Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes
Autor:
Sasidharan, Birenjith, Thomas, Anoop
The increasing amount of data generated at the edge/client nodes and the privacy concerns have resulted in learning at the edge, in which the computations are performed at edge devices and are communicated to a central node for updating the model. Th
Externí odkaz:
http://arxiv.org/abs/2105.02919
Autor:
Ramkumar, Vinayak, Vajha, Myna, Balaji, S. B., Krishnan, M. Nikhil, Sasidharan, Birenjith, Kumar, P. Vijay
This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of ensuring reliabi
Externí odkaz:
http://arxiv.org/abs/2010.01344
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Balaji, S. B., Krishnan, M. Nikhil, Vajha, Myna, Ramkumar, Vinayak, Sasidharan, Birenjith, Kumar, P. Vijay
In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient rep
Externí odkaz:
http://arxiv.org/abs/1806.04437