Добірка наукової літератури з теми "Index coding with restricted information"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Index coding with restricted information".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Index coding with restricted information"
Hong, Charles, James Fallon, and Karl Friston. "fMRI Evidence for Default Mode Network Deactivation Associated with Rapid Eye Movements in Sleep." Brain Sciences 11, no. 11 (November 18, 2021): 1528. http://dx.doi.org/10.3390/brainsci11111528.
Повний текст джерелаBaker, John, Kathryn Berzins, Krysia Canvin, Sarah Kendal, Stella Branthonne-Foster, Judy Wright, Tim McDougall, Barry Goldson, Ian Kellar, and Joy Duxbury. "Components of interventions to reduce restrictive practices with children and young people in institutional settings: the Contrast systematic mapping review." Health and Social Care Delivery Research 10, no. 8 (May 2022): 1–180. http://dx.doi.org/10.3310/yvkt5692.
Повний текст джерелаBar-Yossef, Ziv, Yitzhak Birk, T. S. Jayram, and Tomer Kol. "Index Coding With Side Information." IEEE Transactions on Information Theory 57, no. 3 (March 2011): 1479–94. http://dx.doi.org/10.1109/tit.2010.2103753.
Повний текст джерелаNarayanan, Varun, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani, and Vinod M. Prabhakaran. "Private Index Coding." IEEE Transactions on Information Theory 68, no. 3 (March 2022): 2020–49. http://dx.doi.org/10.1109/tit.2021.3130629.
Повний текст джерелаNatarajan, Lakshmi, Yi Hong, and Emanuele Viterbo. "Lattice Index Coding." IEEE Transactions on Information Theory 61, no. 12 (December 2015): 6505–25. http://dx.doi.org/10.1109/tit.2015.2491924.
Повний текст джерелаLee, Namyoon, Alexandros G. Dimakis, and Robert W. Heath. "Index Coding With Coded Side-Information." IEEE Communications Letters 19, no. 3 (March 2015): 319–22. http://dx.doi.org/10.1109/lcomm.2015.2388477.
Повний текст джерелаKim, Jae-Won, and Jong-Seon No. "Index Coding With Erroneous Side Information." IEEE Transactions on Information Theory 63, no. 12 (December 2017): 7687–97. http://dx.doi.org/10.1109/tit.2017.2756663.
Повний текст джерелаManoranjan Paul, and Manzur Murshed. "Efficient Pattern Index coding Using Syndrome Coding and Side Information." International Journal of Engineering and Industries 3, no. 3 (September 30, 2012): 1–12. http://dx.doi.org/10.4156/ijei.vol3.issue3.1.
Повний текст джерелаPedrosa, Valéria G., and Max H. M. Costa. "Index Coding with Multiple Interpretations." Entropy 24, no. 8 (August 18, 2022): 1149. http://dx.doi.org/10.3390/e24081149.
Повний текст джерелаLi, Min, Lawrence Ong, and Sarah J. Johnson. "Cooperative Multi-Sender Index Coding." IEEE Transactions on Information Theory 65, no. 3 (March 2019): 1725–39. http://dx.doi.org/10.1109/tit.2018.2869161.
Повний текст джерелаДисертації з теми "Index coding with restricted information"
Su, Yong. "Mathematical modeling with applications in high-performance coding." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1127139848.
Повний текст джерелаTitle from first page of PDF file. Document formatted into pages; contains xiv, 130 p.; also includes graphics (some col.). Includes bibliographical references (p. 125-130). Available online via OhioLINK's ETD Center
Wan, Kai. "Limites fondamentales de stockage pour les réseaux de diffusion de liens partagés et les réseaux de combinaison." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS217/document.
Повний текст джерелаIn this thesis, we investigated the coded caching problem by building the connection between coded caching with uncoded placement and index coding, and leveraging the index coding results to characterize the fundamental limits of coded caching problem. We mainly analysed the caching problem in shared-link broadcast model and in combination networks. In the first part of this thesis, for cache-aided shared-link broadcast networks, we considered the constraint that content is placed uncoded within the caches. When the cache contents are uncoded and the user demands are revealed, the caching problem can be connected to an index coding problem. We derived fundamental limits for the caching problem by using tools for the index coding problem. A novel index coding achievable scheme was first derived based on distributed source coding. This inner bound was proved to be strictly better than the widely used “composite (index) coding” inner bound by leveraging the ignored correlation among composites and the non-unique decoding. For the centralized caching problem, an outer bound under the constraint of uncoded cache placement is proposed based on the “acyclic index coding outer bound”. This outer bound is proved to be achieved by the cMAN scheme when the number of files is not less than the number of users, and by the proposed novel index coding achievable scheme otherwise. For the decentralized caching problem, this thesis proposes an outer bound under the constraint that each user stores bits uniformly and independently at random. This outer bound is achieved by dMAN when the number of files is not less than the number of users, and by our proposed novel index coding inner bound otherwise. In the second part of this thesis, we considered the centralized caching problem in two-hop relay networks, where the server communicates with cache-aided users through some intermediate relays. Because of the hardness of analysis on the general networks, we mainly considered a well-known symmetric relay networks, combination networks, including H relays and binom{H}{r} users where each user is connected to a different r-subset of relays. We aimed to minimize the max link-load for the worst cases. We derived outer and inner bounds in this thesis. For the outer bound, the straightforward way is that each time we consider a cut of x relays and the total load transmitted to these x relays could be outer bounded by the outer bound for the shared-link model including binom{x}{r} users. We used this strategy to extend the outer bounds for the shared-link model and the acyclic index coding outer bound to combination networks. In this thesis, we also tightened the extended acyclic index coding outer bound in combination networks by further leveraging the network topology and joint entropy of the various random variables. For the achievable schemes, there are two approaches, separation and non-separation. In the separation approach, we use cMAN cache placement and multicast message generation independent of the network topology. We then deliver cMAN multicast messages based on the network topology. In the non-separation approach, we design the placement and/or the multicast messages on the network topology. We proposed four delivery schemes on separation approach. On non-separation approach, firstly for any uncoded cache placement, we proposed a delivery scheme by generating multicast messages on network topology. Moreover, we also extended our results to more general models, such as combination networks with cache-aided relays and users, and caching systems in more general relay networks. Optimality results were given under some constraints and numerical evaluations showed that our proposed schemes outperform the state-of-the-art
Thomas, Anoop. "Index Coding, Error Correcting Index Codes And Matroids." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5326.
Повний текст джерелаThapa, Chandra. "Graphical approaches to single-sender and two-sender index coding." Thesis, 2018. http://hdl.handle.net/1959.13/1388175.
Повний текст джерелаIn index coding, a sender broadcasts messages through a noiseless broadcast channel to multiple receivers, each possessing a subset of the messages a priori, known as side-information. The sender knows the side-information available at each receiver, and uses that information to broadcasts coded messages, called an index code, such that all receivers can decode their requested messages using their side-information and the received index code. The aim is to find an index code with the minimum information bits per received message bits, called the optimal broadcast rate. The index-coding problem is applicable in many real-world contexts such as content-distribution networks (e.g., a network providing video-on-demand services), satellite communications, and distributed storage (e.g., data centers). In this dissertation, we investigate unicast-index-coding (UIC) problems, where each message is requested by only one receiver, each receiver requests only one message and each receiver has a subset of messages except its requested messages in side-information. These problems can be modeled by directed graphs. We apply graph-based approaches to the two types of the UIC problems based on the number of senders, namely single-sender unicast-index-coding (SSUIC) and two-sender unicast-index-coding (TSUIC) problems. In SSUIC, we propose a new scheme, called interlinked-cycle-cover (ICC) scheme, that exploits interlinked-cycle (IC) structures (a form of overlapping cycles that generalizes cliques and cycles) in directed graphs. This scheme provides an upper bound on the optimal broadcast rate for any SSUIC instance, and construct a linear index code. We prove that the ICC scheme is optimal over all linear and non-linear index codes for a class of infinitely many digraphs. We show that the ICC scheme can outperform existing schemes for some SSUIC instances with six receivers. Further, we extend the IC structures and the scheme. We find that the ICC scheme (including the extended scheme) provides the optimal broadcast rates for all message alphabet sizes for all SSUIC instances up to five receivers except eight problems. In TSUIC, firstly, we extend the existing SSUIC graph-based schemes, namely clique-cover, cycle-cover, and local-chromatic-number schemes to TSUIC. Then we investigate the TSUIC problems by its structural characterization. By considering three sub-problems of a TSUIC problem based on whether the receivers' requests are available at only one sender or both senders, we formulate its optimal broadcast rate as a function of the optimal broadcast rates of its three sub-problems. Furthermore, for this formulation, we extend the notion of confusion graphs and graph coloring to TSUIC. We characterize a class of infinitely many TSUIC instances where a certain type of side-information can be removed without affecting their optimal broadcast rates.
Jeon, Hyun-Ho. "Enhanced video coding based on video analysis and metadata information." Thesis, 2007. http://hdl.handle.net/1828/194.
Повний текст джерелаGupta, Anindya. "Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes." Thesis, 2016. http://etd.iisc.ac.in/handle/2005/2999.
Повний текст джерелаGupta, Anindya. "Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes." Thesis, 2016. http://hdl.handle.net/2005/2999.
Повний текст джерелаTabatabaei-Yazdi, Seyed. "Design and Analysis of Low Complexity Network Coding Schemes." Thesis, 2011. http://hdl.handle.net/1969.1/128797.
Повний текст джерелаChaudhry, Mohammad. "Network Coding in Distributed, Dynamic, and Wireless Environments: Algorithms and Applications." Thesis, 2011. http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10529.
Повний текст джерелаКниги з теми "Index coding with restricted information"
Arbabjolfaei, Fatemeh, and Young-Han Kim. Fundamentals of Index Coding. Now Publishers, 2018.
Знайти повний текст джерелаFanburg, Jonathan, ed. 5210 Pediatric Obesity Clinical Decision Support Chart. 2nd ed. American Academy of Pediatrics, 2014. http://dx.doi.org/10.1542/9781581108941.
Повний текст джерелаHassink, Sandra G., ed. 5210 Pediatric Obesity Clinical Decision Support Chart. American Academy of Pediatrics, 2008. http://dx.doi.org/10.1542/9781581104219.
Повний текст джерелаЧастини книг з теми "Index coding with restricted information"
Byrne, Eimear, and Marco Calderini. "Index Coding, Network Coding and Broadcast with Side-Information." In Network Coding and Subspace Designs, 247–93. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70293-3_10.
Повний текст джерелаKuckelberg, Alexander. "The Matrix-Index Coding Approach to Efficient Navigation in Persistent Object Stores." In Fundamentals of Information Systems, 99–112. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5137-9_7.
Повний текст джерелаChen, Yangjun. "An Efficient and Effective Index Structure for Query Evaluation in Search Engines." In Encyclopedia of Information Science and Technology, Fourth Edition, 7995–8005. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2255-3.ch695.
Повний текст джерелаRahman, Hakikur. "Role of ICT in Establishing E-Government System for Disadvantaged Communities." In Information Communication Technologies, 1482–93. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59904-949-6.ch101.
Повний текст джерелаMontemurro, Marcelo A. "A Generalization of the Zipf-Mandelbrot Law in Linguistics." In Nonextensive Entropy. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780195159769.003.0025.
Повний текст джерелаТези доповідей конференцій з теми "Index coding with restricted information"
Thomas, Anoop, and B. Sundar Rajan. "Index Coding with Restricted Information (ICRI) and Interference Alignment." In 2017 IEEE Global Communications Conference (GLOBECOM 2017). IEEE, 2017. http://dx.doi.org/10.1109/glocom.2017.8254152.
Повний текст джерелаSadeghi, Parastoo, Fatemeh Arbabjolfaei, and Young-Han Kim. "Distributed index coding." In 2016 IEEE Information Theory Workshop (ITW). IEEE, 2016. http://dx.doi.org/10.1109/itw.2016.7606850.
Повний текст джерелаPorter, Alexandra, and Mary Wootters. "Embedded Index Coding." In 2019 IEEE Information Theory Workshop (ITW). IEEE, 2019. http://dx.doi.org/10.1109/itw44776.2019.8988921.
Повний текст джерелаArbabjolfaei, Fatemeh, Bernd Bandemer, and Young-Han Kim. "Index coding via random coding." In 2014 Iran Workshop on Communication and Information Theory (IWCIT). IEEE, 2014. http://dx.doi.org/10.1109/iwcit.2014.6842484.
Повний текст джерелаTehrani, Arash Saber, Alexandros G. Dimakis, and Michael J. Neely. "Bipartite index coding." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283853.
Повний текст джерелаBrahma, Siddhartha, and Christina Fragouli. "Pliable index coding." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283912.
Повний текст джерелаKao, David T. H., Mohammad Ali Maddah-Aliy, and A. Salman Avestimehr. "Blind index coding." In 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282880.
Повний текст джерелаMareedu, Vijaya Kumar, and Prasad Krishnan. "Uniprior index coding." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8007093.
Повний текст джерелаNarayanan, Varun, Vinod M. Prabhakaran, Jithin Ravi, Vivek K. Mishra, Bikash K. Dey, and Nikhil Karamchandani. "Private Index Coding." In 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437353.
Повний текст джерелаLiu, Yucheng, Parastoo Sadeghi, Fatemeh Arbabjolfaei, and Young-Han Kim. "Simplified Composite Coding for Index Coding." In 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437663.
Повний текст джерелаЗвіти організацій з теми "Index coding with restricted information"
Mirel, Lisa, Cindy Zhang, Christine Cox, Ye Yeats, Félix Suad El Burai, and Golden Cordell. Comparative analysis of the National Health and Nutrition Examination Survey public-use and restricted-use linked mortality files. Centers for Disease Control and Prevention (U.S.), May 2021. http://dx.doi.org/10.15620/cdc:104744.
Повний текст джерела