Gotowa bibliografia na temat „Single-sender index coding problems”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Single-sender index coding problems”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Single-sender index coding problems"
Thapa, Chandra, Lawrence Ong, Sarah Johnson i Min Li. "Structural Characteristics of Two-Sender Index Coding". Entropy 21, nr 6 (21.06.2019): 615. http://dx.doi.org/10.3390/e21060615.
Pełny tekst źródłaArunachala, Chinmayananda, Vaneet Aggarwal i B. Sundar Rajan. "Optimal Linear Broadcast Rates of Some Two-Sender Unicast Index Coding Problems". IEEE Transactions on Communications 67, nr 6 (czerwiec 2019): 3965–77. http://dx.doi.org/10.1109/tcomm.2019.2907538.
Pełny tekst źródłaOng, Lawrence, Chin Keong Ho i Fabian Lim. "The Single-Uniprior Index-Coding Problem: The Single-Sender Case and the Multi-Sender Extension". IEEE Transactions on Information Theory 62, nr 6 (czerwiec 2016): 3165–82. http://dx.doi.org/10.1109/tit.2016.2555950.
Pełny tekst źródłaZech, Michael, Katharina Poustka, Sylvia Boesch, Riccardo Berutti, Tim M. Strom, Wolfgang Grisold, Werner Poewe i Juliane Winkelmann. "SOX5-Null Heterozygous Mutation in a Family with Adult-Onset Hyperkinesia and Behavioral Abnormalities". Case Reports in Genetics 2017 (2017): 1–6. http://dx.doi.org/10.1155/2017/2721615.
Pełny tekst źródłaKrylov, Sergey A., Gleb I. Zagrebin, Anton V. Dvornikov, Dmitriy S. Loginov i Ivan E. Fokin. "The automation of processes of atlas mapping". Abstracts of the ICA 1 (15.07.2019): 1–2. http://dx.doi.org/10.5194/ica-abs-1-193-2019.
Pełny tekst źródłaFidler, Andrew E., Kees van Oers, Piet J. Drent, Sylvia Kuhn, Jakob C. Mueller i Bart Kempenaers. "Drd4 gene polymorphisms are associated with personality variation in a passerine bird". Proceedings of the Royal Society B: Biological Sciences 274, nr 1619 (maj 2007): 1685–91. http://dx.doi.org/10.1098/rspb.2007.0337.
Pełny tekst źródłaBorgundvaag, B., W. Khuu, S. L. McLeod i T. Gomes. "LO11: Opiate prescribing in Ontario emergency departments". CJEM 19, S1 (maj 2017): S31. http://dx.doi.org/10.1017/cem.2017.73.
Pełny tekst źródłaMitchell, Ron B., Sanford M. Archer, Stacey L. Ishman, Richard M. Rosenfeld, Sarah Coles, Sandra A. Finestone, Norman R. Friedman i in. "Clinical Practice Guideline: Tonsillectomy in Children (Update)". Otolaryngology–Head and Neck Surgery 160, nr 1_suppl (luty 2019): S1—S42. http://dx.doi.org/10.1177/0194599818801757.
Pełny tekst źródłaMitchell, Ron B., Sanford M. Archer, Stacey L. Ishman, Richard M. Rosenfeld, Sarah Coles, Sandra A. Finestone, Norman R. Friedman i in. "Clinical Practice Guideline: Tonsillectomy in Children (Update)—Executive Summary". Otolaryngology–Head and Neck Surgery 160, nr 2 (luty 2019): 187–205. http://dx.doi.org/10.1177/0194599818807917.
Pełny tekst źródłaRozprawy doktorskie na temat "Single-sender index coding problems"
Chinmayananda, A. "Optimal Code Constructions for Some Multi-sender Index Coding Problems". Thesis, 2019. https://etd.iisc.ac.in/handle/2005/5055.
Pełny tekst źródłaThapa, Chandra. "Graphical approaches to single-sender and two-sender index coding". Thesis, 2018. http://hdl.handle.net/1959.13/1388175.
Pełny tekst źródłaIn 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.
Streszczenia konferencji na temat "Single-sender index coding problems"
Chinmayananda, A., i B. Sundar Rajan. "Optimal Scalar Linear Index Codes for Some Two-Sender Unicast Index Coding Problems". W 2018 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2018. http://dx.doi.org/10.23919/isita.2018.8664234.
Pełny tekst źródłaArunachala, Chinmayananda, Vaneet Aggarwal i B. Sundar Rajan. "Optimal Broadcast Rate of a Class of Two-Sender Unicast Index Coding Problems". W 2019 IEEE Information Theory Workshop (ITW). IEEE, 2019. http://dx.doi.org/10.1109/itw44776.2019.8989283.
Pełny tekst źródłaVaddi, Mahesh Babu, i B. Sundar Rajan. "On the Broadcast Rate and Fractional Clique Cover of Single Unicast Index Coding Problems". W 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613453.
Pełny tekst źródła