A new Galois field GF ( 2 ) structure for designing recursive systematic convolutional (RSC) encoders is presented in this article. The proposed RSC encoders are used as components of a parallel-concatenated Turbo trellis coded modulation (TTCM) scheme. The GF ( 2 ) RSC encoders include a nonlinear function named leftcirculate (LCIRC), which is performing a left circulation over the N bits repr...

where l(x) is the length of codeword c(x) for a symbol x ∈ X , and p(x) is the probability of the symbol. Intuitively, a good code should preserve the information content of an outcome. Since information content depends on the probability of the outcome (it is higher if probability is lower, or equivalently if the outcome is very uncertain), a good codeword will use fewer bits to encode a certa...

Cloud computing is a model for enabling convenient, on demand network access to a shared pool of computing resources. The cloud storage system consists of a collection of storage servers and key servers. Storing data in a third party cloud system causes serious concern on data confidentiality, so a user divides the data into blocks, encrypts and stores them in various storage servers. The stora...

A fixed length code is called immutable if no codeword can be transformed into another codeword by using only a restricted set of symbol changes. Immutable codes are used to prevent undetectable updates of information stored over write-once memories 1141. In this paper we consider immutable codes on the alphabet Q = (0, . . . , q11. We prove that a maximum size immutable code of block length n ...

Luby Transform (LT) codes are more important in communication applications due to the characteristics of fast encoding/decoding process, and low complexity. However, LT codes are optimal only when the number of input symbols is close to infinity. Some researches modified the degree distribution of LT codes to make LT codes suitable for short symbol length. In this article, we propose an optimal...

In this section we wish to prove that there exists a network code, given an acyclic graph. Lets assume we have a graph, as shown in 4.1 above, where each node in the network has a local encoding matrix Aij(α), where α = (α1, α2, . . .) is the vector of coefficients of the linear encoding matrices. We want to show that there exists α such that the global end-to-end matrices {Ai(α), i = 1, . . . ...

This paper presents an efficient and general framework for code compression for embedded systems. The method is based on simple Huffman encoding, but where limited yet powerful higher-order correlations are captured and exploited by using architecture-oriented models. The proposed symbol formation, modeling and encoding steps together achieve high-quality code compression, yet the decoding proc...

Current rateless codes coding schemes ignored the order recovery of packets. To cope with this problem, average delay and maximum memory consumption were proposed as performance indices to characterize the order recovery performance, then a coding scheme based on two stages coding was proposed to improve the order recovery performance. Encoding of the front k coded symbols is the first stage, w...