Offers a comprehensive introduction to the fundamental structures and applications of a wide range of contemporary coding operations This book offers a comprehensive introduction to the fundamental structures and appl...
详细信息
ISBN:
(数字)9781118960523
ISBN:
(纸本)9781118881446
Offers a comprehensive introduction to the fundamental structures and applications of a wide range of contemporary coding operations This book offers a comprehensive introduction to the fundamental structures and applications of a wide range of contemporary coding operations. This text focuses on the ways to structure information so that its transmission will be in the safest, quickest, and most efficient and error-free manner possible. All coding operations are covered in a single framework, with initial chapters addressing early mathematical models and algorithmic developments which led to the structure of code. After discussing the general foundations of code, chapters proceed to cover individual topics such as notions of compression, cryptography, detection, and correction codes. Both classical coding theories and the most cutting-edge models are addressed, along with helpful exercises of varying complexities to enhance comprehension. Explains how to structure coding information so that its transmission is safe, error-free, efficient, and fast Includes a pseudo-code that readers may implement in their preferential programming language Features descriptive diagrams and illustrations, and almost 150 exercises, with corrections, of varying complexity to enhance comprehension Foundations of coding: Compression, Encryption, Error-Correction is an invaluable resource for understanding the various ways information is structured for its secure and reliable transmission in the 21st-century world.
In this paper a novel (t, n) threshold image secret sharing scheme is proposed. Based on the idea that there is close connection between secret sharing and coding theory, coding method on GF(2m) is applied in our sche...
详细信息
In this thesis, we produce our work on two of the state-of-the-art techniques in modern coding theory: polar codes and spatially-coupled LDPC codes. Polar codes were introduced in 2009 and proven to achieve the symmet...
详细信息
In this thesis, we produce our work on two of the state-of-the-art techniques in modern coding theory: polar codes and spatially-coupled LDPC codes. Polar codes were introduced in 2009 and proven to achieve the symmetric capacity of any binary-input discrete memoryless channel under low-complexity successive cancellation decoding. Since then, finite length (non-asymptotic) performance has been the primary concern with respect to polar codes. In this work, we construct cyclic polar codes based on a mixed-radix Cooley-Tukey decomposition of the Galois field Fourier transform. The main results are: we can, for the first time, construct, encode and decode polar codes that are cyclic, with their blocklength being arbitrary; for a given target block erasure rate, we can achieve significantly higher code rates on the erasure channel than the original polar codes, at comparable blocklengths; on the symmetric channel with only errors, we can perform much better than equivalent rate Reed-Solomon codes with the same blocklength, by using soft-decision decoding; and, since the codes are subcodes of higher rate RS codes, a RS decoder can be used if suboptimal performance suffices for the application as a trade-off for higher decoding speed. The programs developed for this work can be accessed at https: //github. com/nrenga/cyclic_polar. In 2010, it was shown that spatially-coupled low-density parity-check (LDPC) codes approach the capacity of binary memoryless channels, asymptotically, with belief-propagation (BP) decoding. In our work, we are interested in the finite length average performance of randomly coupled LDPC ensembles on binary erasure chan- nels with memory. The significant contributions of this work are: tight lower bounds for the block erasure probability (P B ) under various scenarios for the burst pattern; bounds focused on practical scenarios where a burst affects exactly one of the coupled codes; expected error floor for the bit erasure probability (P b ) on th
Human action recognition in wireless sensor networks (WSN) is an attractive direction due to its wide applications. However, human actions captured from different sensor nodes in WSN show different views, and the perf...
详细信息
Human action recognition in wireless sensor networks (WSN) is an attractive direction due to its wide applications. However, human actions captured from different sensor nodes in WSN show different views, and the performance of classifier tends to degrade sharply. In this paper, we focus on the issue of cross-view action recognition in WSN and propose a novel algorithm named discriminative transferable sparse coding (DTSC) to overcome the drawback. We learn the sparse representation with an explicit discriminative goal, making the proposed method suitable for recognition. Furthermore, we simultaneously learn the dictionaries from different sensor nodes such that the same actions from different sensor nodes have similar sparse representations. Our method is verified on the IXMAS datasets, and the experimental results demonstrate that our method achieves better results than that of previous methods on cross-view action recognition in WSN.
Recognizing human action in wireless sensor networks (WSN) has raised a great interest owing to the requirements of real-world applications. Recently, the bag-of-features model (BOF) has proved effective in human acti...
详细信息
Recognizing human action in wireless sensor networks (WSN) has raised a great interest owing to the requirements of real-world applications. Recently, the bag-of-features model (BOF) has proved effective in human action recognition. In this paper, we propose a novel method named local random sparse coding (LRSC) for human action recognition in WSN based on the BOF model. The contribution is twofold. First, we utilize random projection (RP) technique for each feature vector to alleviate the curse of dimensionality. Second, we consider the locality of codebook and correspondingly propose to reconstruct the features using similar codewords. Our method is verified on the KTH and UCF Sports databases, and the experimental results demonstrate that our method achieves better results than that of previous methods on human action recognition in WSN.
With the development of space technology, asteroid exploration will become a hotspot in the deep space exploration field. Space flight trajectory has the following requirements: needing a long time, having many engine...
详细信息
With the development of space technology, asteroid exploration will become a hotspot in the deep space exploration field. Space flight trajectory has the following requirements: needing a long time, having many engineering constraints, having a large number of targets, and having a series of feasible solutions. So how to find the global optimum flight program is the core issue of the deep space exploration trajectory design. This paper proposes a novel method to design the optimal trajectory by differential evolution (DE) algorithm for asteroid exploration based on mixed coding. In our method, the celestial sequence and the time sequence are coded together into the chromosomes of DE and optimized them simultaneously. The chromosomes are designed to include four parts: the celestial sequence, the exploration type, the time sequence, and the return time. The algorithm can make full use of the characteristics of the high efficiency and global optimization ability of differential evolution and can also avoid the problem of high complexity of the branch-and-bound algorithm and the problem of nonglobal optimal solution of the greedy algorithm. The algorithm is adopted to solve the Fourth Contest of National Space Orbit Design in China, and the result shows that both the computational efficiency and the performance of the algorithm are superior.
We study the performance of a partially correlated amplitude damping channel acting on two qubits. We derive lower bounds for the single-shot classical capacity by studying two kinds of quantum ensembles, one which al...
详细信息
We study the performance of a partially correlated amplitude damping channel acting on two qubits. We derive lower bounds for the single-shot classical capacity by studying two kinds of quantum ensembles, one which allows us to maximize the Holevo quantity for the memoryless channel and the other allowing the same task but for the full-memory channel. In these two cases we also show the amount of entanglement which is involved in achieving the maximum of the Holevo quantity. For the single-shot quantum capacity we discuss both a lower and an upper bound, achieving a good estimate for high values of the channel transmissivity. We finally compute the entanglement-assisted classical channel capacity.
We present an approach for the modelling and simulating of the modem section of underwater sensor networks. The proposal is based on a specially designed modem architecture and the use of simulation tools and models t...
详细信息
We present an approach for the modelling and simulating of the modem section of underwater sensor networks. The proposal is based on a specially designed modem architecture and the use of simulation tools and models that represent each of the communication elements: the water medium, physical transducers, electronics, and coding/decoding software. The algorithms can be simulated in the modelling environment;this framework does not require recoding and allows the combination of real and modelled elements. In physical terms, the modem engine provides a decoupled pipelined design of the processing path for the algorithms which allows users to run complex algorithms without requiring a highly demanding specific hardware. The proposal includes a methodology that has allowed us to significantly reduce the effort required in the process, from algorithm development to the effective deployment of the system. As a case study, this paper shows its application and results in the evaluation of a multipath and Doppler-shift correction algorithms.
This study presents a new steady-state visual evoked potential (SSVEP) paradigm for brain computer interface (BCI) systems. The new paradigm is High-Frequency Combination coding-Based SSVEP (HFCC-SSVEP). The goal of t...
详细信息
This study presents a new steady-state visual evoked potential (SSVEP) paradigm for brain computer interface (BCI) systems. The new paradigm is High-Frequency Combination coding-Based SSVEP (HFCC-SSVEP). The goal of this study is to increase the number of targets using fewer stimulation frequencies, with diminishing subject's fatigue and reducing the risk of photosensitive epileptic seizures. This paper investigated the HFCC-SSVEP high-frequency response (beyond 25 Hz) for 3 frequencies (25 Hz, 33.33 Hz, and 40 Hz). HFCC-SSVEP produces n(n) with n high stimulation frequencies through Time Series Combination Code. Furthermore, The Improved Hilbert-Huang Transform (IHHT) is adopted to extract time-frequency feature of the proposed SSVEP response. Lastly, the differentiation combination (DC) method is proposed to select the combination coding sequence in order to increase the recognition rate;as a result, IHHT algorithm and DC method for the proposed SSVEP paradigm in this study increase recognition efficiency so as to improve ITR and increase the stability of the BCI system. Furthermore, SSVEPs evoked by high-frequency stimuli (beyond 25 Hz) minimally diminish subject's fatigue and prevent safety hazards linked to photo-induced epileptic seizures. This study tests five subjects in order to verify the feasibility of the proposed method.
We present an analysis of the different types of noise from the detection and interrogation laser in our strontium lattice clock. We develop a noise model showing that in our setup quantum projection noise-limited det...
详细信息
We present an analysis of the different types of noise from the detection and interrogation laser in our strontium lattice clock. We develop a noise model showing that in our setup quantum projection noise-limited detection is possible if more than 130 atoms are interrogated. Adding information about the noise spectrum of our clock laser with sub-10−16 fractional frequency instability allows one to infer the clock stability for different modes of operation. Excellent agreement with experimental observations for the instability of the difference between two interleaved stabilizations is found. We infer a clock instability of 1.6×10−16/τ as a function of averaging time τ expressed in seconds for normal clock operation.
暂无评论