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.

A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code

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

Socialização linguageira, aspectos culturais e uso de code-switching em uma criança bilíngue

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Desempenho operacional e energético, segundo a norma OECD – code 2 de dois tratores agrícolas 4x2 TDA com motores de 132 kw em pista concreto e solo agrícola

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

O compositor na sala de aula: sonoridades contemporâneas para educação musical

Pós-graduação em Música - IA

Defining functional urban regions in Bahia, Brazil, using roadway coverage and population density variables

The concept of Functional Urban Regions (FURs), also called Metropolitan Regions (MRs), is not simple. It is clear, though, that they are not simply a combination of adjacent municipalities or areas. Different methods can be used for their definition. However, especially in developing countries, the application of some methods is not possible, due to the unavailability of detailed data. Alternative approaches have been developed based on spatial analysis methods and using variables extracted from available data. The objective of this study is to compare the results of two spatial analysis methods exploring two variables: population density and an indicator of transport infrastructure supply. The first method regards Exploratory Spatial Data Analyses tools, which define uniform regions based on specific variables. The second method used the same variables and the spatial analysis technique available in the computer program SKATER - Spatial 'K'luster Analysis by Tree Edge Removal. Assuming that those classifications of regions with similar characteristics can be used for identifying potential FURS, the results of all analyses were compared with one another and with the 'official' MR. A combined approach was also considered for comparison, but none of the results match the existing MR boundaries, what challenges the official definitions. (C) 2014 Elsevier Ltd. All rights reserved.

An improved interolog mapping-based computational prediction of protein protein interactions with increased network coverage

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

As relações públicas na ambiência da comunicação móvel digital: o QR code como estratégia de comunicação

The internet as well as all technologies arising from it are transforming and changing socially and economically, the forms of relationships between people and organizations. The environment of digital mobile communication is on the rise, allowing more communication strategies in public relations to be enhanced, in order to allow effective dialogue, relationship and interaction between organizations and their stakeholders. Accordingly, the purpose of this paper is to analyze digital communications, especially a locative media tool that has been gaining ground in communication activities: Quick Response Code. So in addition to conceptualize and contextualize it, one tried to map out various campaigns, both national and international, who made use of the QR Code, highlighting the strategic role that this tool can have in Integrated PR planning, in order to create visibility and to establish effective and lasting relationships with the brand / organization

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.

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

Referência e code-switching: traços de singularidade na linguagem de uma criança bilíngue

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Surface coverage in wireless sensor networks based on delaunay tetrahedralization

In this work is presented a new method for sensor deployment on 3D surfaces. The method was structured on different steps. The first one aimed discretizes the relief of interest with Delaunay algorithm. The tetrahedra and relative values (spatial coordinates of each vertex and faces) were input to construction of 3D Voronoi diagram. Each circumcenter was calculated as a candidate position for a sensor node: the corresponding circular coverage area was calculated based on a radius r. The r value can be adjusted to simulate different kinds of sensors. The Dijkstra algorithm and a selection method were applied to eliminate candidate positions with overlapped coverage areas or beyond of surface of interest. Performance evaluations measures were defined using coverage area and communication as criteria. The results were relevant, once the mean coverage rate achieved on three different surfaces were among 91% and 100%.

A formalized optimum code search for q-ary trellis codes

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)