Error control for reliable digital data transmission and storage systems

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K-bit DRAM's are organized in 32Kx8 bit-bytes. Byte oriented codes such as Reed Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. In this paper we present some special decoding techniques for extended single-and-double-error-correcting RS codes which are capable of high speed operation. These techniques are designed to find the error locations and the error values directly from the syndrome without having to use the iterative alorithm to find the error locator polynomial. Two codes are considered: (1) a d sub min = 4 single-byte-error-correcting (SBEC), double-byte-error-detecting (DBED) RS code; and (2) a d sub min = 6 double-byte-error-correcting (DBEC), triple-byte-error-detecting (TBED) RS code

Characterising Probabilistic Processes Logically

In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the modal mu-calculus and show how to derive characteristic formulae for various simulation-like preorders over finite-state processes without divergence. In addition, we show that even without the fixpoint operators this probabilistic mu-calculus can be used to characterise these behavioural relations in the sense that two states are equivalent if and only if they satisfy the same set of formulae.Comment: 18 page

Quantum secret sharing between m-party and n-party with six states

We propose a quantum secret sharing scheme between $m$-party and $n$-party using three conjugate bases, i.e. six states. A sequence of single photons, each of which is prepared in one of the six states, is used directly to encode classical information in the quantum secret sharing process. In this scheme, each of all $m$ members in group 1 choose randomly their own secret key individually and independently, and then directly encode their respective secret information on the states of single photons via unitary operations, then the last one (the $m$th member of group 1) sends $1/n$ of the resulting qubits to each of group 2. By measuring their respective qubits, all members in group 2 share the secret information shared by all members in group 1. The secret message shared by group 1 and group 2 in such a way that neither subset of each group nor the union of a subset of group 1 and a subset of group 2 can extract the secret message, but each whole group (all the members of each group) can. The scheme is asymptotically 100% in efficiency. It makes the Trojan horse attack with a multi-photon signal, the fake-signal attack with EPR pairs, the attack with single photons, and the attack with invisible photons to be nullification. We show that it is secure and has an advantage over the one based on two conjugate bases. We also give the upper bounds of the average success probabilities for dishonest agent eavesdropping encryption using the fake-signal attack with any two-particle entangled states. This protocol is feasible with present-day technique.Comment: 7 page

Circular quantum secret sharing

A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three. We describe the process of this protocol and discuss its security when the quantum information carrying is polarized single photons running circularly. It will be shown that entanglement is not necessary for quantum secret sharing. Moreover, the theoretic efficiency is improved to approach 100% as almost all the instances can be used for generating the private key, and each photon can carry one bit of information without quantum storage. It is straightforwardly to utilize this topological structure to complete quantum secret sharing with multi-level two-particle entanglement in high capacity securely.Comment: 7 pages, 2 figure

Well-posedness of the Viscous Boussinesq System in Besov Spaces of Negative Order Near Index s=−1s=-1

This paper is concerned with well-posedness of the Boussinesq system. We prove that the $n$ ($n\ge2$) dimensional Boussinesq system is well-psoed for small initial data $(\vec{u}_0,\theta_0)$ ($\nabla\cdot\vec{u}_0=0$) either in $({B}^{-1}_{\infty,1}\cap{B^{-1,1}_{\infty,\infty}})\times{B}^{-1}_{p,r}$ or in ${B^{-1,1}_{\infty,\infty}}\times{B}^{-1,\epsilon}_{p,\infty}$ if $r\in[1,\infty]$, $\epsilon>0$ and $p\in(\frac{n}{2},\infty)$, where $B^{s,\epsilon}_{p,q}$ ($s\in\mathbb{R}$, $1\leq p,q\leq\infty$, $\epsilon>0$) is the logarithmically modified Besov space to the standard Besov space $B^{s}_{p,q}$. We also prove that this system is well-posed for small initial data in $({B}^{-1}_{\infty,1}\cap{B^{-1,1}_{\infty,\infty}})\times({B}^{-1}_{\frac{n}{2},1}\cap{B^{-1,1}_{\frac{n}{2},\infty}})$.Comment: 18 page

Water productivity in Zhanghe Irrigation System: issues of scale

Irrigation systemsWater productivityReservoirsWater useWater stressWater conservationRicePaddy fieldsCrop yield