SU(5) x SU(5) unification revisited

The idea of grand unification in a minimal supersymmetric SU(5) x SU(5) framework is revisited. It is shown that the unification of gauge couplings into a unique coupling constant can be achieved at a high-energy scale compatible with proton decay constraints. This requires the addition of minimal particle content at intermediate energy scales. In particular, the introduction of the SU(2)(L) triplets belonging to the (15, 1)+((15) over bar, 1) representations, as well as of the scalar triplet Sigma(3) and octet Sigma(8) in the (24, 1) representation, turns out to be crucial for unification. The masses of these intermediate particles can vary over a wide range, and even lie in the TeV region. In contrast, the exotic vector-like fermions must be heavy enough and have masses above 10(10) GeV. We also show that, if the SU(5) x SU(5) theory is embedded into a heterotic string scenario, it is not possible to achieve gauge coupling unification with gravity at the perturbative string scale.

Design and performance of a novel low-density parity-check code for distributed video coding

Low-density parity-check (LDPC) codes are nowadays one of the hottest topics in coding theory, notably due to their advantages in terms of bit error rate performance and low complexity. In order to exploit the potential of the Wyner-Ziv coding paradigm, practical distributed video coding (DVC) schemes should use powerful error correcting codes with near-capacity performance. In this paper, new ways to design LDPC codes for the DVC paradigm are proposed and studied. The new LDPC solutions rely on merging parity-check nodes, which corresponds to reduce the number of rows in the parity-check matrix. This allows to change gracefully the compression ratio of the source (DCT coefficient bitplane) according to the correlation between the original and the side information. The proposed LDPC codes reach a good performance for a wide range of source correlations and achieve a better RD performance when compared to the popular turbo codes.

On the ranks of certain monoids of transformations that preserve a uniform partition

The rank of a semigroup, an important and relevant concept in Semigroup Theory, is the cardinality of a least-size generating set. Semigroups of transformations that preserve or reverse the order or the orientation as well as semigroups of transformations preserving an equivalence relation have been widely studied over the past decades by many authors. The purpose of this article is to compute the ranks of the monoid