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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 种 纸本馆藏

日期分布

学科分类号

160 篇 工学
- 143 篇 电气工程
- 105 篇 计算机科学与技术...
- 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

语言

163 篇 英文
5 篇 其他

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

共 168 条记录，以下是51-60 订阅

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

详细简洁

排序：

Pliable index coding with Restricted Decoding Sets

Pliable Index Coding with Restricted Decoding Sets

引用

2024 Information Theory Workshop

作者： Wu, Junping Ong, Lawrence Johnson, Sarah Tan, Jin Yeong Univ Newcastle Newcastle NSW Australia

ISBN: (纸本)9798350348941;9798350348934

Pliable index coding studies flexible communication networks where each receiver just needs to receive any message that it does not already have. In this work, we consider a more practical but restricted scenario where each receiver wants any message it does not have from a particular subset of messages. We first adapt coding schemes from pliable index coding to this new restricted pliable index coding setting. We show that the adapted scheme is optimal under certain conditions. We simplify the computational complexity when constructing coding schemes for restricted pliable index coding from exponential to linear. We also construct two new coding schemes for the restricted setting, which can outperform the adapted scheme.

关键词： index coding pliable index coding restricted pliable index coding

来源：评论

学校读者我要写书评

暂无评论

Optimal User Pairing in Cache-based NOMA Systems with index coding

Optimal User Pairing in Cache-based NOMA Systems with Index ...

引用

IEEE International Conference on Communications (IEEE ICC)

作者： Fu, Yaru Shum, Kenneth W. Sung, Chi Wan Liu, Ye Singapore Univ Technol & Design Informat Syst Technol & Design Singapore Singapore Chinese Univ Hong Kong Shenzhen Sch Sci & Engn Shenzhen Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China Univ Oxford Dept Engn Sci Oxford England

ISBN: (纸本)9781538680889

The user pairing problem for cache-based time-slotted non-orthogonal multiple access (NOMA) system with index coding is investigated. During each time slot, the packets of two users are scheduled at the base station. In accordance with different cache information of the scheduled users, either superposition coding or index coding is applied for base station transmission. For some specific case, the superior performance on the aspect of power consumption of index coding compared to that of superposition coding is analyzed. Besides, the power saving of our design system when compared to that of the NOMA system with pure superposition coding is also demonstrated in a mathematical way. Subsequently, we show that the original user scheduling problem can be transformed in quadratic time into a minimum weight perfect matching problem of an undirected graph, which can be solved with time complexity O(K-3) where K is the number of users. Based on this transformation, the feasibility of any given system is analyzed. Furthermore, we formulate the minimum weight perfect matching problem as an integer linear problem and solve it by integer linear programming. Numerical results validate the performance gains of our proposed system from the aspects of total transmit power and outage probability.

关键词： Non-orthogonal multiple access (NOMA) caching superposition coding index coding scheduling minimum weight perfect matching

来源：评论

学校读者我要写书评

暂无评论

Golden-Coded index coding

Golden-Coded Index Coding

引用

IEEE International Symposium on Information Theory (ISIT)

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

ISBN: (纸本)9781509040964

We study the problem of constructing good space-time codes for broadcasting K independent messages over a MEMO network to L users, where each user demands all the messages and already has a subset of messages as side information. As a first attempt, we consider the 2 x 2 case and propose golden-coded index coding by partitioning the golden codes into K subcodes, one for each message. The proposed scheme is shown to have the property that for any side information configuration, the minimum determinant of the code increases exponentially with the amount of information contained in the side information.

关键词： Lattice codes index coding broadcast channels side information space-time codes IMMO

来源：评论

学校读者我要写书评

暂无评论

Lattice index coding for the Broadcast Channel

Lattice Index Coding for the Broadcast Channel

引用

IEEE Information Theory Workshop (ITW)

作者： Natarajan, Lakshmi Hong, Yi Viterbo, Emanuele Monash Univ Dept Elect & Comp Syst Engn Clayton Vic 3800 Australia

ISBN: (纸本)9781479955268

The index coding problem involves a sender with K messages to be transmitted across a broadcast channel, and a set of receivers each of which demands a subset of the K messages while having prior knowledge of a different subset as side information. We consider the specific instance of noisy index coding where the broadcast channel is Gaussian and every receiver demands all the messages from the source. We construct lattice index codes for this channel by encoding the K messages individually using K modulo lattice constellations and transmitting their sum modulo a shaping lattice. We introduce a design metric called side information gain that measures the advantage of a code in utilizing the side information at the receivers, and hence its quality as an index code. Based on the Chinese remainder theorem, we then construct lattice index codes for the Gaussian broadcast channel. Among all lattice index codes constructed using any densest lattice of a given dimension, our codes achieve the maximum side information gain.

关键词： Chinese remainder theorem Gaussian broadcast channel index coding lattice codes side information

来源：评论

学校读者我要写书评

暂无评论

Blind index coding

Blind Index Coding

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Kao, David T. H. Maddah-Ali, Mohammad Ali Avestimehr, A. Salman Univ Southern Calif Los Angeles CA 90089 USA Bell Labs Holmdel NJ 07733 USA

ISBN: (纸本)9781467377041

We introduce the "blind index coding" (BIC) problem, which generalizes the classic index coding problem by considering a sender that has some uncertainty about the side information that is available at each receiver. This problem naturally arises in wireless networks in which users obtain their side information through wireless channels with errors that may be unknown to the sender. For the proposed BIC problem, we develop a new general outer bound by first proving it for the 3-user case and then generalizing its construction to K users. The proof of the outer bound relies on developing a key lemma that uses a strong data processing inequality to account for the sender's uncertainty. We also propose a hybrid coding scheme that XORs random combinations of bits from a subset of messages with uncoded bits of other messages in order to blindly exploit side information, and illustrate its gain.

关键词： index coding Network coding Uncoded Transmission

来源：评论

学校读者我要写书评

暂无评论

Optimal Scalar Linear Codes for Single Unicast Neighboring Interference Symmetric index coding

Optimal Scalar Linear Codes for Single Unicast Neighboring I...

引用

IEEE International Conference on Communications (ICC)

作者： Ambadi, Niranjana Rajan, B. Sundar Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

ISBN: (纸本)9781467389990

An index coding problem is symmetric if relative to its position, each receiver has identical sets of wanted messages and side information. We provide an algorithm to construct an optimal length scalar linear code for single unicast symmetric index coding problems with neighboring interference. First we compute the minimum number of independent dimensions required to avoid interference and show this number to be equal to the minimum possible length of a scalar linear index code. A code construction is provided that gives the optimal scalar linear index code. Further, we have identified the one-sided neighboring antidotes single unicast symmetric index coding problem as a special case of the neighboring interference problem and have constructed an optimal scalar linear index code for the former.

关键词： index coding Symmetric index coding Interference Alignment

来源：评论

学校读者我要写书评

暂无评论

Lossless vector-quantised index coding with index-Pattern coding Scheme

Lossless vector-quantised index coding with Index-Pattern Co...

引用

Conference on Technologies and Applications of Artificial Intelligence (TAAI)

作者： Liu, Y. C. Lee, G. H. Taur, J. S. Chi, L. P. Natl Chung Hsing Univ Dept Elect Engn Taichung 40227 Taiwan Aeronaut Syst Res Div Taichung Taiwan

ISBN: (纸本)9781479925285

In this paper, an efficient new on-line lossless compression algorithm is presented to encode image VQ. The proposed coding technique exploits the correlation of neighboring index-pairs not in the original vector-quantized index map but in the principal index-pattern table which is generated from the two dimensional histogram of index-patterns in the training stage. Simulation results indicate that the new algorithm improve coding efficiency without introducing any extra loss of information. Moreover, the new algorithm is simpler and more efficient.

关键词： image processing Vecter Quantization index coding

来源：评论

学校读者我要写书评

暂无评论

A Matrix Completion Approach to Linear index coding Problem

A Matrix Completion Approach to Linear Index Coding Problem

引用

IEEE Information Theory Workshop (ITW)

作者： Esfahanizadeh, Homa Lahouti, Farshad Hassibi, Babak Univ Tehran Coll Engn Sch Elect & Comp Engn Tehran Iran CALTECH Dept Elect Engn Pasadena CA 91125 USA

ISBN: (纸本)9781479959990

In this paper, a general algorithm is proposed for rate analysis and code design of linear index coding problems. Specifically a solution for minimum rank matrix completion problem over finite fields representing the linear index coding problem is devised in order to find the optimum transmission rate given vector length and size of the field. The new approach can be applied to both scalar and vector linear index coding.

关键词： index coding Minimum Rank Matrix Completion over Finite Fields

来源：评论

学校读者我要写书评

暂无评论

A Rate-Distortion Approach to index coding

A Rate-Distortion Approach to Index Coding

引用

Information Theory and Applications Workshop (ITA)

作者： Unal, Sinem Wagner, Aaron B. Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

ISBN: (纸本)9781479935901

We view the index coding problem with an arbitrary number of source bits and potentially overlapping demands as an instance of rate-distortion with multiple receivers, each with distinct side information. By applying network-information-theoretic tools, we find the optimal rate for the special case in which each source bit is present at either all of the decoders, none of the decoders, all but one of the decoders, or all but two of the decoders.

关键词： network coding radio receivers rate distortion theory arbitrary source bits number decoder distinct side information index coding multiple receiver network information theory tools rate distortion approach Decoding Educational institutions Encoding indexes Rate-distortion Receivers

来源：评论

学校读者我要写书评

暂无评论

Embedded index coding

Embedded Index Coding

引用

IEEE Information Theory Workshop (ITW)

作者： Porter, Alexandra Wootters, Mary Stanford Univ Dept Comp Sci Stanford CA 94305 USA Stanford Univ Dept Elect Engn Stanford CA 94305 USA

ISBN: (纸本)9781538669006

Motivated by applications in distributed storage and distributed computation, we introduce embedded index coding (EIC). EIC is a type of distributed index coding in which nodes in a distributed system act as both broadcast senders and receivers of information. We show how linear embedded index coding is related to linear index coding in general, and give characterizations and bounds on the communication costs of optimal embedded index codes. We also define task-based EIC, in which there is only one sender node responsible for transmitting a block to a particular receiving node. Task-based EIC is more computationally tractable and has advantages in applications such as distributed storage, in which senders may complete their broadcasts at different times. Finally, we give heuristic algorithms for approximating optimal linear embedded index codes, and demonstrate empirically that these algorithms perform well.

关键词： indexes Encoding Task analysis Receivers Computational modeling Peer-to-peer computing Approximation algorithms index coding distributed storage coded computation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：