检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

115 篇 期刊文献
52 篇 会议
1 篇 学位论文

馆藏范围

168 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

159 篇 工学
- 143 篇 电气工程
- 104 篇 计算机科学与技术...
- 62 篇 信息与通信工程
- 12 篇 交通运输工程
- 3 篇 软件工程
- 2 篇 电子科学与技术（可...
- 2 篇 控制科学与工程
- 1 篇 仪器科学与技术
53 篇 理学
- 50 篇 数学
- 3 篇 物理学
3 篇 医学
- 3 篇 临床医学
2 篇 管理学
- 2 篇 图书情报与档案管...

主题

168 篇 index coding
46 篇 network coding
22 篇 indexes
22 篇 side information
18 篇 encoding
17 篇 coded caching
15 篇 receivers
9 篇 minrank
8 篇 interference ali...
8 篇 servers
7 篇 caching
6 篇 distributed stor...
5 篇 capacity
5 篇 error correction
5 篇 lattice codes
5 篇 graph theory
5 篇 codes
5 篇 non-orthogonal m...
5 篇 unicast
5 篇 broadcast channe...

机构

12 篇 indian inst sci ...
7 篇 indian inst sci ...
5 篇 monash univ dept...
5 篇 univ newcastle s...
5 篇 city univ hong k...
4 篇 texas a&m univ d...
4 篇 acad coll tel av...
3 篇 univ naples fede...
3 篇 indian inst tech...
3 篇 univ new south w...
3 篇 univ utah dept e...
3 篇 indian inst sci ...
3 篇 univ southern ca...
3 篇 nanyang technol ...
3 篇 mediatek inc hsi...
3 篇 cornell univ sch...
3 篇 natl taipei univ...
2 篇 new jersey inst ...
2 篇 univ south austr...
2 篇 univ calif irvin...

作者

24 篇 rajan b. sundar
10 篇 ong lawrence
8 篇 viterbo emanuele
8 篇 natarajan lakshm...
7 篇 sung chi wan
7 篇 elia petros
7 篇 huang yu-chih
7 篇 hong yi
6 篇 thomas anoop
6 篇 johnson sarah j.
5 篇 karat nujoom sag...
5 篇 pachat jesy
5 篇 haviv ishay
5 篇 mahesh anjana a.
4 篇 gomez-vilardebo ...
4 篇 skachek vitaly
4 篇 tulino antonia m...
4 篇 mostafa salwa
4 篇 deepthi p. p.
4 篇 llorca jaime

语言

162 篇 英文
5 篇 其他

检索条件"主题词=Index coding"

共 168 条记录，以下是61-70 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Layered Space-Time index coding

Layered Space-Time Index Coding

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Huang, Yu-Chih Hong, Yi Viterbo, Emanuele Natarajan, Lakshmi Natl Taipei Univ Dept Commun Engn New Taipei Taiwan Monash Univ Dept Elect & Comp Syst Engn Clayton Vic Australia Indian Inst Technol Hyderabad Dept Elect Engn Hyderabad India

ISBN: (纸本)9781538647813

Multicasting K independent messages via multiple-input multiple-output (MIMO) channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered space-time index coding (LSTIC) from a large class of space-time block codes (STBCs), including perfect STBCs, is proposed. We analyze the proposed LSTIC technique and show that it provides minimum determinant gains that are exponential in the amount of information contained in the side information for any possible side information at the receivers. When constructed over a perfect STBC, the proposed LSTIC is itself a perfect STBC and hence enjoys many desired properties.

关键词： index coding broadcast channels side information space-time block codes MIMO channel

来源：评论

学校读者我要写书评

暂无评论

Optimal index coding with Min-Max Probability of Error over Fading Channels 26

Optimal Index Coding with Min-Max Probability of Error over ...

引用

26th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

作者： Thomas, Anoop Kavitha, R. Chandramouli, A. Rajan, B. Sundar Indian Inst Sci Bengaluru India

ISBN: (纸本)9781467367820

An index coding scheme in which the source (transmitter) transmits symbols over a wireless fading channel is considered. index codes with the transmitter using minimum number of transmissions are known as optimal index codes. Different optimal index codes give different performances in terms of probability of error in a fading environment and this also varies from receiver to receiver. In this paper we deal with optimal index codes which minimizes the maximum probability of error among all the receivers. We identify a criterion for optimal index codes that minimizes the maximum probability of error among all the receivers. For a special class of index coding problems, we give an algorithm to identify optimal index codes which minimize the maximum error probability. We illustrate our techniques and claims with simulation results leading to conclude that a careful choice among the optimal index codes will give a considerable gain in fading channels.

关键词： index coding side information fading broadcast channels

来源：评论

学校读者我要写书评

暂无评论

Perfectly Secure index coding

Perfectly Secure Index Coding

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Mojahedian, Mohammad Mandi Aref, Mohammad Reza Gohari, Amin Sharif Univ Technol Informat Syst & Secur Lab Tehran *** Iran

ISBN: (纸本)9781467377041

In this paper, we investigate the index coding problem in the presence of an eavesdropper. Messages are to be sent from one transmitter to a number of legitimate receivers who have side information about the messages, and share a set of secret keys with the transmitter. To do this, the transmitter communicates to the legitimate receivers the public code C, which is also heard by the eavesdropper. We assume perfect secrecy, meaning that the eavesdropper should not he able to retrieve any information about the message set from the public communication. We study the minimum key lengths for zero error and perfectly secure index coding problem. On one hand, this problem is a generalization of the index coding problem (and thus a difficult one). On the other hand, it is a generalization of the Shannon's cipher system. We show that a generalization of Shannon's one-time pad strategy is optimal up to a multiplicative constant, meaning that it obtains the entire boundary of the cone formed by looking at the secure rate region from the origin. This shows the optimality of the generalized one-time pad for minimizing the consumption of shared secret keys per message bits, when public communication is free (the transmitter is not charged for the rate of the public communication). Finally, we consider relaxation of the perfect secrecy and zero-error constraints to weak secrecy and asymptotically vanishing probability of error, and provide a secure version of the result, obtained by Langherg and Effros, on the equivalence of zero-error and is an element of-error regions in the conventional index coding problem.

关键词： index coding Shannon cipher system common and private keys perfect secrecy strong secrecy weak secrecy zero-error communication is an element of-error communication.

来源：评论

学校读者我要写书评

暂无评论

A Linear-Time Grouping Algorithm for F-RANs with index coding and Cache-Aided NOMA

A Linear-Time Grouping Algorithm for F-RANs with Index Codin...

引用

IEEE International Conference on Communications (ICC)

作者： Guo, Yongna Mostafa, Salwa Zou, Jun Sung, Chi Wan City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China Nanjing Univ Sci & Technol Sch Elect & Opt Engn Nanjing Peoples R China

ISBN: (纸本)9781728171227

Both index coding and non-orthogonal multiple access (NOMA) are useful techniques for a transmitter to send information to multiple cache-enabled receivers. In former works, either index coding or cache-aided NOMA is applied in the system, while the combination of index coding and cache-aided NOMA has not been fully investigated. This work is the first attempt to integrate these two techniques. A two-phase transmission algorithm is proposed to first partition receivers into index coding groups and next pair these groups up for superposition coding. Cache-aided interference cancellation (CIC) is employed at the receiver. This new method is applied to a cache-enabled fog radio access network (F-RAN). Besides, a distinct-file caching scheme with imbalanced cache size at fog access points (F-APs) is proposed. For this particular caching scheme, the two-phase algorithm can be fine-tuned in a way so that its time complexity becomes linear in the number of F-APs, which is very fast and particularly desirable from a practical viewpoint. Furthermore, simulation results show that our proposed method can significantly reduce the power consumption for transmissions over the fronthaul link of the F-RAN.

关键词： Non-orthogonal multiple access cache-aided interference cancellation index coding power minimization

来源：评论

学校读者我要写书评

暂无评论

A Fast Matrix Completion Method for index coding 25

A Fast Matrix Completion Method for Index Coding

引用

25th European Signal Processing Conference (EUSIPCO)

作者： Asadi, Ehsan Aziznejad, Shayan Amerimehr, Mohammad H. Amini, Arash Sharif Univ Technol Dept Elect Engn Tehran Iran Iran Telecommun Res Ctr Tehran Iran

ISBN: (纸本)9780992862671

We investigate the problem of index coding, where a sender transmits distinct packets over a shared link to multiple users with side information. The aim is to find an encoding scheme (linear combinations) to minimize the number of transmitted packets, while providing each user with sufficient amount of data for the recovery of the desired parts. It has been shown that finding the optimal linear index code is equivalent to a matrix completion problem, where the observed elements of the matrix indicate the side information available for the users. This modeling results in an incomplete square matrix with all ones on the main diagonal (and some other parts), which needs to be completed with minimum rank. Unfortunately, this is a case in which conventional matrix completion techniques based on nuclear-norm minimization are proved to fail [Huang, Rouayheb 2015]. Instead, an alternating projection (the AP algorithm) method is proposed in [Huang, Rouayheb 2015]. In this paper, in addition to proving the convergence of the AP algorithm under certain conditions, we introduce a modification which considerably improves the run time of the method.

关键词： Alternating projection coded caching index coding matrix completion network caching rank minimization

来源：评论

学校读者我要写书评

暂无评论

Linear index coding via Graph Homomorphism

Linear Index Coding via Graph Homomorphism

引用

2nd International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Ebrahimi, Javad B. Siavoshani, Mahdi Jafari Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China Sharif Univ Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)9781479967735

In [1], [2] it is shown that the minimum broadcast rate of a linear index code over a finite field F-q is equal to an algebraic invariant of the underlying digraph, called minrank(q). In [3], it is proved that for F-2 and any positive integer k, minrank(q) (G) <= k if and only if there exists a homomorphism from the complement of the graph G to the complement of a particular undirected graph family called "graph family {G(k)}". As observed in [2], by combining these two results one can relate the linear index coding problem of undirected graphs to the graph homomorphism problem. In [4], a direct connection between linear index coding problem and graph homomorphism problem is introduced. In contrast to the former approach, the direct connection holds for digraphs as well and applies to any field size. More precisely, in [4], a graph family {H-k(q)} has been introduced and shown that whether or not the scalar linear index of a digraph G is less than or equal to k is equivalent to the existence of a graph homomorphism from the complement of G to the complement of H-k(q). In this paper, we first study the structure of the digraphs H-k(q) defined in [4]. Analogous to the result of [2] about undirected graphs, we prove that H-k(q)'s are vertex transitive digraphs. Using this, and by applying a lemma of Hell and Nesetril [5], we derive a class of necessary conditions for digraphs G to satisfy lind(q) (G) <= k. Particularly, we obtain new lower bounds on lind(q) (G). Our next result is about the computational complexity of scalar linear index of a digraph. It is known that deciding whether the scalar linear index of an undirected graph is equal to k or not is NP-complete for k >= 3 and is polynomially decidable for k = 1, 2 [3]. For digraphs, it is shown in [6] that for the binary alphabet, the decision problem for k = 2 is NP-complete. We use graph homomorphism framework to extend this result to arbitrary alphabet.

关键词： index coding linear index coding graph homomorphism minrank of a graph computational complexity of the minrank

来源：评论

学校读者我要写书评

暂无评论

A New index coding Scheme Exploiting Interlinked Cycles

A New Index Coding Scheme Exploiting Interlinked Cycles

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Thapa, Chandra Ong, Lawrence Johnson, Sarah J. Univ Newcastle Sch Elect Engn & Comp Sci Newcastle NSW Australia

ISBN: (纸本)9781467377041

We study the index coding problem in the unicast message setting, i.e., where each message is requested by one unique receiver. This problem can be modeled by a directed graph. We propose a new scheme called interlinked cycle cover, which exploits interlinked cycles in the directed graph, for designing index codes. This new scheme generalizes the existing clique cover and cycle cover schemes. We prove that for a class of infinitely many digraphs with messages of any length, interlinked cycle cover provides an optimal index code. Furthermore, the index code is linear with linear time encoding complexity.

关键词： index coding unicast optimal broadcast rate linear codes interlinked cycles

来源：评论

学校读者我要写书评

暂无评论

Optimal Error Correcting index Codes for Two Classes of index coding Problems 52

Optimal Error Correcting Index Codes for Two Classes of Inde...

引用

52nd Annual Conference on Information Sciences and Systems (CISS)

作者： Vaddi, Mahesh Babu Rajan, B. Sundar Indian Inst Sci Dept Elect Commun Engn Bengaluru 560012 KA India

ISBN: (纸本)9781538605790

A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has K receivers, the k th receiver R-k wanting the k th message x(k) and having the interference D messages after and U messages before its desired message. Maleki, Cadambe and Jafar studied the SUICP-SNI setting. In our previous work, we gave the capacity and optimal index codes for SUICP-SNI with K messages, D interfering messages after and U - gcd (K;D + 1) - 1 interfering messages before the desired message. In this paper, we present optimal length error-correcting index codes for these index coding problems, assuming that the transmissions are error prone. Thapa, Ong and Johnson defined the interlinked cycle (IC) structure, that generalizes cycles and cliques. Interlinked-cycle-cover (ICC) scheme, that leverages IC structures in digraphs to construct scalar linear index codes was proposed and a class of infinitely many digraphs where the proposed scalar linear codes based on ICC scheme are optimal were characterized. In this paper, we present optimal length error-correcting index codes for this class of infinitely many digraphs, assuming that the transmissions are error prone.

关键词： index coding Interference Alignment

来源：评论

学校读者我要写书评

暂无评论

Fast index coding Algorithms for Multi-rate Wireless Communications

Fast Index Coding Algorithms for Multi-rate Wireless Communi...

引用

21st Iranian Conference on Electrical Engineering (ICEE)

作者： Javanmard, Zeinab Sadat Jamshidi, Azizolah Hadad, Alireza Keshavarz Shiraz Univ Sch Elect & Comp Engn Shiraz Iran

ISBN: (纸本)9781467356343

index coding is a branch of network coding that optimizes ARQ mechanism over a broadcast channel. In this technique each client (destination) attempts to overhear every transmitted packet and cashes the side information then it notifies the server (source) about which packets it has and which it needs. Afterwards, the server will try to provide the requested information by the clients with a small number of transmissions using some network coding methods. In a wireless multi-rate communication the delay time until the last user receives its packets and the average waiting time for each user decoding its packets must be taken into account by the server. These parameters depend on the coding schemes and the arrangement of the packets. In this paper, we propose two heuristic algorithms based on weighted graph coloring (WGC) and weighted color saving (WCS) methods to improve desired metric in a multi-rate channel. Our simulation results indicate that WGC algorithm can reduce the transmission time up to 30% compared to the traditional graph coloring algorithms. Also, it reduces the average waiting time significantly. Further, we propose another novel coloring algorithm, called WCS, that has shorter running time compared to WGC.

关键词： index coding multi-rate network transmission time graph coloring

来源：评论

学校读者我要写书评

暂无评论

Nonlinear index coding Outperforming the Linear Optimum

Nonlinear Index Coding Outperforming the Linear Optimum

引用

48th Annual IEEE Symposium on Foundations of Computer Science

作者： Lubetzky, Eyal Stav, Uri Microsoft Res Theory Grp Redmond WA 98052 USA Tel Aviv Univ Raymond & Beverly Sackler Fac Exact Sci Sch Comp Sci IL-69978 Ramat Aviv Israel

ISBN: (纸本)0769530109

The following source coding problem was introduced by Birk and Kol: a sender holds a word x is an element of {0, 1}(n), and wishes to broadcast a codeword to n receivers, R-1, ... , R-n. The receiver R-i is interested in x(i), and has prior side information comprising some subset of the n bits. This corresponds to a directed graph G on n vertices, where i(j) is an edge iff R-i knows the bit x(j). An index code for G is an encoding scheme which enables each R-i to always reconstruct x(i), given his side information. The minimal word length of an index code was studied by Bar-Yossef, Birk, Jayram, and Kol (FOCS'06). They introduced a graph parameter, minrk(2) (G), which completely characterizes the length of an optimal linear index code for G. They showed that in various cases linear codes attain the optimal word length, and conjectured that linear index coding is in fact always optimal. In this work, we disprove the main conjecture of Bar-Yossef, Birk, Jayram, and Kol in the following strong sense: for any epsilon > 0 and sufficiently large n, there is an n-vertex graph G so that every linear index code for G requires codewords of length at least n(1-epsilon), and yet a nonlinear index code for G has a word length of n(epsilon). This is achieved by an explicit construction, which extends Alon's variant of the celebrated Ramsey construction of Frankl and Wilson. In addition, we study optimal index codes in various, less restricted, natural models, and prove several related properties of the graph parameter minrk(G).

关键词： index coding linear and nonlinear source coding Ramsey constructions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共17页 << < 3 4 5 6 7 8 9 10 11 12 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：