Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Mahesh, Anjana A."'
We consider a variant of the coded caching problem where users connect to two types of caches, called private caches and access caches. The problem setting consists of a server having a library of files and a set of access caches. Every user, equippe
Externí odkaz:
http://arxiv.org/abs/2408.13165
We consider a variant of the coded caching problem where users connect to two types of caches, called private and access caches. The problem setting consists of a server with a library of files and a set of access caches. Each user, equipped with a p
Externí odkaz:
http://arxiv.org/abs/2407.00677
This paper studies noisy index coding problems over single-input single-output broadcast channels. The codewords from a chosen index code of length $N$ are transmitted after $2^N$-PSK modulation over an AWGN channel. In "Index Coded PSK Modulation fo
Externí odkaz:
http://arxiv.org/abs/2305.12359
Ong and Ho developed optimal linear index codes for single uniprior index coding problems (ICPs) by finding a spanning tree for each of the strongly connected components of the corresponding information-flow graphs, following which Thomas et al. cons
Externí odkaz:
http://arxiv.org/abs/2303.10460
Autor:
Mahesh, Anjana A, Rajan, B. Sundar
This paper deals with embedded index coding problem (EICP), introduced by A. Porter and M. Wootters, which is a decentralized communication problem among users with side information. An alternate definition of the parameter minrank of an EICP, which
Externí odkaz:
http://arxiv.org/abs/2201.08680
The demand for multimedia services is growing day by day in vehicular ad-hoc networks (VANETs), resulting in high spectral usage and network congestion. Non-orthogonal multiple access (NOMA) is a promising wireless communication technique to solve th
Externí odkaz:
http://arxiv.org/abs/2110.11098
Autor:
Mahesh, Anjana A., Rajan, B. Sundar
This paper addresses the problem of exponentially increasing sub-packetization with the number of users in a centralized coded caching system by introducing a new coded caching scheme inspired by the symmetric neighboring consecutive side information
Externí odkaz:
http://arxiv.org/abs/2009.10923
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:
Mahesh, Anjana A., Rajan, B. Sundar
Noisy index coding problems over AWGN channel are considered. For a given index coding problem and a chosen scalar linear index code of length $N$, we propose to transmit the $N$ index coded bits as a single signal from a $2^N$- PSK constellation. By
Externí odkaz:
http://arxiv.org/abs/1603.03152