30,473 research outputs found
Fast decoding of a d(min) = 6 RS code
A method for high speed decoding a d sub min = 6 Reed-Solomon (RS) code is presented. Properties of the two byte error correcting and three byte error detecting RS code are discussed. Decoding using a quadratic equation is shown. Theorems and concomitant proofs are included to substantiate this decoding method
On the undetected error probability of a concatenated coding scheme for error control
Consider a concatenated coding scheme for error control on a binary symmetric channel, called the inner channel. The bit error rate (BER) of the channel is correspondingly called the inner BER, and is denoted by Epsilon (sub i). Two linear block codes, C(sub f) and C(sub b), are used. The inner code C(sub f), called the frame code, is an (n,k) systematic binary block code with minimum distance, d(sub f). The frame code is designed to correct + or fewer errors and simultaneously detect gamma (gamma +) or fewer errors, where + + gamma + 1 = to or d(sub f). The outer code C(sub b) is either an (n(sub b), K(sub b)) binary block with a n(sub b) = mk, or an (n(sub b), k(Sub b) maximum distance separable (MDS) code with symbols from GF(q), where q = 2(b) and the code length n(sub b) satisfies n(sub)(b) = mk. The integerim is the number of frames. The outercode is designed for error detection only
An extended d(min) = 4 RS code
A minimum distance d sub m - 4 extended Reed - Solomon (RS) code over GF (2 to the b power) was constructed. This code is used to correct any single byte error and simultaneously detect any double byte error. Features of the code; including fast encoding and decoding, are presented
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
Fast decoding techniques for extended single-and-double-error-correcting Reed Solomon codes
A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. For example, some 256K-bit dynamic random access memories are organized as 32K x 8 bit-bytes. Byte-oriented codes such as Reed Solomon (RS) codes provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. Some special high speed decoding techniques for extended single and double error correcting RS codes. These techniques are designed to find the error locations and the error values directly from the syndrome without having to form the error locator polynomial and solve for its roots
Tripartite Graph Clustering for Dynamic Sentiment Analysis on Social Media
The growing popularity of social media (e.g, Twitter) allows users to easily
share information with each other and influence others by expressing their own
sentiments on various subjects. In this work, we propose an unsupervised
\emph{tri-clustering} framework, which analyzes both user-level and tweet-level
sentiments through co-clustering of a tripartite graph. A compelling feature of
the proposed framework is that the quality of sentiment clustering of tweets,
users, and features can be mutually improved by joint clustering. We further
investigate the evolution of user-level sentiments and latent feature vectors
in an online framework and devise an efficient online algorithm to sequentially
update the clustering of tweets, users and features with newly arrived data.
The online framework not only provides better quality of both dynamic
user-level and tweet-level sentiment analysis, but also improves the
computational and storage efficiency. We verified the effectiveness and
efficiency of the proposed approaches on the November 2012 California ballot
Twitter data.Comment: A short version is in Proceeding of the 2014 ACM SIGMOD International
Conference on Management of dat
Universal Quantum Degeneracy Point for Superconducting Qubits
The quantum degeneracy point approach [D. Vion et al., Science 296, 886
(2002)] effectively protects superconducting qubits from low-frequency noise
that couples with the qubits as transverse noise. However, low-frequency noise
in superconducting qubits can originate from various mechanisms and can couple
with the qubits either as transverse or as longitudinal noise. Here, we present
a quantum circuit containing a universal quantum degeneracy point that protects
an encoded qubit from arbitrary low-frequency noise. We further show that
universal quantum logic gates can be performed on the encoded qubit with high
gate fidelity. The proposed scheme is robust against small parameter spreads
due to fabrication errors in the superconducting qubits.Comment: 7 pages, 4 figure
Quantum secret sharing between m-party and n-party with six states
We propose a quantum secret sharing scheme between -party and -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 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 th member of group 1) sends 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
Water productivity in Zhanghe Irrigation System: issues of scale
Irrigation systemsWater productivityReservoirsWater useWater stressWater conservationRicePaddy fieldsCrop yield
- …