Constructions of codes through the semigroup ring B[X; 1/2(2)Z(0)] and encoding

For any finite commutative ring B with an identity there is a strict inclusion B[X; Z(0)] subset of B[X; Z(0)] subset of B[X; 1/2(2)Z(0)] of commutative semigroup rings. This work is a continuation of Shah et al. (2011) [8], in which we extend the study of Andrade and Palazzo (2005) [7] for cyclic codes through the semigroup ring B[X; 1/2; Z(0)] In this study we developed a construction technique of cyclic codes through a semigroup ring B[X; 1/2(2)Z(0)] instead of a polynomial ring. However in the second phase we independently considered BCH, alternant, Goppa, Srivastava codes through a semigroup ring B[X; 1/2(2)Z(0)]. Hence we improved several results of Shah et al. (2011) [8] and Andrade and Palazzo (2005) [7] in a broader sense. Published by Elsevier Ltd

A Note on Linear Codes over Semigroup Rings

In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes through the semigroup ring B[X; 1 3Z0] instead of the polynomial ring B[X; Z0], where B is a finite commutative ring with identity, and for these constructions we improve the several results of [1]. After this, we present a decoding principle for BCH, alternant and Goppa codes which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r/2, i.e., whose minimum Hamming distance is r + 1.

CYCLIC CODES THROUGH B[X], B[X; 1/kp Z(0)] and B[X; 1/p(k) Z(0)]: A COMPARISON

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

Encoding through generalized polynomial codes

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

A method for improving the code rate and error correction capability of a cyclic code

Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.

Goppa codes over certain semigroups

A Goppa code is described in terms of a polynomial, known as Goppa polynomial, and in contrast to cyclic codes, where it is difficult to estimate the minimum Hamming distance d from the generator polynomial. Furthermore, a Goppa code has the property that d ≥ deg(h(X))+1, where h(X) is a Goppa polynomial. In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm.

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}$.

Reversibility properties of semigroup actions on homogeneous spaces

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

Superconducting state in a mesoscopic segment ring

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Aharonov-Bohm oscillations in a quantum ring: Eccentricity and electric-field effects

The effects of an in-plane electric field and eccentricity on the electronic spectrum of a GaAs quantum ring in a perpendicular magnetic field are studied. The effective-mass equation is solved by two different methods: an adiabatic approximation and a diagonalization procedure after a conformal mapping. It is shown that the electric field and the eccentricity may suppress the Aharonov-Bohm oscillations of the lower energy levels. Simple expressions for the threshold energy and the number of flat energy bands are found. In the case of a thin and eccentric ring, the intensity of a critical field which compensates the main effects of eccentricity is determined. The energy spectra are found in qualitative agreement with previous experimental and theoretical works on anisotropic rings.

Dynamical evolution of Saturn's F ring dust particles

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

Orbital evolution of the mu and nu dust ring particles of Uranus

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

MOTOR NERVE CONDUCTION and REPETITIVE NERVE STIMULATION IN CAPTIVE RING-TAILED COATI (NASUA NASUA)

There are few electrophysiologic studies in wild animals. The aim of this study was to determine normal data for motor nerve conduction studies and repetitive stimulation in sciatic-tibial and ulnar nerves in clinically normal captive coati. Eight adult ring-tailed coatis (Nasua nasua), two females and six males weighing 68 kg, were used. Average nerve conduction velocity was 70.81 m/sec (standard deviation [SD] = 3.98) and 56.93 m/sec (SD = 4.31) for the sciatic-tibial and ulnar nerves, respectively. Repetitive stimulation responses demonstrated minimal variations of the area of the compound muscle action potentials at low (3 Hz) and high (20 Hz) frequencies. The maximal obtained decremental area response was 8%. These normal data of conduction studies may be used in assessing abnormalities for clinical diagnosis. In addition, the obtained normal repetitive stimulation data were similar to dogs and humans and may be used for post- and presynaptic disturbances of the neuromuscular transmission in coatis.