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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,623 篇 会议
972 篇 期刊文献
8 篇 学位论文
3 册 图书

馆藏范围

5,606 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,701 篇 工学
- 1,247 篇 电气工程
- 973 篇 计算机科学与技术...
- 515 篇 信息与通信工程
- 170 篇 软件工程
- 99 篇 电子科学与技术（可...
- 68 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 17 篇 交通运输工程
- 10 篇 机械工程
- 8 篇 测绘科学与技术
- 6 篇 光学工程
- 5 篇 网络空间安全
- 4 篇 力学（可授工学、理...
- 4 篇 生物医学工程（可授...
- 3 篇 材料科学与工程（可...
- 3 篇 航空宇航科学与技...
- 2 篇 石油与天然气工程
351 篇 理学
- 260 篇 数学
- 60 篇 物理学
- 21 篇 系统科学
- 6 篇 统计学（可授理学、...
- 4 篇 地球物理学
- 4 篇 生物学
271 篇 文学
- 271 篇 新闻传播学
114 篇 医学
- 111 篇 临床医学
- 9 篇 特种医学
59 篇 管理学
- 55 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
9 篇 军事学
- 9 篇 军队指挥学
2 篇 教育学
- 2 篇 教育学

主题

5,606 篇 source coding
1,275 篇 decoding
674 篇 codes
618 篇 channel coding
427 篇 rate-distortion
382 篇 entropy
342 篇 random variables
305 篇 image coding
273 篇 data compression
239 篇 software
231 篇 training
222 篇 computational mo...
214 篇 semantics
208 篇 video coding
205 篇 encoding
189 篇 quantization
186 篇 redundancy
186 篇 distortion
185 篇 information theo...
180 篇 parity check cod...

机构

28 篇 department of el...
25 篇 department of el...
25 篇 department of el...
20 篇 school of electr...
19 篇 technion israel ...
19 篇 univ calif berke...
19 篇 stanford univ de...
17 篇 school of electr...
15 篇 princeton univ d...
15 篇 georgia inst tec...
15 篇 univ calif san d...
15 篇 department of el...
15 篇 department of el...
15 篇 queens univ dept...
15 篇 univ michigan de...
13 篇 department of el...
13 篇 department of el...
13 篇 department of co...
12 篇 ibm thomas j. wa...
12 篇 university of ca...

作者

46 篇 zixiang xiong
31 篇 k. ramchandran
26 篇 yang yang
25 篇 mikael skoglund
24 篇 en-hui yang
24 篇 m. effros
23 篇 s. sandeep pradh...
20 篇 tsachy weissman
19 篇 chang wen chen
19 篇 michelle effros
18 篇 k. rose
18 篇 jun chen
17 篇 yasutada oohama
16 篇 skoglund mikael
14 篇 k. zeger
14 篇 b. girod
14 篇 chao tian
13 篇 s.s. pradhan
13 篇 xiaolin wu
13 篇 pradhan s. sande...

语言

5,547 篇 英文
50 篇 其他
8 篇 中文
1 篇 俄文

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

共 5606 条记录，以下是361-370 订阅

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

详细简洁

排序：

On real-time and causal secure source coding

On real-time and causal secure source coding

引用

IEEE International Symposium on Information Theory

作者： Yonatan Kaspi Neri Merhav Department of Electrical Engineering Technion-Israel Institute of Technology Haifa Israel

We investigate two source coding problems with secrecy constraints. In the first problem we consider real-time fully secure transmission of a memoryless source. We show that although classical variable-rate coding is not an option since the lengths of the codewords leak information on the source, the key rate can be as low as the average Huffman codeword length of the source. In the second problem we consider causal source coding with a fidelity criterion and side information at the decoder and the eavesdropper. We show that when the eavesdropper has degraded side information, it is optimal to first use a causal rate distortion code and then encrypt its output with a key.

关键词： Silicon Decoding source coding Encryption

来源：评论

学校读者我要写书评

暂无评论

Motion video coding in CCITT SG XV-the video source coding

Motion video coding in CCITT SG XV-the video source coding

引用

IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age

作者： R. Plompen Y. Hatori W. Geuen J. Guichard M. Guglielmo H. Brusewitz Dr. Neher Laboratories Netherlands Kokusai Denshin Denwa Company Limited Japan Forschungsinstitut Deutschen Bundespost FL USA Centre National d''Etudes des Télémmunications France Centro Studi e Laboratori Telecommunicazioni S. p. A. Italy Swedish Telecom Administration STA Sweden

A description is given of studies of source coding in the specialists group on coding for visual telephony in CCITT SG XV. Using a macro block approach, the source coding algorithm will have the capability of operating from 64 kb/s for videophone applications up to 2 Mb/s for high-quality videoconferencing applications. The authors describe the existing reference model and the evolution toward the latest reference model (RM5), which is going to be submitted for standardization. Theoretical information is provided and some examples for possible improvements are presented for the most important techniques used in the reference model, among which are quantization, variable block size, scanning classes, loop filter, entropy coding, multiple vs. single variable-length coding, and block-type discrimination.< >

关键词： Video coding source coding Video codecs Telephony Standardization Laboratories Pulse modulation Technical drawing Europe Hardware

来源：评论

学校读者我要写书评

暂无评论

Interactive relay assisted source coding

Interactive relay assisted source coding

引用

IEEE Global Conference on Signal and Information Processing (GlobalSIP)

作者： Farideh Ebrahim Rezagah Elza Erkip Dept. of ECE Polytechnic Institute of NYU

ISBN: (纸本)9781479902460

This paper investigates a source coding problem in which two terminals communicating through a relay wish to estimate one another's source within some distortion constraint. The relay has access to side information that is correlated with the sources. Two different schemes based on the order of communication, distributed source coding/delivery and two cascaded rounds, are proposed and inner and outer bounds for the resulting rate-distortion regions are provided. Examples are provided to show that neither rate-distortion region includes the other one.

关键词： source coding Relays Rate-distortion Decoding Zinc Markov processes

来源：评论

学校读者我要写书评

暂无评论

One-shot source coding with coded side information available at the decoder

One-shot source coding with coded side information available...

引用

IEEE International Symposium on Information Theory

作者： Naqueeb Ahmad Warsi Tata Institute of Fundamental Research Mumbai India

ISBN: (纸本)9781479904440

One-shot achievable rate region for source coding when coded side information is available at the decoder (source coding with a helper) is proposed. The achievable region proposed is in terms of conditional smooth max Rényi entropy and smooth max Rényi divergence. Asymptotically (in the limit of large block lengths) this region is quantified in terms of spectral-sup conditional entropy rate and spectral-sup mutual information rate. In particular, it coincides with the rate region derived in the limit of unlimited arbitrarily distributed copies of the sources.

关键词： Entropy source coding Decoding Channel coding Random variables

来源：评论

学校读者我要写书评

暂无评论

Achievable Rates for Multiterminal source coding with Scalar Quantizers

Achievable Rates for Multiterminal Source Coding with Scalar...

引用

Asilomar Conference on Signals, Systems & Computers

作者： S.D. Servetto School of Electrical and Computer Engineering Cornell University Ithaca NY USA

来源：评论

学校读者我要写书评

暂无评论

Secure source coding with a public helper

Secure source coding with a public helper

引用

IEEE International Symposium on Information Theory

作者： Kittipong Kittichokechai Yeow-Khiang Chia Tobias J. Oechtering Mikael Skoglund Tsachy Weissman School of Electrical Engineering and the ACCESS Linnaeus Center KTH Royal Institute of Technology Sweden Modulation and Coding Dept. Institute for Infocomm Research Singapore Electrical Engineering Department Stanford University USA

ISBN: (纸本)9781479904440

We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper, 2) triangular source coding with a helper where the helper is considered as a public terminal. We are interested in how the helper can support the source transmission subject to a constraint on the amount of information leaked due to its public nature. We characterize the tradeoff between transmission rate, incurred distortion, and information leakage rate at the helper/eavesdropper in the form of a rate-distortion-leakage region for various classes of problems.

关键词： source coding Decoding Loss measurement Distortion measurement Markov processes Indexes

来源：评论

学校读者我要写书评

暂无评论

Renyi to Renyi - source coding under Siege

Renyi to Renyi - Source Coding under Siege

引用

IEEE International Symposium on Information Theory

作者： Michael B. Baer Electronics for Imaging Foster CA USA

ISBN: (纸本)142440505X

A novel lossless source coding paradigm applies to problems of unreliable lossless channels with low bit rates, in which a vital message needs to be transmitted prior to termination of communications. This paradigm can be applied to Alfred Renyi's secondhand account of an ancient siege in which a spy was sent to scout the enemy but was captured. After escaping, the spy returned to his base in no condition to speak and unable to write. His commander asked him questions that he could answer by nodding or shaking his head, and the fortress was defended with this information. Renyi told this story with reference to prefix coding, but maximizing probability of survival in the siege scenario is distinct from yet related to the traditional source coding objective of minimizing expected codeword length. Rather than finding a code minimizing expected codeword length Xi n i=1 p(i)l(i), the siege problem involves maximizing Xi n i=1 p(i)thetas l(i) for a known thetas isin (0,1). When there are no restrictions on codewords, this problem can be solved using a known generalization of Huffman coding. The optimal solution has coding bounds which are functions of Renyi entropy; in addition to known bounds, new bounds are derived here. The alphabetically constrained version of this problem has applications in search trees and diagnostic testing. A novel dynamic programming algorithm - based upon the oldest known algorithm for the traditional alphabetic problem - optimizes this problem in O(n 3 ) time and O(n 2 ) space, whereas two novel approximation algorithms can find a suboptimal solution faster: one in linear time, the other in O(n log n). coding bounds for the alphabetic version of this problem are also presented

关键词： source coding Entropy Approximation algorithms Propagation losses Bit rate Huffman coding Dynamic programming Heuristic algorithms Cities and towns Head

来源：评论

学校读者我要写书评

暂无评论

Lossy source coding with sparse graph codes: A variational formulation of soft decimation

Lossy source coding with sparse graph codes: A variational f...

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Nima Noorshams Martin J. Wainwright Electrical Engineering & Computer Science University of California Berkeley USA Department of statistics University of California Berkeley USA

Various authors have obtained state-of-the-art results in lossy source coding by applying algorithms based on a combination of message-passing and decimation to low-density generator matrix codes, but to date, theoretical understanding of these procedures has been limited. We show that certain forms of soft decimation can be understood as iterative procedures for attempting to maximize a cost function of the node biases. This variational characterization allows us to exhibit appropriate choices of stepsize that ensure convergence to a fixed point, and to provide guarantees on the distortion of the encoding obtained from the fixed point for the case of symmetric Bernoulli sources. Our analysis applies to both an oracle form of soft decimation, in which exact marginals can be computed, and a practical form based on the (reweighted) sum-product algorithm.

关键词： Approximation algorithms Generators Sum product algorithm source coding Upper bound Markov processes

来源：评论

学校读者我要写书评

暂无评论

Distributed source coding in wireless sensor networks using LDPC coding: the entire Slepian-Wolf rate region

Distributed source coding in wireless sensor networks using ...

引用

IEEE Conference on Wireless Communications and Networking

作者： M. Sartipi F. Fekri School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA

In this paper, we propose a scheme for distributed source coding (DSC) that achieves any arbitrary rate on the Slepian-Wolf rate region using a single systematic LDPC code. This method is based on sending a fraction of the information bits along with a fraction of parity bits generated by the LDPC code. First, we study the problem of DSC of two correlated sources at the symmetric rate. We propose to use nonuniform LDPC codes for this application. Then, we generalize our approach to any arbitrary rate. The detailed construction of this scheme is investigated. We illustrate that the design procedure for the LDPC code simplifies to the design of rate-adaptive LDPC codes that need unequal error protection. It is shown that the performance of DSC at any arbitrary rate is almost the same as that of asymmetric rates. Because of the proposed decoding algorithm, each of the sources is decoded independently (only part of the information bits are being exchanged between the decoders). Therefore, this approach does not suffer from the problems of heavy damage or propagation of errors. This method can be easily applied to joint source-channel coding.

关键词： source coding Intelligent networks Wireless sensor networks Parity check codes Decoding Turbo codes Computer networks Distributed computing Error correction codes Scattering

来源：评论

学校读者我要写书评

暂无评论

Joint source coding, Unity Rate Precoding and FFH-MFSK Modulation Using Iteratively Decoded Irregular Variable Length coding

Joint Source Coding, Unity Rate Precoding and FFH-MFSK Modul...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Sohail Ahmed Robert G. Maunder Lie-Liang Yang Soon Xin Ng Lajos Hanzo School of ECS University of Southampton UK

Serially concatenated and iteratively decoded irregular variable length coding (IrVLC) combined with preceded fast frequency hopping (FFH) M-ary frequency shift keying (MFSK) is considered. The proposed joint source and channel coding scheme is capable of low signal-to-noise ratio (SNR) operation in Rayleigh fading channels contaminated by partial band noise jamming (PBNJ). The IrVLC scheme is comprised of a number of component variable length coding (VLC) codebooks employing different coding rates for encoding particular fractions of the input source symbol stream. These fractions may be chosen with the aid of extrinsic information transfer (EXIT) charts in order to shape the inverted EXIT curve of the IrVLC codec so that it can be matched with the EXIT curve of the inner decoder. We demonstrate that using the proposed scheme near-zero bit error ratio may be achieved at low SNR values and the IrVLC based scheme yields a further gain of up to 0.3 dB over the identical-rate single-class VLC based benchmarker scheme

关键词： source coding Modulation coding Iterative decoding Signal to noise ratio Frequency shift keying Concatenated codes Channel coding Fading Noise shaping Jamming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：