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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

46 篇 会议
27 篇 期刊文献
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

71 篇 工学
- 46 篇 电气工程
- 35 篇 计算机科学与技术...
- 31 篇 信息与通信工程
- 10 篇 电子科学与技术（可...
- 6 篇 控制科学与工程
- 4 篇 仪器科学与技术
- 1 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 交通运输工程
- 1 篇 软件工程
18 篇 理学
- 12 篇 数学
- 2 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
- 1 篇 临床医学
1 篇 军事学
- 1 篇 军队指挥学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

76 篇 linear block cod...
18 篇 block codes
13 篇 linear codes
11 篇 decoding
7 篇 codes
5 篇 iterative decodi...
5 篇 maximum likeliho...
4 篇 computational co...
4 篇 error correction...
4 篇 parity check cod...
4 篇 binary codes
4 篇 complexity theor...
4 篇 channel coding
3 篇 hamming distance
3 篇 error correction
3 篇 a* algorithm
3 篇 code length
3 篇 interactive enco...
3 篇 soft decoding of...
3 篇 low density pari...

机构

2 篇 waseda univ sch ...
2 篇 univ illinois co...
2 篇 coding and crypt...
2 篇 brno university ...
2 篇 natl taiwan univ...
2 篇 univ electrocomm...
2 篇 tokyo city univ ...
2 篇 waseda univ wase...
2 篇 natl taiwan univ...
1 篇 univ bridgeport ...
1 篇 univ colorado de...
1 篇 osaka univ grad ...
1 篇 informat engn un...
1 篇 shiraz univ sch ...
1 篇 tech univ eindho...
1 篇 pla univ sci & t...
1 篇 heriot watt univ...
1 篇 waseda univ medi...
1 篇 sound technology...
1 篇 michigan state u...

作者

4 篇 kasami t
4 篇 fujiwara t
3 篇 hirasawa shigeic...
3 篇 yagi hideki
3 篇 chang chia-fu
3 篇 lin mao-chao
2 篇 li yonghui
2 篇 meng jin
2 篇 jin ming
2 篇 gu bin
2 篇 mahmoud ahmadian...
2 篇 zhang yan
2 篇 yasser karimian
2 篇 vucetic branka
2 篇 wang junming
2 篇 niinomi toshihir...
2 篇 yue chentao
2 篇 shirvanimoghadda...
1 篇 kotter r
1 篇 hefele alexander

语言

74 篇 英文
1 篇 其他
1 篇 中文

检索条件"主题词=Linear Block Code"

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

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

详细简洁

排序：

Blind Recovery of Convolutional codes over Noisy Channels 24

Blind Recovery of Convolutional Codes over Noisy Channels

引用

24th Iranian Conference on Electrical Engineering (ICEE)

作者： Gordany, Peiman Keshavarz-Haddad, Alireza Jamshidi, Ali Shiraz Univ Sch Elect & Comp Engn Shiraz Iran

ISBN: (纸本)9781467387897

In this paper we study blind recovery methods for identifying the parameters of a convolutional code from an intercepted bitstream. It is assumed that the interceptor has no prior knowledge about the encoder and the recorded bitstream is noisy. The goal is to obtain the following parameters of convolutional code (i) number of inputs (ii) number of outputs (iii) constraint length of the convolutional encoder. Given these parameters one can regenerate the encoder and fully decode the intercepted bitstream. To evaluate our proposed method, we model the effect of noise on bitstream by errors in binary symmetric channel and burst format. Our simulation results show that the proposed method can accurately extract the parameters of convolutional codes in various scenarios.

关键词： blind recovery channel coding linear block code convohitional code dual code

来源：评论

学校读者我要写书评

暂无评论

On the hardness of approximating stopping and trapping sets in LDPC codes

On the hardness of approximating stopping and trapping sets ...

引用

IEEE Information Theory Workshop

作者： McGregor, Andrew Milenkovic, Olgica Univ Calif San Diego Ctr Informat Theory & Applicat San Diego CA 92103 USA Univ Colorado Dept Elect & Comp Engn Colorado Springs CO USA

ISBN: (纸本)9781424415632

We prove that approximating the size of the smallest trapping set in Tanner graphs of linear block codes, and more restrictively, LDPC codes, is NP-hard. The proof techniques rely on reductions from three NP-hard problems, the set cover, minimum three-dimensional matching, and the minimum Hamming distance problem. The ramifications of our findings are that methods used for estimating the height of the error-floor of long LDPC codes, centered around trapping set enumeration, cannot provide accurate worst-case performance predictions.

关键词： trapping sets Soundness linear block code hardness Nondeterministic polynomial-time hard error floor block codes

来源：评论

学校读者我要写书评

暂无评论

Improvement of Binary and Non Binary Statistical Decoding Algorithm 1

引用

22nd International Conference on Information Security and Cryptology (ICISC)

作者： Cayrel, Pierre-Louis Gueye, Cheikh Thiecoumba Khan, Junaid Ahmad Klamti, Jean Belo Persichetti, Edoardo Lab Hubert Curien UMR CNRS 5516 Batiment F 18 Rue Prof Benoit Lauras F-42000 St Etienne France Univ Cheikh Anta Diop Fac Sci & Tech LACGAA DMI Dakar Senegal Dongguk Univ Seoul South Korea Florida Atlantic Univ Dept Math Sci Boca Raton FL 33431 USA

ISBN: (数字)9783030409210

ISBN: (纸本)9783030409210;9783030409203

The security of McEliece's cryptosystem relies heavily on the hardness of decoding a random linear code. The best known generic decoding algorithms are derived from the Information-Set Decoding (ISD) algorithm. This was first proposed in 1962 by Prange and subsequently improved in 1989 by Stern and later in 1991 by Dumer. In 2001 Al Jabri introduced a new decoding algorithm for general linear block codes which does not belong to this family, called Statistical Decoding (SD). Since then, like for the Information Set Decoding algorithm, there have been numerous work done to improve and generalize the SD algorithm. In this paper, we improve the SD algorithm using the notion of bases lists in binary case. Then, we give a non binary version of this improvement. Finally, we have computed complexity analysis and have made a complexity comparison of our results with that of recent results on SD algorithm and complexity of classic ISD algorithm.

关键词： code-based cryptography Statistical decoding McEliece system linear block code Base list MO-fusion

来源：评论

学校读者我要写书评

暂无评论

A generalization of the parallel error correcting codes by allowing some random errors

A generalization of the parallel error correcting codes by a...

引用

29th Symposium on Information Theory and Its Applications (SITA2006)

作者： Yagi, Hideki Matsushima, Toshiyasu Hirasawa, Shigeichi Waseda Univ Media Network Ctr Tokyo 1698005 Japan Waseda Univ Sch Fundamental Sci & Engn Tokyo 1698555 Japan Waseda Univ Sch Creat Sci & Engn Tokyo 1698555 Japan

This paper generalizes parallel error correcting codes proposed by Ahlswede et al. over a new type of multiple access channel called parallel error channel. The generalized parallel error correcting codes can handle with more errors compared with the original ones. We show construction methods of independent and non-independent parallel error correcting codes and decoding methods. We derive some bounds about the size of respective parallel error correcting codes. The obtained results imply a single parallel error correcting code can be constructed by two or more kinds of error correcting codes with distinct error correcting capabilities.

关键词： multiple access channel parallel channel code construction error-correcting code linear block code

来源：评论

学校读者我要写书评

暂无评论

Partial Reed Solomon codes for erasure channels

Partial Reed Solomon codes for erasure channels

引用

IEEE Information Theory Workshop

作者： Karande, SS Radha, H Michigan State Univ Dept Elect & Comp Engn E Lansing MI 48824 USA

ISBN: (纸本)0780377990

In this paper, we introduce a new family of linear block codes, which we refer to as Partial Reed Solomon (PRS) codes. These codes are specifically designed and optimized for real-time multimedia communication over packet-based erasure channels. Based on the constraints and flexibilities of real time applications, we define a performance measure, message throughput (tau(m)), which is suitable for these applications. This measure differentiates the notion of optimum codes for the target multimedia applications as compared to performance measures that are used for non-realtime data. Based on the proposed measure, we combine the advantages of lowering the density of a code for near capacity performance with the high decoding efficiency of Reed Solomon (RS) codes, in order to design optimum PRS codes. Then, we demonstrate, through an example of a Binary Erasure Channel (BEC), that at near-capacity coding rates, appropriate design of a PRS code can outperform an RS-code. We extend this analysis and optimization for a general BEC over a wide range of channel conditions. Moreover, as compared with RS codes, the proposed PRS codes provide a significantly improved graceful degradation when the number of losses exceeds the number of parity symbols within the code block. This is a highly desirable feature for realtime multimedia applications.

关键词： block codes linear codes Reed-Solomon codes optimisation multimedia communication channel capacity partial Reed Solomon codes packet-based erasure channels linear block codes real-time multimedia communication message throughput linear codes linear block code Reed-Solomon codes block codes codes Channel capacity range channel real-time application program

来源：评论

学校读者我要写书评

暂无评论

A Highly Secure Video Steganography using Hamming code (7,4)

A Highly Secure Video Steganography using Hamming Code (7,4)

引用

IEEE Long Island Systems, Applications and Technology Conference (LISAT)

作者： Mstafa, Ramadhan J. Elleithy, Khaled M. Univ Bridgeport Dept Comp Sci & Engn Bridgeport CT 06604 USA

ISBN: (纸本)9781479938513

Due to the high speed of internet and advances in technology, people are becoming more worried about information being hacked by attackers. Recently, many algorithms of steganography and data hiding have been proposed. Steganography is a process of embedding the secret information inside the host medium (text, audio, image and video). Concurrently, many of the powerful steganographic analysis software programs have been provided to unauthorized users to retrieve the valuable secret information that was embedded in the carrier files. Some steganography algorithms can be easily detected by steganalytical detectors because of the lack of security and embedding efficiency. In this paper, we propose a secure video steganography algorithm based on the principle of linear block code. Nine uncompressed video sequences are used as cover data and a binary image logo as a secret message. The pixels' positions of both cover videos and a secret message are randomly reordered by using a private key to improve the system's security. Then the secret message is encoded by applying Hamming code (7, 4) before the embedding process to make the message even more secure. The result of the encoded message will be added to random generated values by using XOR function. After these steps that make the message secure enough, it will be ready to be embedded into the cover video frames. In addition, the embedding area in each frame is randomly selected and it will be different from other frames to improve the steganography scheme's robustness. Furthermore, the algorithm has high embedding efficiency as demonstrated by the experimental results that we have obtained. Regarding the system's quality, the Pick Signal to Noise Ratio (PSNR) of stego videos are above 51 dB, which is close to the original video quality. The embedding payload is also acceptable, where in each video frame we can embed 16 Kbits and it can go up to 90 Kbits without noticeable degrading of the stego video's quality.

关键词： Video Steganography Hamming code linear block code Security Embedding Efficiency Embedding Payload

来源：评论

学校读者我要写书评

暂无评论

New family of error control codes and weight spectrum of ₈ code obtained by computer 2

New family of error control codes and weight spectrum of <su...

引用

International Conference on Computer as a Tool

作者： Farkas, P Slovak Univ Technol Bratislava Dept Telecommun Fac Elect Engn & Informat Technol Bratislava 81219 Slovakia

ISBN: (纸本)078037763X

In [1] a new family of error detection codes called Weighted Sum codes was proposed. In [2] it was noted, that these codes are equivalent to lengthened Reed Solomon codes, and shortened versions of lengthened Reed Solomon codes respectively over GF (2((h/2))). It was also shown that it is possible to use these codes for correction of one error in each code-word over GF(2((h/2))). In [3] a class of modified Generalized Weighted Sum codes for single error and conditionally double error correction Were presented. In this paper we present a new family of double error - correcting codes with code distance d(m) = 5. Weight spectrum for [60,49,5] code constructed over GF(8) which is an example of the new codes was obtained by computer. The coderate of the new codes are higher than the coderate of ordinary Reed Solomon codes over the same finite fields.

关键词： linear block code finite field Reed Solomon codes coderate code distance error control code

来源：评论

学校读者我要写书评

暂无评论

Distributed Coding Based on Partial Relay Selection

Distributed Coding Based on Partial Relay Selection

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Jalil, Amir Minayi Meghdadi, Vahid Cances, Jean-Pierre Concordia Univ Dept Elect & Comp Engn Montreal PQ Canada Univ Limoges C2S2 XLIM Limoges France

ISBN: (纸本)9781479930838

A new distributed coding scheme is proposed to achieve diversity in a network comprising multiple sources, multiple relays, and a single destination. This scheme is based on a distributed implementation of linear block codes, where each relay is assigned to a subset of the source nodes using the channel state information (CSI) of the source-relay (S-R) channels. The proposed scheme achieves diversity without using the CSI of the relay-destination (R-D) channels for relay assignment. On the other hand, in classical distributed coding schemes, it is usually assumed that each relay can fully decide if its received symbols are successfully decoded. This is achieved by using complicated coding schemes in S-R channels, which is also vulnerable to quasi-static fading. The proposed scheme achieves the intended diversity without using this extra coding/overhead. For the resulting relay assignment problem, we propose an algorithm based on the max-min criterion.

关键词： block codes channel coding diversity reception fading channels linear codes minimax techniques network coding relay networks (telecommunication) CSI R-D channel S-R channel channel state information distributed coding linear block code max-min criterion network diversity partial relay selection quasistatic fading relay assignment relay-destination channel source node source-relay channel block codes Decoding Error probability Fading Relays Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Instanton method of post-error-correction analytical evaluation

Instanton method of post-error-correction analytical evaluat...

引用

IEEE Information Theory Workshop

作者： Chernyak, V Chertkov, M Stepanov, M Vasic, B Corning Inc. NY USA

ISBN: (纸本)0780387201

We present a theoretical tool for evaluation of the error codes' performance on graphs. The method is known under the name of instanton calculus and is common in theoretical physics. We introduce the instanton calculus for linear block codes, and give a closed form expression for the bit error rate for a class of codes whose graphical model is approximated locally by a tree.

关键词： linear codes block codes error correction codes error statistics tree codes error correction error code performance instanton calculus linear block codes closed form expression bit error rate tree graphical model linear block code tree codes block codes linear codes error correction Closed-form solutions

来源：评论

学校读者我要写书评

暂无评论

Optimization of Graph Based codes for Belief Propagation Decoding

Optimization of Graph Based Codes for Belief Propagation Dec...

引用

IEEE Information Theory Workshop (ITW)

作者： Jayasooriya, Sachini Johnson, Sarah J. Ong, Lawrence Berretta, Regina Univ Newcastle Sch Elect Engn & Comp Sci Callaghan NSW Australia

ISBN: (纸本)9781479959990

A low-density parity-check (LDPC) code is a linear block code described by a sparse parity-check matrix, which can be efficiently represented by a bipartite Tanner graph. The standard iterative decoding algorithm, known as belief propagation, passes messages along the edges of this Tanner graph. Density evolution is an efficient method to analyze the performance of the belief propagation decoding algorithm for a particular LDPC code ensemble, enabling the determination of a decoding threshold. The basic problem addressed in this work is how to optimize the Tanner graph so that the decoding threshold is as large as possible. We introduce a new code optimization technique which involves the search space range which can be thought of as minimizing randomness in differential evolution or limiting the search range in exhaustive search. This technique is applied to the design of good irregular LDPC codes and multi-edge type LDPC codes.

关键词： Cost function Decoding Iterative decoding Standards Vectors Belief propagation Iterative decoding DECODING Cost functions low density parity check codes Range searching decoding threshold Line graph linear block code check matrix codes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：