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

coding Theorems of information theory 1

丛书名： Ergebnisse der Mathematik und ihrer Grenzgebiete. 2. Folge

1000年

作者： J. Wolfowitz

ISBN: (数字)9783662015100

This monograph originated with a course of lectures on information theory which I gave at Cornell University during the academic year 1958-1959. It has no pretensions to exhaustiveness, and, indeed, no pretensions at all. Its purpose is to provide, for mathematicians of some maturity, an easy introduction to the ideas and principal known theorems of a certain body of coding theory. This purpose will be amply achieved if the reader is enabled, through his reading, to read the (sometimes obscurely written) literature and to obtain results of his own. The theory is ob viously in a rapid stage of development; even while this monograph was in manuscript several of its readers obtained important new results. The first chapter is introductory and the subject matter of the monograph is described at the end of the chapter. There does not seem to be a uniquely determined logical order in which the material should be arranged. In determining the final arrangement I tried to obtain an order whichmakes reading easy and yet is not illogical. I can only hope that the resultant compromises do not earn me the criticism that I failed on both counts. There are a very few instances in the monograph where a stated theorem is proved by a method which is based on a result proved only later.

关键词： coding and information theory Mathematics, general

来源：评论

学校读者我要写书评

暂无评论

coding Theorems of information theory 2

引用

丛书名： Ergebnisse der Mathematik und ihrer Grenzgebiete. 2. Folge

1000年

作者： J. Wolfowitz

ISBN: (数字)9783662002377

The imminent exhaustion of the first printing of this monograph and the kind willingness of the publishers have presented me with the opportunity to correct a few minor misprints and to make a number of additions to the first edition. Some of these additions are in the form of remarks scattered throughout the monograph. The principal additions are Chapter 11, most of Section 6. 6 (inc1uding Theorem 6. 6. 2), Sections 6. 7, 7. 7, and 4. 9. It has been impossible to inc1ude all the novel and inter esting results which have appeared in the last three years. I hope to inc1ude these in a new edition or a new monograph, to be written in a few years when the main new currents of research are more clearly visible. There are now several instances where, in the first edition, only a weak converse was proved, and, in the present edition, the proof of a strong converse is given. Where the proof of the weaker theorem em ploys a method of general application and interest it has been retained and is given along with the proof of the stronger result. This is wholly in accord with the purpose of the present monograph, which is not only to prove the principal coding theorems but also, while doing so, to acquaint the reader with the most fruitful and interesting ideas and methods used in the theory. I am indebted to Dr.

关键词： coding and information theory Mathematics, general

来源：评论

学校读者我要写书评

暂无评论

information and coding theory 1

引用

丛书名： Springer Undergraduate Mathematics Series

1000年

作者： Gareth A. Jones J. Mary Jones

ISBN: (数字)9781447103615

ISBN: (纸本)9781852336226

As this Preface is being written, the twentieth century is coming to an end. Historians may perhaps come to refer to it as the century of information, just as its predecessor is associated with the process of industrialisation. Successive technological developments such as the telephone, radio, television, computers and the Internet have had profound effects on the way we live. We can see pic tures of the surface of Mars or the early shape of the Universe. The contents of a whole shelf-load of library books can be compressed onto an almost weight less piece of plastic. Billions of people can watch the same football match, or can keep in instant touch with friends around the world without leaving home. In short, massive amounts of information can now be stored, transmitted and processed, with surprising speed, accuracy and economy. Of course, these developments do not happen without some theoretical ba sis, and as is so often the case, much of this is provided by mathematics. Many of the first mathematical advances in this area were made in the mid-twentieth century by engineers, often relying on intuition and experience rather than a deep theoretical knowledge to lead them to their discoveries. Soon the math ematicians, delighted to see new applications for their subject, joined in and developed the engineers' practical examples into wide-ranging theories, com plete with definitions, theorems and proofs.

关键词： Mathematical and Computational Engineering Number theory coding and information theory Combinatorics Probability theory and Stochastic Processes

来源：评论

学校读者我要写书评

暂无评论

Network coding as a Performance Booster for Concurrent Multi-Path Transfer of Data in Multi-Hop Wireless Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2017年第4期16卷 1047-1058页

作者： Arianpoo, Nasim Aydin, Ilknur Leung, Victor C. M. Univ British Columbia Dept Elect Engn Vancouver BC V6T 1Z4 Canada Farmingdale State Coll Comp Syst Dept Farmingdale NY 11735 USA

The emerging use of multi-homed wireless devices along with simultaneous multi-path data transfer offers tremendous potentials to improve the capacity of multi-hop wireless networks. The use of simultaneous data transfer over separate disjoint paths in multi-hop wireless networks to increase network capacity is a less explored subject, mainly because of the challenges it triggers for the reliable transport layer protocols. Reliable transport layer protocols generally use packet sequence number as a mean to ensure delivery. As such, the out-of-order packet arrival in reliable transport layer protocols triggers receiver buffer blocking that causes throughput degradation and prevents the reliable multi-path transport layer protocol to realize its vast potential. This paper focuses on integrating network coding with a reliable multi-path transport layer protocol to resolve the receiver buffer blocking problem. We propose an adaptive network coding mechanism to desensitize the receiver against packet reordering and consequently eliminate the receiver buffer blocking problem. Our state-of-the-art network coding scheme uses a combination of Q-learning and logistic regression for rare data events to control the number of redundant packets based on the network dynamics. We confirmed the veracity of our proposed scheme by a queuing theory based mathematical model. Moreover, the effectiveness of the proposed scheme is demonstrated through simulations and testbed experiments.

关键词： Machine learning wireless coding and information theory Markov processes algorithm/protocol design and analysis SCTP-CMT

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Public Release of Datasets for Support Vector Machine Classification

引用

IEEE TRANSACTIONS ON BIG DATA 2021年第5期7卷 893-899页

作者： Farokhi, Farhad CSIROs Data61 Docklands Vic 3008 Australia Univ Melbourne Parkville Vic 3010 Australia

We consider the problem of publicly releasing a dataset for support vector machine classification while not infringing on the privacy of data subjects (i.e., individuals whose private information is stored in the dataset). The dataset is systematically obfuscated using an additive noise for privacy protection. Motivated by the Cramer-Rao bound, inverse of the trace of the Fisher information matrix is used as a measure of the privacy. Conditions are established for ensuring that the classifier extracted from the original dataset and the obfuscated one are close to each other (capturing the utility). The optimal noise distribution is determined by maximizing a weighted sum of the measures of privacy and utility. The optimal privacy-preserving noise is proved to achieve local differential privacy. The results are generalized to a broader class of optimization-based supervised machine learning algorithms. Applicability of the methodology is demonstrated on multiple datasets.

关键词： Privacy Differential privacy Support vector machines Noise measurement Machine learning Big Data Database privacy support vector machine classification Fisher information coding and information theory

来源：评论

学校读者我要写书评

暂无评论

On the Equivalence of Two Security Notions for Hierarchical Key Assignment Schemes in the Unconditional Setting

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2015年第4期12卷 485-490页

作者： Cafaro, Massimo Civino, Roberto Masucci, Barbara Univ Salento Dept Engn Innovat I-73100 Lecce Italy Univ Salento Dept Math & Phys I-73100 Lecce Italy Univ Salerno Dept Comp Sci I-84084 Fisciano Italy

The access control problem in a hierarchy can be solved by using a hierarchical key assignment scheme, where each class is assigned an encryption key and some private information. A formal security analysis for hierarchical key assignment schemes has been traditionally considered in two different settings, i.e., the unconditionally secure and the computationally secure setting, and with respect to two different notions: security against key recovery (KR-security) and security with respect to key indistinguishability (KI-security), with the latter notion being cryptographically stronger. Recently, Freire, Paterson and Poettering proposed strong key indistinguishability (SKI-security) as a new security notion in the computationally secure setting, arguing that SKI-security is strictly stronger than KI-security in such a setting. In this paper we consider the unconditionally secure setting for hierarchical key assignment schemes. In such a setting the security of the schemes is not based on specific unproven computational assumptions, i.e., it relies on the theoretical impossibility of breaking them, despite the computational power of an adversary coalition. We prove that, in this setting, SKI-security is not stronger than KI-security, i.e., the two notions are fully equivalent from an information-theoretic point of view.

关键词： Access controls information flow controls hierarchical design data dependencies coding and information theory

来源：评论

学校读者我要写书评

暂无评论

The quest for error correction in biology

引用

IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE 2006年第1期25卷 46-53页

作者： Gupta, MK Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada

The goal of this article is to give a brief account of the recent developments in codes and biology. With the increasing understanding of biology and with the advancement of sequencing technology, the whole human genome is stretched out before us. There is a need to look again with these new information for the applications of coding and information theory to biology. This paper focuses on the existence of error correction in biological information processing.

关键词： error correction codes genetics molecular biophysics biological information processing codes error correction human genome information theory sequencing technology error correction biological information processing coding and information theory information theory Biological Science Disciplines molecular biology Codes Genetics Human Genome biology

来源：评论

学校读者我要写书评

暂无评论

Browser-in-the-Middle (BitM) attack

引用

INTERNATIONAL JOURNAL OF information SECURITY 2022年第2期21卷 179-189页

作者： Tommasi, Franco Catalano, Christian Taurino, Ivan Univ Salento Dipartimento Ingn Innovaz Via Monteroni Lecce Italy

Man-in-the-Middle (MitM), one of the best known attacks in the world of computer security, is among the greatest concerns for professionals in the field. Main goal of MitM is to compromise confidentiality, integrity and availability of data flowing between source and destination. However, most of its many variants involve difficulties that make it not always possible. The present paper aims at modelling and describing a new method of attack, named Browser-in-the-Middle (BitM) which, despite the similarities with MitM in the way it controls the data flow between a client and the service it accesses, bypasses some of MitM's typical shortcomings. It could be started by phishing techniques and in some cases coupled to the well-known Man-in-the-Browser (MitB) attack. It will be seen how BitM expands the range of the possible attacker's actions, at the same time making them easier to implement. Among its features, the absence of the need to install malware of any kind on the victim's machine and the total control it allows the attacker are to be emphasized.

关键词： Cryptology Computer Communication Networks Operating Systems coding and information theory Management of Computing and information Systems Communications Engineering Networks

来源：评论

学校读者我要写书评

暂无评论

Linear-time list recovery of high-rate expander codes

引用

information AND COMPUTATION 2018年第Part2期261卷 202-218页

作者： Hemenway, Brett Wootters, Mary Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA

We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have applications to constructing efficiently list-decodable codes, as well as in compressed sensing and group testing. Previous list recoverable codes with linear-time decoding algorithms have all had rate at most 1/2;in contrast, our codes can have rate 1-epsilon for any epsilon > 0. We can plug our high-rate codes into a construction of Alon and Luby (1996), recently highlighted by Meir (2014) to obtain linear-time list recoverable codes of arbitrary rates R, which approach the optimal trade-off between the number of non-trivial lists provided and the rate of the code. A slight strengthening of our result would imply linear-time and optimally list-decodable codes for all rates. Thus, our result is a step in the direction of solving this important problem. (C) 2018 Elsevier Inc. All rights reserved.

关键词： coding and information theory Linear codes Combinatorial codes Graph theory Randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

RQC Revisited and More Cryptanalysis for Rank-Based Cryptography

引用

IEEE TRANSACTIONS ON information theory 2024年第3期70卷 2271-2286页

作者： Bidoux, Loic Briaud, Pierre Bros, Maxime Gaborit, Philippe Technol Innovat Inst Cryptog Res Ctr Abu Dhabi U Arab Emirates Inria F-75012 Paris France Sorbonne Univ UPMC Univ F-75006 Paris France Natl Inst Stand & Technol Gaithersburg MD 20899 USA Univ Limoges CNRS XLIM F-87000 Limoges France

In this paper, we revisit the Rank Quasi-Cyclic (RQC) (Melchor et al., IEEE IT, 2018) encryption scheme by proposing three possible variations for its design. Our first improvement relies on the introduction of Augmented Gabidulin codes, a new family of decodable codes exploiting the concept of support erasure for the rank metric. Following the work of Melchor et al. (PQCrypto, 2022), our second improvement uses multiple syndromes to increase the weight of the error to be decoded. As pioneered in Melchor et al. (NIST PQC, 2020), our third variation considers non-homogeneous error weights in order to decrease the parameters. These improvements can be combined together to design schemes offering various trade-offs in term of security and size. Our Multi-UR-AG (multiple syndromes, unstructured, augmented Gabidulin) scheme achieves a size of 11kB (public key + ciphertext) for 128 bits of security while featuring a conservative design as it relies on pure random instances without any ideal structure. Besides, our NH- Multi-RQC-AG (non-homogeneous error, multiple syndromes, ideal structure, augmented Gabidulin) achieves a size of 2.7 kB for 128 bits of security, namely a 50 % improvement with respect to classical RQC. Our second and third variations respectively rely on the security of the RSL and NHRSD problems (or NHRSL when considered together). In this paper, we also provide new security analysis and attacks for these problems. While these results are important for our new schemes, they are of independent interest as well. Our security analysis for the RSL problem provides an improvement on the recent algebraic attacks for some instances. In addition, we show that the RSL problem can be solved in polynomial time when N >= (k + 1) r m/m-r , this improves the best known combinatorial attack (Gaborit et al., Crypto, 2017). We also propose the first combinatorial attack against the NHRSD problem along with a precise complexity analysis of the algebraic attack described Me

关键词： Codes Measurement Security Public key Decoding Reed-Solomon codes NIST Public key cryptosystem coding and information theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：