structure. All three groups displayed negative transfer to random material in block 7, and positive transfer to block 8, which is constructed as blocks 1–6. The crucial test of transfer involves new material with different surface structure but the same abstract structure in blocks 9 and 10. The schizophrenic group showed no evidence of use of the abstract information in blocks 9 and 10, as was...

EDICS Category: SAS-MALN Abstract—The performance of sparse signal recovery can be improved if both sparsity and correlation structure of signals can be exploited. One typical correlation structure is intra-block correlation in block sparse signals. To exploit this structure, a framework, called block sparse Bayesian learning (BSBL) framework, has been proposed recently. Algorithms derived from...

Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differential cryptanalysis and boomerang attack. Though such an attack might not be the best attack available, its complexity is still less than that of the exhaustive search. In impossible boomerang attack, impossible boomer...

Based on a compressed linear quad tree, a data structure is proposed which is more than a structure to compress a gray-level or color image, but a structure, which can be applied to retrieve a block image. This compressed linear quadtree may directly extract a detailed block image without decompressing the compressed data of the original image.

Novel diblock copolymers based on poly(isobutyl methacrylate) (PiBMA) and poly[2,5di(isopropyloxycarbonyl)styrene] (PiPCS) were designed and prepared via consecutive atom transfer radical polymerization. They had relatively low molecular weight distributions and tunable molecular weights. The molecular characterization of the copolymers was performed with proton nuclear magnetic resonance spect...

Explicitly using the block structure of the unknown signal can achieve better recovery performance in compressive censing. An unknown signal with block structure can be accurately recovered from underdetermined linear measurements provided that it is sufficiently block sparse. However, in practice, the block sparsity level is typically unknown. In this paper, we consider a soft measure of block...

Many Classical and modern cryptographic algorithms have been developed by the Cryptographers to facilitate data security operations. Classical ciphers are not being widely used because of limited key space. Public key cryptosystems are effective compare to symmetric systems but are slower than symmetric ciphers. Feistel Cipher structure is the reference structure for designing block-ciphers. In...

The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decodin...

The product code proposed in this chapter is constructed by using time-invariant convolutional code. Its component codes’ trellis structure does not vary in time as in product codes constructed with Hamming, BCH, and Reed Solomon block codes. Moreover, the number of states in the trellis structure of a block code may grow exponentially with the difference of codeword and data block lengths, whe...