A fundamental challenge for engineering communication systems is the problem of transmitting information from the source to the receiver over a noisy channel. This same problem exists in a biological system. How can i...
详细信息
A fundamental challenge for engineering communication systems is the problem of transmitting information from the source to the receiver over a noisy channel. This same problem exists in a biological system. How can information required for the proper functioning of a cell, an organism, or a species be transmitted in an error introducing environment? Source codes (compression codes) and channel codes (error-correcting codes) address this problem in engineering communication systems. The ability to extend these information theory concepts to study information transmission in biological systems can contribute to the general understanding of biological communication mechanisms and extend the field of coding theory into the biological domain. In this work, we review and compare existing coding theoretic methods for modeling genetic systems. We introduce a new error-correcting code framework for understanding translation initiation, at the cellular level and present research results for Escherichia coli K-12. By studying translation initiation, we hope to gain insight into potential error-correcting aspects of genomic sequences and systems. Published by Elsevier Ltd. on behalf of The Franklin Institute.
Cryptography and coding theory are closely related in many respects. Recently, the problem of "decoding Reed Solomon codes" (also known as "polynomial reconstruction") was suggested as an intractab...
详细信息
Cryptography and coding theory are closely related in many respects. Recently, the problem of "decoding Reed Solomon codes" (also known as "polynomial reconstruction") was suggested as an intractability assumption to base the security of protocols on. This has initiated a line of cryptographic research exploiting the rich algebraic structure of the problem and its variants. In this paper we give a short overview of the recent works in this area as well as list directions and open problems in Polynomial Reconstruction Based Cryptography.
We derive uniform asymptotic expressions of some Abel sums appearing in some problems in coding theory and indicate the usefulness of these sums in other fields, like empirical processes, machine maintenance, analysis...
详细信息
We derive uniform asymptotic expressions of some Abel sums appearing in some problems in coding theory and indicate the usefulness of these sums in other fields, like empirical processes, machine maintenance, analysis of algorithms, probabilistic number theory, queuing models, etc. (C) 2001 Elsevier Science B.V. All rights reserved.
作者：
Al, MYZhang, RCPeking Univ
Sch Math Sci Dept Probabil & Stat Beijing 100871 Peoples R China Nankai Univ
Sch Math Sci Dept Stat Tianjin 300071 Peoples R China
The authors introduce the notion of split generalized wordlength pattern (GWP), i.e., treatment GWP and block GWP, for a blocked nonregular factorial design. They generalize the minimum aberration criterion to suit th...
详细信息
The authors introduce the notion of split generalized wordlength pattern (GWP), i.e., treatment GWP and block GWP, for a blocked nonregular factorial design. They generalize the minimum aberration criterion to suit this type of design. Connections between factorial design theory and coding theory allow them to obtain combinatorial identities that govern the relationship between the split GWP of a blocked factorial design and that of its blocked consulting design. These identities work for regular and nonregular designs. Furthermore, the authors establish general rules for identifying generalized minimum aberration (GMA) blocked designs through their blocked consulting designs. Finally they tabulate and compare some GMA blocked designs from Hall's orthogonal array OA(16,2(1)5,2) of type III.
Adaptive codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been introduced in [6] as a new class of non-standard var...
详细信息
ISBN:
(纸本)9781595931702
Adaptive codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been introduced in [6] as a new class of non-standard variable-length codes. New algorithms for data compression, based on adaptive codes of order one and Huffman codes, have been presented in [7], where we have behaviorally shown that for a large class of input data strings, these algorithms substantially outperform the Lempel-Ziv universal data compression algorithm [12]. EAH has been introduced in [8], as an improved generalization of these algorithms. In this paper, we introduce Meta-EAH, an adaptive version of the EAH algorithm. Some comparisons between Meta-EAH and the Lempel-Ziv universal data compression algorithm are reported.
To evaluate and calculate the capacity of information hiding system is a crucial topic of the field. From the point of view of the coding theory and set theory, this paper suggests a methodology for calculating the ca...
详细信息
To evaluate and calculate the capacity of information hiding system is a crucial topic of the field. From the point of view of the coding theory and set theory, this paper suggests a methodology for calculating the capacity of information hiding system on still images in a discrete case, meantime, some definitions are given and a conclusion that the capacity in the condition of no attackers is only related to the distortion function and the PMF (Probability Mass Function) of the source data is drawn out. Furthermore, the results of the capacity of information hiding in the case with attackers are given also.
This article provides a tutorial introduction to the so-called two-part minimum description length (MDL) principle proposed by Rissanen. This two-part MDL principle is a powerful methodology for solving many statistic...
详细信息
This article provides a tutorial introduction to the so-called two-part minimum description length (MDL) principle proposed by Rissanen. This two-part MDL principle is a powerful methodology for solving many statistical model selection problems. However, it seems that this powerful methodology is only adopted by a small number of statisticians to tackle a small number of problems. One plausible reason for this is that the coding theory results required by the MDL principle are somewhat new to most statisticians, and that there are not many readily accessible articles introducing these results appearing in the statistical literature. The first part of this article is devoted to a discussion of such coding theory results. Then, in the second part of the article, the two-part MDL principle is introduced and explained. In doing so, only those coding theory results that are presented in the first part of the article are used. Finally, the applicability of the two-part MDL principle is demonstrated by applying it to tackle four different statistical problems.
Let G = (V, E) be an undirected graph and C a subset of vertices. If the sets B-r(v) boolean AND C, v is an element of V (respectively, v is an element of V \ C), are all nonempty and different, where B-r(v) denotes t...
详细信息
Let G = (V, E) be an undirected graph and C a subset of vertices. If the sets B-r(v) boolean AND C, v is an element of V (respectively, v is an element of V \ C), are all nonempty and different, where B-r(v) denotes the set of all points within distance r from v, we call C an r-identifying code (respectively, an r-locating-dominating code). We prove that, given a graph G and an integer k, the decision problem of the existence of an r-identifying code, or of an r-locating-dominating code, of size at most k in G, is NP-complete for any r. (C) 2002 Elsevier Science B.V. All rights reserved.
In this paper we generalize the concept of a pair of complementary designs D = (D:(D) over bar) to the case that D is a U-type design and the Hamming distances between all pairs of runs are the same. Relationships of ...
详细信息
In this paper we generalize the concept of a pair of complementary designs D = (D:(D) over bar) to the case that D is a U-type design and the Hamming distances between all pairs of runs are the same. Relationships of the generalized word length pattern between a pair of complementary designs are established. Some applications of these relationships are given. Furthermore, we give connections between uniformity and generalized word length pattern for a pair of complementary designs. (C) 2002 Elsevier B.V. All rights reserved.
暂无评论