A game theoretical approach to the evolution of structured communication codes

Structured meaning-signal mappings, i.e., mappings that preserve neighborhood relationships by associating similar signals with similar meanings, are advantageous in an environment where signals are corrupted by noise and sub-optimal meaning inferences are rewarded as well. The evolution of these mappings, however, cannot be explained within a traditional language evolutionary game scenario in which individuals meet randomly because the evolutionary dynamics is trapped in local maxima that do not reflect the structure of the meaning and signal spaces. Here we use a simple game theoretical model to show analytically that when individuals adopting the same communication code meet more frequently than individuals using different codes-a result of the spatial organization of the population-then advantageous linguistic innovations can spread and take over the population. In addition, we report results of simulations in which an individual can communicate only with its K nearest neighbors and show that the probability that the lineage of a mutant that uses a more efficient communication code becomes fixed decreases exponentially with increasing K. These findings support the mother tongue hypothesis that human language evolved as a communication system used among kin, especially between mothers and offspring.

Effective measures to decrease air contaminants through risk and control visualization : a study of the effective use of QR codes to facilitate safety training

Woodworking industries still consists of wood dust problems. Young workers are especially vulnerable to safety risks. To reduce risks, it is important to change attitudes and increase knowledge about safety. Safety training have shown to establish positive attitudes towards safety among employees. The aim of current study is to analyze the effect of QR codes that link to Picture Mix EXposure (PIMEX) videos by analyzing attitudes to this safety training method and safety in student responses. Safety training videos were used in upper secondary school handicraft programs to demonstrate wood dust risks and methods to decrease exposure to wood dust. A preliminary study was conducted to investigate improvement of safety training in two schools in preparation for the main study that investigated a safety training method in three schools. In the preliminary study the PIMEX method was first used in which students were filmed while wood dust exposure was measured and subsequently displayed on a computer screen in real time. Before and after the filming, teachers, students, and researchers together analyzed wood dust risks and effective measures to reduce exposure to them. For the main study, QR codes linked to PIMEX videos were attached at wood processing machines. Subsequent interviews showed that this safety training method enables students in an early stage of their life to learn about risks and safety measures to control wood dust exposure. The new combination of methods can create awareness, change attitudes and motivation among students to work more frequently to reduce wood dust. 

Designer Codes

If you’ve made it this far—and I’m sure many of you have—then you know what this article is about: QR codes, or Quick Response codes (also referred to, though less frequently, as mobile codes 2d barcodes, or 2d codes). QRs are not new by any stretch of the imagination. In fact, they’ve been around for about a decade and a half.

Arithmetic fuchsian groups and space time block codes

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

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.

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)

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

Geometrically uniform hyperbolic codes

In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclidean spaces, to hyperbolic spaces. We also show a characterization of generalized coset codes through the concept of G-linear codes.

The symmetry group of Z(q)(n) in the Lee space and the Z(qn)-linear codes

The Z(4)-linearity is a construction technique of good binary codes. Motivated by this property, we address the problem of extending the Z(4)-linearity to Z(q)n-linearity. In this direction, we consider the n-dimensional Lee space of order q, that is, (Z(q)(n), d(L)), as one of the most interesting spaces for coding applications. We establish the symmetry group of Z(q)(n) for any n and q by determining its isometries. We also show that there is no cyclic subgroup of order q(n) in Gamma(Z(q)(n)) acting transitively in Z(q)(n). Therefore, there exists no Z(q)n-linear code with respect to the cyclic subgroup.

Hamming and Reed-Solomon codes over certain rings

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

Relating propelinear and binary G-linear codes

In this paper we establish the connections between two different extensions of Z(4)-linearity for binary Hamming spaces, We present both notions - propelinearity and G-linearity - in the context of isometries and group actions, taking the viewpoint of geometrically uniform codes extended to discrete spaces. We show a double inclusion relation: binary G-linear codes are propelinear codes, and translation-invariant propelinear codes are G-linear codes. (C) 2002 Elsevier B.V. B.V. All rights reserved.

On the construction of perfect codes from HEX signal constellations

Recently, minimum and non-minimum delay perfect codes were proposed for any channel of dimension n. Their construction appears in the literature as a subset of cyclic division algebras over Q(zeta(3)) only for the dimension n = 2(s)n(1), where s is an element of {0,1}, n(1) is odd and the signal constellations are isomorphic to Z[zeta(3)](n) In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over Q(zeta(3)), where the signal constellations are isomorphic to the hexagonal A(2)(n)-rotated lattice, for any channel of any dimension n such that gcd(n,3) = 1. (C) 2012 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

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

Special subsets and optimum codes based on lattices and cosets

This paper introduces the concept of special subsets when applied to generator matrices based on lattices and cosets as presented by Calder-bank and Sloane. By using the special subsets we propose a non exhaustive code search for optimum codes. Although non exhaustive, the search always results in optimum codes for given (k1, V, Λ/Λ′). Tables with binary and ternary optimum codes to partitions of lattices with 8, 9 e 16 cosets, were obtained.