Measurement of the ratio of inclusive jet cross sections using the anti-k(T) algorithm with radius parameters R=0.5 and 0.7 in pp collisions at root s=7 TeV

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

Multimessenger search for sources of gravitational waves and high-energy neutrinos: Initial results for LIGO-Virgo and IceCube

We report the results of a multimessenger search for coincident signals from the LIGO and Virgo gravitational-wave observatories and the partially completed IceCube high-energy neutrino detector, including periods of joint operation between 2007-2010. These include parts of the 2005-2007 run and the 2009-2010 run for LIGO-Virgo, and IceCube's observation periods with 22, 59 and 79 strings. We find no significant coincident events, and use the search results to derive upper limits on the rate of joint sources for a range of source emission parameters. For the optimistic assumption of gravitational-wave emission energy of 10(-2) M(circle dot)c(2) at similar to 150 Hz with similar to 60 ms duration, and high-energy neutrino emission of 1051 erg comparable to the isotropic gamma-ray energy of gamma-ray bursts, we limit the source rate below 1.6 x 10(-2) Mpc(-3) yr(-1). We also examine how combining information from gravitational waves and neutrinos will aid discovery in the advanced gravitational-wave detector era.

Evidence of b-Jet Quenching in PbPb Collisions at root S-NN=2.76 TeV

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

Studies of dijet transverse momentum balance and pseudorapidity distributions in pPb collisions at root s(NN)=5.02 TeV

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

Measurement of WZ and ZZ production in pp collisions at in final states with b-tagged jets

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

Search for invisible decays of Higgs bosons in the vector boson fusion and associated ZH production modes

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

Measurement of jet multiplicity distributions in t(t)over-bar production in pp collisions at root s=7TeV

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

Observation of the diphoton decay of the Higgs boson and measurement of its properties

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

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.

Construction and decoding of BCH codes over chain of commutative rings

In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for a nonnegative integer t, let A0 ⊂ A1 ⊂···⊂ At−1 ⊂ At be a chain of unitary commutative rings, where each Ai is constructed by the direct product of appropriate Galois rings, and its projection to the fields is K0 ⊂ K1 ⊂···⊂ Kt−1 ⊂ Kt (another chain of unitary commutative rings), where each Ki is made by the direct product of corresponding residue fields of given Galois rings. Also, A∗ i and K∗ i are the groups of units of Ai and Ki, respectively. This correspondence presents a construction technique of generator polynomials of the sequence of Bose, Chaudhuri, and Hocquenghem (BCH) codes possessing entries from A∗ i and K∗ i for each i, where 0 ≤ i ≤ t. By the construction of BCH codes, we are confined to get the best code rate and error correction capability; however, the proposed contribution offers a choice to opt a worthy BCH code concerning code rate and error correction capability. In the second phase, we extend the modified Berlekamp-Massey algorithm for the above chains of unitary commutative local rings in such a way that the error will be corrected of the sequences of codewords from the sequences of BCH codes at once. This process is not much different than the original one, but it deals a sequence of codewords from the sequence of codes over the chain of Galois rings.

A note on units of finite local rings in an ascending chain

In this paper we present matrices over unitary finite commutative local rings connected through an ascending chain of containments, whose elements are units of the corresponding rings in the chain such that the McCoy ranks are the largest ones.

Goppa codes through polynomials of B[X;(1/2^2)Z_0] and its decoding principle

In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight $t\leq 2r$, i.e., whose minimum Hamming distance is $2^{2}r+1$.

Fields of two power conductor

The goal of this work is find a description for fields of two power conductor. By the Kronecker-Weber theorem, these amounts to find the subfields of cyclotomic field $\mathbb{Q}(\xi_{2^r})$, where $\xi_{2^r}$ is a $2^r$-th primitive root of unit and $r$ a positive integer. In this case, the cyclotomic extension isn't cyclic, however its Galois group is generated by two elements and the subfield can be expressed by $\mathbb{Q}(\theta)$ for a $\theta\in\mathbb{Q}(\xi_{2^r})$ convenient.