A decoding procedure which improves code rate and error corrections

Corresponding to $C_{0}[n,n-r]$, a binary cyclic code generated by a primitive irreducible polynomial $p(X)\in \mathbb{F}_{2}[X]$ of degree $r=2b$, where $b\in \mathbb{Z}^{+}$, we can constitute a binary cyclic code $C[(n+1)^{3^{k}}-1,(n+1)^{3^{k}}-1-3^{k}r]$, which is generated by primitive irreducible generalized polynomial $p(X^{\frac{1}{3^{k}}})\in \mathbb{F}_{2}[X;\frac{1}{3^{k}}\mathbb{Z}_{0}]$ with degree $3^{k}r$, where $k\in \mathbb{Z}^{+}$. This new code $C$ improves the code rate and has error corrections capability higher than $C_{0}$. The purpose of this study is to establish a decoding procedure for $C_{0}$ by using $C$ in such a way that one can obtain an improved code rate and error-correcting capabilities for $C_{0}$.

Construction and decoding of BCH codes over finite commutative rings

BCH codes over arbitrary finite commutative rings with identity are derived in terms of their locator vector. The derivation is based on the factorization of xs -1 over the unit ring of an appropriate extension of the finite ring. We present an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, for these codes. The code construction and the decoding procedures are very similar to the BCH codes over finite integer rings. © 1999 Elsevier B.V. All rights reserved.

A Cryptosystem Using the Concepts of Algebraic Geometric Code

Cryptosystem using linear codes was developed in 1978 by Mc-Eliece. Later in 1985 Niederreiter and others developed a modified version of cryptosystem using concepts of linear codes. But these systems were not used frequently because of its larger key size. In this study we were designing a cryptosystem using the concepts of algebraic geometric codes with smaller key size. Error detection and correction can be done efficiently by simple decoding methods using the cryptosystem developed. Approach: Algebraic geometric codes are codes, generated using curves. The cryptosystem use basic concepts of elliptic curves cryptography and generator matrix. Decrypted information takes the form of a repetition code. Due to this complexity of decoding procedure is reduced. Error detection and correction can be carried out efficiently by solving a simple system of linear equations, there by imposing the concepts of security along with error detection and correction. Results: Implementation of the algorithm is done on MATLAB and comparative analysis is also done on various parameters of the system. Attacks are common to all cryptosystems. But by securely choosing curve, field and representation of elements in field, we can overcome the attacks and a stable system can be generated. Conclusion: The algorithm defined here protects the information from an intruder and also from the error in communication channel by efficient error correction methods.

Goppa and Srivastava codes over finite rings

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Alternant and BCH codes over certain rings

Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms of parity-check matrices. The derivation is based on the factorization of x s - 1 over the unit group of an appropriate extension of the finite ring. An efficient decoding procedure which makes use of the modified Berlekamp-Massey algorithm to correct errors and erasures is presented. Furthermore, we address the construction of BCH codes over Zm under Lee metric.

Hamming and Reed-Solomon codes over certain rings

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A BCH code and a sequence of cyclic codes

This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has length 2m−1(n + 1)n and is generated by a generalized polynomial g(x 1 2m ) ∈ F2[x, 1 2m Z≥0] of degree 2mr. Furthermore, C0 n is embedded in Cm 2m−1(n+1)n and Cm 2m−1(n+1)n is embedded in Cm+1 2m(n+1)n for each m ≥ 1. By a newly proposed algorithm, codewords of the binary BCH code C0 n can be transmitted with high code rate and decoded by the decoder of any member of the family {Cm 2m−1(n+1)n}m≥1 of binary cyclic codes, having the same code rate.

Distributed sensor failure detection in sensor networks

We investigate the problem of distributed sensors' failure detection in networks with a small number of defective sensors, whose measurements differ significantly from the neighbor measurements. We build on the sparse nature of the binary sensor failure signals to propose a novel distributed detection algorithm based on gossip mechanisms and on Group Testing (GT), where the latter has been used so far in centralized detection problems. The new distributed GT algorithm estimates the set of scattered defective sensors with a low complexity distance decoder from a small number of linearly independent binary messages exchanged by the sensors. We first consider networks with one defective sensor and determine the minimal number of linearly independent messages needed for its detection with high probability. We then extend our study to the multiple defective sensors detection by modifying appropriately the message exchange protocol and the decoding procedure. We show that, for small and medium sized networks, the number of messages required for successful detection is actually smaller than the minimal number computed theoretically. Finally, simulations demonstrate that the proposed method outperforms methods based on random walks in terms of both detection performance and convergence rate.

Stabilizer formalism for operator quantum error correction

Operator quantum error correction is a recently developed theory that provides a generalized and unified framework for active error correction and passive error avoiding schemes. In this Letter, we describe these codes using the stabilizer formalism. This is achieved by adding a gauge group to stabilizer codes that defines an equivalence class between encoded states. Gauge transformations leave the encoded information unchanged; their effect is absorbed by virtual gauge qubits that do not carry useful information. We illustrate the construction by identifying a gauge symmetry in Shor's 9-qubit code that allows us to remove 3 of its 8 stabilizer generators, leading to a simpler decoding procedure and a wider class of logical operations without affecting its essential properties. This opens the path to possible improvements of the error threshold of fault-tolerant quantum computing.

Decoding stimulus-related information from single-trial EEG responses based on voltage topographies

Neuroimaging studies typically compare experimental conditions using average brain responses, thereby overlooking the stimulus-related information conveyed by distributed spatio-temporal patterns of single-trial responses. Here, we take advantage of this rich information at a single-trial level to decode stimulus-related signals in two event-related potential (ERP) studies. Our method models the statistical distribution of the voltage topographies with a Gaussian Mixture Model (GMM), which reduces the dataset to a number of representative voltage topographies. The degree of presence of these topographies across trials at specific latencies is then used to classify experimental conditions. We tested the algorithm using a cross-validation procedure in two independent EEG datasets. In the first ERP study, we classified left- versus right-hemifield checkerboard stimuli for upper and lower visual hemifields. In a second ERP study, when functional differences cannot be assumed, we classified initial versus repeated presentations of visual objects. With minimal a priori information, the GMM model provides neurophysiologically interpretable features - vis à vis voltage topographies - as well as dynamic information about brain function. This method can in principle be applied to any ERP dataset testing the functional relevance of specific time periods for stimulus processing, the predictability of subject's behavior and cognitive states, and the discrimination between healthy and clinical populations.

Deconstructing phonological tasks:the contribution of stimulus and response type to the prediction of early decoding skills

Abstract Phonological tasks are highly predictive of reading development but their complexity obscures the underlying mechanisms driving this association. There are three key components hypothesised to drive the relationship between phonological tasks and reading; (a) the linguistic nature of the stimuli, (b) the phonological complexity of the stimuli, and (c) the production of a verbal response. We isolated the contribution of the stimulus and response components separately through the creation of latent variables to represent specially designed tasks that were matched for procedure. These tasks were administered to 570 6 to 7-year-old children along with standardised tests of regular word and non-word reading. A structural equation model, where tasks were grouped according to stimulus, revealed that the linguistic nature and the phonological complexity of the stimulus predicted unique variance in decoding, over and above matched comparison tasks without these components. An alternative model, grouped according to response mode, showed that the production of a verbal response was a unique predictor of decoding beyond matched tasks without a verbal response. In summary, we found that multiple factors contributed to reading development, supporting multivariate models over those that prioritize single factors. More broadly, we demonstrate the value of combining matched task designs with latent variable modelling to deconstruct the components of complex tasks.

Influence of spawning procedure on gametes fertilization success in Salminus hilarii Valenciennes, 1850 (Teleostei: Characidae): Implications for the conservation of this species

Artificial reproduction and gamete fertilization were evaluated in Salminus hilarii wild and domesticated broodstocks. Wild and domesticated broodstocks were artificially induced to reproduction using a carp pituitary treatment. Four groups were considered: Group 1 (G1), fish caught in the wild maintained for three years in the same conditions as the domesticated broodstocks and spawned naturally; Group 2 (G2), broodstock born and raised in captivity and spawned naturally; Group 3 (G3), wild broodstocks, which were manually stripped for gamete collection and dry fertilization; and Group 4 (G4), domesticated males and females, also manually stripped. Oocytes, eggs, and larvae were sampled at different time intervals throughout embryonic development. Yolk sac absorption occurred approximately 24-29 h after hatching. Twenty-six h after hatching, the larvae mouths opened. Cannibalism was identified just 28-30 h after hatching. There was no morphological difference in embryonic development among all groups. The number of released eggs per gram of female was: G1: 83.3 ± 24.5 and G2: 103.8 ± 37.4; however, the fertilization success was lower in G2 (42.0 ± 6.37 %) compared with G1 (54.7 ± 3.02%) (P = 0.011). Hand-stripping of oocytes was not successful and the fertilization rate was zero. The reproduction of this species in captivity is viable, but it is necessary to improve broodstock management to enhance fertilization rates and obtain better fingerling production for restocking programs.

An Environmental Friendly Procedure for Photometric Determination of Hypochlorite in Tap Water Employing a Miniaturized Multicommuted Flow Analysis Setup

A photometric procedure for the determination of ClO(-) in tap water employing a miniaturized multicommuted flow analysis setup and an LED-based photometer is described. The analytical procedure was implemented using leucocrystal violet (LCV; 4,4', 4 ''-methylidynetris (N, N-dimethylaniline), C(25)H(31)N(3)) as a chromogenic reagent. Solenoid micropumps employed for solutions propelling were assembled together with the photometer in order to compose a compact unit of small dimensions. After control variables optimization, the system was applied for the determination of ClO(-) in samples of tap water, and aiming accuracy assessment samples were also analyzed using an independent method. Applying the paired t-test between results obtained using both methods, no significant difference at the 95% confidence level was observed. Other useful features include low reagent consumption, 2.4 mu g of LCV per determination, a linear response ranging from 0.02 up to 2.0 mg L(-1) ClO(-), a relative standard deviation of 1.0% (n = 11) for samples containing 0.2 mg L(-1) ClO(-), a detection limit of 6.0 mu g L(-1) ClO(-), a sampling throughput of 84 determinations per hour, and a waste generation of 432 mu L per determination.

A simple procedure for reliability assessment of thin composite plates against buckling

In some circumstances ice floes may be modeled as beams. In general this modeling supposes constant thickness, which contradicts field observations. Action of currents, wind and the sequence of contacts, causes thickness to vary. Here this effect is taken into consideration on the modeling of the behavior of ice hitting inclined walls of offshore platforms. For this purpose, the boundary value problem is first equated. The set of equations so obtained is then transformed into a system of equations, that is then solved numerically. For this sake an implicit solution is developed, using a shooting method, with the accompanying Jacobian. In-plane coupling and the dependency of the boundary terms on deformation, make the problem non-linear and the development particular. Deformation and internal resultants are then computed for harmonic forms of beam profile. Forms of giving some additional generality to the problem are discussed.

Influence of temperature and excitation procedure on the athermal behavior of Nd(3+)-doped phosphate glass: Thermal lens, interferometric, and calorimetric measurements

In this work, thermal and optical properties of the commercial Q-98 neodymium-doped phosphate glass have been measured at low temperature, from 50 to 300 K. The time-resolved thermal lens spectrometry together with the optical interferometry and the thermal relaxation calorimetry methods were used to investigate the glass athermal characteristics described by the temperature coefficient of the optical path length change, ds/dT. The thermal diffusivity was also determined, and the temperature coefficients of electronic polarizability, linear thermal expansion, and refractive index were calculated and used to explain ds/dT behavior. ds/dT measured via thermal lens method was found to be zero at 225 K. The results provided a complete characterization of the thermo-optical properties of the Q-98 glass, which may be useful for those using this material for diode-pumped solid-state lasers. (C) 2009 American Institute of Physics. [doi: 10.1063/1.3234396]