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

A joint encryption-compression codec for speech signals using the ITU-T G.711 standard and chaotic map

MULTIMEDIA TOOLS AND APPLICATIONS 2017年第1期76卷 1177-1200页

作者： Hermassi, Houcemeddine Hamdi, Mimoun Rhouma, Rhouma Belghith, Safya Mdimegh ENIT Tunis Tunisia

We propose to incorporate encryption procedure into the lossy compression of voice data PCM(Pulse Code Modulation) based on the A-law approximation quantization. The proposed codec CPCM (Chaotic Pulse Code Modulaion) will join the encryption to the compression of the voice data. This scheme provides the same compression ratio given by the PCM codec, but with an unintelligible content. Comparisons with many used schemes have been made to highlight the proposed method in terms of security and rapidity. CPCM codec can be a better alternative to Compress-then-encrypt classical methods which is a time and resource consuming and non suitable for real-time multimedia secure transmission.

关键词： Source coding Cryptography coding and information theory Data encryption

来源：评论

学校读者我要写书评

暂无评论

Lightweight error correction coding for system-level interconnects

引用

IEEE TRANSACTIONS ON COMPUTERS 2007年第3期56卷 289-304页

作者： Bakos, Jason D. Chiarulli, Donald M. Levitan, Steven P. Univ S Carolina Dept Comp Sci & Engn Columbia SC 29208 USA Univ Pittsburgh Dept Comp Sci Pittsburgh PA 15260 USA Univ Pittsburgh Dept Elect & Comp Engn Pittsburgh PA 15260 USA

"Lightweight Hierarchical Error Control coding ( LHECC)" is a new class of nonlinear block codes that is designed to increase noise immunity and decrease error rate for high-performance chip-to-chip and on-chip interconnects. LHECC is designed such that its corresponding encoder and decoder logic may be tightly integrated into compact, high-speed, and low-latency I/O interfaces. LHECC operates over a new channel technology called Multi-Bit Differential Signaling ( MBDS). MBDS channels utilize a physical-layer channel code called "N choose M ( nCm)" encoding, where each channel is restricted to a symbol set such that half of the bits in each symbol are set to one. These symbol sets have properties that are utilized by LHECC to achieve error correction capability while requiring low or zero relative information overhead. In addition, these codes may be designed such that the latency and size of the corresponding decoders are tightly bounded. The effectiveness of these codes is demonstrated by modeling error behavior of MBDS interconnects over a range of transmission rates and noise characteristics.

关键词： interconnections (subsystems) interconnection architectures code design coding tools and techniques coding and information theory error control codes

来源：评论

学校读者我要写书评

暂无评论

Generational analysis of tension and entropy in data structures: impact on automatic data integration and on the semantic web

引用

KNOWLEDGE AND information SYSTEMS 2011年第1期28卷 175-196页

作者： Rohn, Eli CogniMax LLC Highland Pk NJ 08904 USA

The move toward automatic data integration from autonomous and heterogeneous sources is viewed as a transition from a closed to an open system, which is in essence an adaptive information processing system. Data definition languages from various computing eras spanning almost 50 years to date are examined, assessing if they have moved from closed systems to open systems paradigm. The study proves that contemporary data definition languages are indistinguishable from older ones using measurements of Variety, Tension and Entropy, three characteristics of complex adaptive systems (CAS). The conclusion is that even contemporary data definition languages designed for such integration exhibit closed systems characteristics along with open systems aspirations only. Plenty of good will is insufficient to make them more suitable for automatic data integration than their oldest predecessors. A previous report and these new findings set the stage for the development and proposal of a mathematically sound data definition language based on CAS, thus potentially making it better suited for automatic data integration from autonomous heterogeneous sources.

关键词： Data integration Semantic web Data definition languages Law of requisite variety coding and information theory Complex adaptive systems Variety Regulator Tension Entropy GlossoMote

来源：评论

学校读者我要写书评

暂无评论

Consolidation for compact constraints and Kendall tau LP decodable permutation codes

引用

DESIGNS CODES AND CRYPTOGRAPHY 2017年第3期85卷 483-521页

作者： Hagiwara, Manabu Kong, Justin Chiba Univ Dept Math & Informat Inage Ku 1-33 Yayoi Cho Chiba Chiba 2630022 Japan

Invented in the 1960s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications, especially flash memory. In 2011 a polynomial time algorithm called linear programming (LP) decoding was introduced for a class of permutation codes where the feasible set of codewords was a subset of the vertex set of a code polytope. In this paper we investigate a new class of linear constraints for matrix polytopes with no fractional vertices through a new concept called "consolidation." We then introduce a necessary and sufficient condition for which LP decoding methods, originally designed for the Euclidean metric, may be extended to provide an efficient decoding algorithm for permutation codes with the Kendall tau metric.

关键词： coding and information theory Graphs and abstract algebra Linear programming Permutation groups Decoding

来源：评论

学校读者我要写书评

暂无评论

Generational analysis of variety in data structures: impact on automatic data integration and on the semantic web

引用

KNOWLEDGE AND information SYSTEMS 2010年第2期24卷 283-304页

作者： Rohn, Eli New Jersey Inst Technol Dept Informat Syst Newark NJ 07102 USA

We examine data definition languages (DDLs) from various computing era spanning almost 50 years to date. We prove that contemporary DDLs are indistinguishable from older ones using Zipf distribution of words, Zipf distributions of meanings, and information theory. None addresses the Law of Requisite Variety, which is necessary for enabling automatic data integration from autonomous heterogeneous data sources and for the realization of the Semantic Web. The growth of the entire computing industry is hampered by the lack of progress in the development of DDLs suitable for these two goals. Our findings set the stage for the future development of a mathematically sound DDL better suited for the aforementioned purposes.

关键词： Data integration Semantic web Data definition languages Zipf distribution Law of requisite variety coding and information theory information systems models and principles

来源：评论

学校读者我要写书评

暂无评论

Efficient m-ary balanced codes which are invariant under symbol permutation

引用

IEEE TRANSACTIONS ON COMPUTERS 2006年第8期55卷 929-946页

作者： Mascella, Raffaele Tallini, Luca G. Univ Teramo Dipartimento Sci Comunicaz I-64100 Teramo Italy

A symbol permutation invariant balanced (SPI-balanced) code over the alphabet ZZ(m) = {0, 1,..., m - 1} is a block code over ZZm such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason, every permutation among the symbols of the alphabet changes an SPI-balanced code into an SPI-balanced code. This means that SPI-balanced words are "the most balanced" among all possible m-ary balanced word types and this property makes them very attractive from the application perspective. In particular, they can be used to achieve m-ary DC-free communication, to detect/correct asymmetric/unidirectional errors on the m-ary asymmetric/unidirectional channel, to achieve delay-insensitive communication, to maintain data integrity in digital optical disks, and so on. This paper gives some efficient methods to convert ( encode) m-ary information sequences into m-ary SPI-balanced codes whose redundancy is equal to roughly double the minimum possible redundancy r(min). It is proven that r(min) similar or equal to vertical bar(m - 1)/2] log(m)n - (1/2) [1/log(2 pi)m)m-(1/log(2 pi)m) for any code which converts k information digits into an SPI-balanced code of length n = k + r. For example, the first method given in the paper encodes k information digits into an SPI-balanced code of length n = k + r, with r = (m - 1) log(m) k + O(m log(m) log(m) k). A second method is a recursive method, which uses the first as base code and encodes k digits into an SPI-balanced code of length n = k + r, with r similar or equal to (m - 1) log(m) n - log(m) [(m - 1)!].

关键词： coding and information theory error control codes balanced codes constant weight codes digital communication m-ary communication line codes DC-free communication delay-insensitive communication

来源：评论

学校读者我要写书评

暂无评论

Analysis of errors and erasures in parity sharing RS codecs

引用

IEEE TRANSACTIONS ON COMPUTERS 2007年第12期56卷 1721-1726页

作者： Cardarilli, G. C. Pontarelli, S. Re, M. Salsano, A. Univ Rome Dept Elect Engn Rome Italy

Reed Solomon (RS) codes are widely used to protect information from errors in transmission and storage systems. Most of the RS codes are based on GFd(2(8)) Galois Fields and use a byte to encode a symbol providing codewords up to 255 symbols. Codewords with more than 255 symbols can be obtained by using GFd(2(m)) Galois Fields with m > 8, but this choice increases the complexity of the encoding and decoding algorithms. This limitation can be superseded by introducing Parity Sharing ( PS) RS codes that are characterized by a greater flexibility in terms of design parameters. Consequently, a designer can choose between different PS code implementations in order to meet requirements such as Bit Error Rate (BER), hardware complexity, speed, and throughput. This paper analyzes the performance of PS codes in terms of BER with respect to the code parameters, taking into account either random error or erasure rates as two independent probabilities. This approach provides an evaluation that is independent of the communication channel characteristics and extends the results to memory systems in which permanent faults and transient faults can be modeled, respectively, as erasures and random errors. The paper also provides hardware implementations of the PS encoder and decoder and discusses their performances in terms of hardware complexity, speed, and throughput.

关键词： reliability testing and fault tolerance error control codes coding and information theory

来源：评论

学校读者我要写书评

暂无评论

Nearly optimal robust secret sharing

引用

DESIGNS CODES AND CRYPTOGRAPHY 2019年第8期87卷 1777-1796页

作者： Cheraghchi, Mahdi Imperial Coll London Dept Comp London England

We prove that a known general approach to improve Shamir's celebrated secret sharing scheme;i.e., adding an information-theoretic authentication tag to the secret, can make it robust for n parties against any collusion of size n, for any constant (0,1/2). Shamir's original scheme is robust for all (0,1/3). Beyond that, we employ the best known list decoding algorithms for Reed-Solomon codes and show that, with high probability, only the correct secret maintains the correct information-theoretic tag if an algebraic manipulation detection (AMD) code is used to tag secrets. This result holds in the so-called non-rushing model in which the n shares are submitted simultaneously for reconstruction. We thus obtain a fully explicit and robust secret sharing scheme in this model that is essentially optimal in all parameters including the share size which is k(1+o(1))+O(), where k is the secret length and is the security parameter. Like Shamir's scheme, in this modified scheme any set of more than n honest parties can efficiently recover the secret. Using algebraic geometry codes instead of Reed-Solomon codes, the share length can be decreased to a constant (only depending on ) while the number of shares n can grow independently. In this case, when n is large enough, the scheme satisfies the threshold requirement in an approximate sense;i.e., any set of n(1+) honest parties, for arbitrarily small >0, can efficiently reconstruct the secret. From a practical perspective, the main importance of our result is in showing that existing systems employing Shamir-type secret sharing schemes can be made much more robust than previously thought with minimal change, essentially only involving the addition of a short and simple checksum to the original data.

关键词： coding and information theory Cryptography Algebraic coding theory

来源：评论

学校读者我要写书评

暂无评论

coding by minimal linear grammars

引用

THEORETICAL COMPUTER SCIENCE 2020年 834卷 14-25页

作者： Carpi, Arturo D'Alessandro, Flavio Univ Perugia Dipartimento Matemat & Informat Via Vanvitelli 1 I-06123 Perugia Italy Univ Roma La Sapienza Dipartimento Matemat Piazzale Aldo Moro 2 I-00185 Rome Italy Bogazici Univ Dept Math TR-34342 Istanbul Turkey

This paper concerns the structure and the properties of a special class of combinatorial systems called minimal linear grammars. The role of unambiguous minimal linear grammars is investigated in the framework of the ... 详细信息

关键词： coding and information theory Uniquely decipherable code Maximal code Bernoulli distribution Context-free linear grammar Commutative equivalence

来源：评论

学校读者我要写书评

暂无评论

Bounding Quantum Capacities via Partial Orders and Complementarity

引用

IEEE TRANSACTIONS ON information theory 2023年第1期69卷 283-297页

作者： Hirche, Christoph Leditzky, Felix Tech Univ Munich Zentrum Math D-85748 Garching Germany Natl Univ Singapore Ctr Quantum Technol Singapore 119077 Singapore Dept Math Univ Illinois Urbana Champaign Illinois Quantum Informat Sci & Technol Ctr IQUIS Urbana IL 61801 USA

Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus, a vast amount of literature is devoted to finding tight and computable bounds on these capacities. We add a new viewpoint by giving operationally motivated bounds on several capacities, including the quantum capacity and private capacity of a quantum channel and the one-way distillable entanglement and private key of a quantum state. These bounds are generally phrased in terms of capacity quantities involving the complementary channel or state. As a tool to obtain these bounds, we discuss partial orders on quantum channels and states, such as the less noisy and the more capable order. Our bounds help to further understand the interplay between different capacities, as they give operational limitations on superadditivity and the difference between capacities in terms of the information-theoretic properties of the complementary channel or state. They can also be used as a new approach towards numerically bounding capacities, as discussed with some examples.

关键词： coding and information theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：