In this work, we observe the behavior of block space-time code in wireless channel dynamics. The block space-time code is optimally constructed in slow fading. The block code in quasi-static fading channels provides affordable complexity in design and construction. Our results show that the performance of the block space-time code may not be as good as conventionally convolutional coding with s...

Let F2m be a finite field of characteristic 2 and R = F2m [u]/〈u 〉 = F2m + uF2m + . . . + u k−1 F2m (u k = 0) where k ∈ Z satisfies k ≥ 2. For any odd positive integer n, it is known that cyclic codes over R of length 2n are identified with ideals of the ring R[x]/〈x − 1〉. In this paper, an explicit representation for each cyclic code over R of length 2n is provided and a formula to count the n...

Studies on the binary block codes generated by some ordered algebraic structures have been interest of many researchers. In this paper, we study code an arbitrary JU-algebra and investigate its properties. For intent, introduce notion a JU function \(\phi\) nonempty set P into X, using that concept, j-functions j-subsets for element j X are investigated. Furthermore, define new order C based sh...

Attacks on double block length hash functions using a block cipher are considered in this paper. We present a general free-start attack, in which the attacker is free to choose the initial value, and a real attack on a large class of hash functions. Recent results on the complexities of attacks on double block hash functions are summarized.

In this paper, we will present an estimation for the upper-bound of the amount of 16-bytes plaintexts for English texts, that is not sufficient large make clear that the block ciphers with block length no more than 16-bytes will be subject to recover plaintext attacks in the occasions of plaintext -known or plaintext-chosen attacks.

This paper introduces a super-orthogonal space-time block code (STBC). The code construction is based on the expansion of orthogonal block code via a unitary matrix transformation. By expanding the orthogonal block code, both the code rate can be increased and the performance improved in terms of Eb/N0, with a moderate increase of the receiver complexity. Exploiting the partial orthogonality of...

State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states produced a single improved [formula: see text] state given 15 input copies. New block code state distillation methods can produce k improved [formula: see text] states given 3k + 8 input copies, ...

ETRI Journal, Volume 28, Number 5, October 2006 ABSTRACT⎯The effect of block interleaving in a low density parity check (LDPC)-turbo concatenated code is investigated in this letter. Soft decoding can be used in an LDPC code unlike the conventional Reed-Solomon (RS) code. Thus, an LDPC-turbo concatenated code can show better performance than the conventional RS-turbo concatenated code. Furtherm...