The aim of this paper is to describe a new class of problems and some new results in coding theory arising from the analysis of the composition and functionality of the genetic code. The major goal of the proposed wor...
详细信息
ISBN:
(纸本)0780387201
The aim of this paper is to describe a new class of problems and some new results in coding theory arising from the analysis of the composition and functionality of the genetic code. The major goal of the proposed work is to initiate research on investigating possible connections between the regulatory network of gene interactions (RNGI) and the proofreading (error-control) mechanism of the processes of the central dogma of genetics. New results include establishing a direct relationship between Boolean Network (BN) Models of RNGI and Gallager's LDPC decoding algorithms. The proposed research topics and described results are expected to have a two-fold impact on coding theory and genetics research. Firstly, they may provide a different setting in which to analyze standard LDPC decoding algorithms, by using dynamical systems and Boolean function theory. Secondly, they may be of use in establishing deeper relationships between the DNA proofreading mechanism, RNGIs, as well as their joint influence on the development and possible treatment of genetic diseases like cancer.
Unifying information theory and digital communication through the language of lattice codes, this book provides a detailed overview for students, researchers and industry practitioners. It covers classical work by lea...
详细信息
ISBN:
(数字)9781139989275
ISBN:
(纸本)9780521766982
Unifying information theory and digital communication through the language of lattice codes, this book provides a detailed overview for students, researchers and industry practitioners. It covers classical work by leading researchers in the field of lattice codes and complementary work on dithered quantization and infinite constellations, and then introduces the more recent results on 'algebraic binning' for side-information problems, and linear/lattice codes for networks. It shows how high dimensional lattice codes can close the gap to the optimal information theoretic solution, including the characterisation of error exponents. The solutions presented are based on lattice codes, and are therefore close to practical implementations, with many advanced setups and techniques, such as shaping, entropy-coding, side-information and multi-terminal systems. Moreover, some of the network setups shown demonstrate how lattice codes are potentially more efficient than traditional random-coding solutions, for instance when generalising the framework to Gaussian networks.
This book is tailored to fulfil the requirements in the area of the signal processing in communication systems. The book contains numerous examples, solved problems and exercises to explain the methodology of Fourier ...
详细信息
ISBN:
(数字)9781608058303
ISBN:
(纸本)9781608058310
This book is tailored to fulfil the requirements in the area of the signal processing in communication systems. The book contains numerous examples, solved problems and exercises to explain the methodology of Fourier Series, Fourier Analysis, Fourier Transform and properties, Fast Fourier Transform FFT, Discrete Fourier Transform DFT and properties, Discrete Cosine Transform DCT, Discrete Wavelet Transform DWT and Contourlet Transform CT. The book is characterized by three directions, the communication theory and signal processing point of view, the mathematical point of view and utility computer programs. The contents of this book include chapters in communication system and signals, Fourier Series and Power Spectra, Fourier Transform and Energy Spectra, Fourier Transform and Power Spectra, Correlation Function and Spectral Density, Signal Transmission and Systems, Hilbert Transform, Narrow Band-Pass Signals and Systems and Numerical Computation of Transform coding. This book is intended for undergraduate students in institutes, colleges, universities and academies who want to specialize in the field of communication systems and signal processing. The book will also be very useful to engineers of graduate and post graduate studies as well as researchers in research centers since it contains a great number of mathematical operations that are considered important in research results.
A new scheme of quantum key distribution （QKD） using frequency and time coding is proposed, in which the security is based on the frequency-time uncertainty relation. In this scheme, the binary information sequence ...
详细信息
A new scheme of quantum key distribution （QKD） using frequency and time coding is proposed, in which the security is based on the frequency-time uncertainty relation. In this scheme, the binary information sequence is encoded randomly on either the centrM frequency or the time delay of the optical pulse at the sender. The central frequency of the single photon pulse is set as w1 for bit 0 and set as w2 for bit 1 when frequency coding is selected. However, the single photon pulse is not delayed for bit 0 and is delayed in τ for 1 when time coding is selected. At the receiver, either the frequency or the time delay of the pulse is measured randomly, and the final key is obtained after basis comparison, data reconciliation and privacy amplification. With the proposed method, the effect of the noise in the fiber channel and environment on the QKD system can be reduced effectively.
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. coding efficiency depends strongly on the accuracy of...
详细信息
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. coding efficiency depends strongly on the accuracy of this correlation estimation. While error in estimation is inevitable, the impact of estimation error on compression efficiency has not been sufficiently studied for the DSC problem. In this paper, we study correlation estimation subject to rate and complexity constraints, and its impact on coding efficiency in a DSC framework for practical distributed image and video applications. We focus on, in particular, applications where binary correlation models are exploited for Slepian-Wolf coding and sampling techniques are used to estimate the correlation, while extensions to other correlation models would also be briefly discussed. In the first part of this paper, we investigate the compression of binary data. We first propose a model to characterize the relationship between the number of samples used in estimation and the coding rate penalty, in the case of encoding of a single binary source. The model is then extended to scenarios where multiple binary sources are compressed, and based on the model we propose an algorithm to determine the number of samples allocated to different sources so that the overall rate penalty can be minimized, subject to a constraint on the total number of samples. The second part of this paper studies compression of continuous-valued data. We propose a model-based estimation for the particular but important situations where binary bit-planes are extracted from a continuous-valued input source, and each bit-plane is compressed using DSC. The proposed model-based method first estimates the source and correlation noise models using continuous-valued samples, and then uses the models to derive the bit-plane statistics analytically. We also extend the model-based estimation to the cases when bit-planes are extracted based on the sig
We consider the task of multiparty computation performed over networks in the presence of random noise. Given an n-party protocol that takes R rounds assuming noiseless communication, the goal is to find a coding sche...
详细信息
We consider the task of multiparty computation performed over networks in the presence of random noise. Given an n-party protocol that takes R rounds assuming noiseless communication, the goal is to find a coding scheme that takes R rounds and computes the same function with high probability even when the communication is noisy, while maintaining a constant asymptotic rate, i.e., while keeping lim infn, R.8 R/ R positive. Rajagopalan and Schulman (STOC'94) were the first to consider this question, and provided a coding scheme with rate O(1/ log(d + 1)), where d is the maximal degree in the network. While that scheme provides a constant rate coding for many practical situations, in the worst case, e.g., when the network is a complete graph, the rate is O(1/ log n), which tends to 0 as n tends to infinity. We revisit this question and provide an efficient coding scheme with a constant rate for the interesting case of fully connected networks. We furthermore extend the result and show that if a (d-regular) network has mixing time m, then there exists an efficient coding scheme with rate O(1/ m3 logm). This implies a constant rate coding scheme for any n-party protocol over a d-regular network with a constant mixing time, and in particular for random graphs with n vertices and degrees nO(1).
Three-dimensional manifold element generation and contact detection algorithm between blocks are the bottleneck for the development of three-dimensional numerical manifold method (NMM). For building mathematics cover,...
详细信息
Three-dimensional manifold element generation and contact detection algorithm between blocks are the bottleneck for the development of three-dimensional numerical manifold method (NMM). For building mathematics cover, the technology of three-dimensional finite element mesh generation is utilized in the paper. Aiming at the characteristics of complex formation and difficult identification of three-dimensional manifold block, three-dimensional manifold cutting technology is developed. It is important to achieve the coding of mathematical cover (MC) and physical cover (PC) for NMM, which directly determines the correctness of three-dimensional manifold element generation. Based on the character that the coding of three-dimensional manifold is the same as two-dimensional field essentially, coding algorithm of PC system proposed by Dr. Shi is extended to be three-dimensional. A three-dimensional manifold cutting program 3D MC.f90 is developed in this paper, which can generate an arbitrary three-dimensional manifold element under tetrahedral and hexahedral mesh cover. Several examples are made, and results show that three-dimensional manifold block shape and the coding of manifold node and element generated by three-dimensional manifold cutting program all agree well with the definition of three-dimensional manifold element.
This correspondence examines the performance of Block-Coded Modulation (BCM) at finite decoded bit error rates (BER). We consider the optimum geometric structure to optimize coding gain at finite BER, rather than asym...
详细信息
This correspondence examines the performance of Block-Coded Modulation (BCM) at finite decoded bit error rates (BER). We consider the optimum geometric structure to optimize coding gain at finite BER, rather than asymptotic coding gain. We introduce the concept of the ''row BER'' and show that this structure may be implemented by a BCM scheme in which the row bit-error rates are equalized. We present a design procedure for such schemes, and show that significant improvements over conventional schemes are possible.
暂无评论