Separated by a Common Language: How the Nature of Code Differences Shapes Communication Success and Code Convergence

Coordinated action within and beween organizations is easier when individuals share communication codes—mappings between stimuli and labels. Because codes are specific to the groups within which they arise as conventions, collaboration across organizational units that have developed their own distinctive codes is often difficult. However, not all code differences are equal in their implications for communication difficulty and the capacity of individuals starting out with different codes to develop a shared code. Using computational models, we develop a theory about the nature of differences in initial communication codes and how they impact convergence on a common code. Our results show that the difficulty of code convergence lies not as much in learning new codes as in unlearning existing ones. The most severe challenges to communication stem from “code clashes” where codes contain different mappings between the same labels and stimuli. Furthermore, clashes that arise when agents have developed their individual codes in different task environments but draw on a common set of labels are likely to be the hardest to recover from, reflecting the perils of being “separated by a common language.” This paper was accepted by Lamar Pierce, organizations.

Methodological path to reach the degree of saturation in qualitative research: grounded theory

ABSTRACT Objectives: to achieve the degree of saturation in study that applied the grounded theory. Methods: qualitative research, carried out in four Family Health Units, between June 2018 and May 2019. The data from the interviews with 30 health professionals and non-participant observation were coded in the stages: open, axial and integration. Results: the degree of saturation was achieved by two conceptual models - theoretical saturation and inductive thematic. Theoretical saturation was considered: the development of conceptual codes and observation, in the collection and analysis of data, when they generated new categories/subcategories or only indicated increasing instances. For thematic inductive saturation, the use of new codes based on each interview stood out. Final Considerations: the visual layout for the number of codes, the theoretical scope of the concepts and the delimitation of the sample groups guided the identification of the degree of saturation for the development of the conceptual body that supported the substantive theory.

Low Correlation Codes for Sonar Systems

<p>Sonar is a vital technology for the detection of objects in the water. Sonarsystems have been redefined over many decades, but research is still beingconducted into optimal detection methods. Codes, and the filters thatprocess the codes, have been at the forefront of this research. An importantobjective has been the minimization of interference caused by reflections.Matched filters are commonly used in sonar systems. They are equivalent tocorrelation filters, which are bound by the Welch bound. The Welch boundgoverns the minimum peak correlation for points outside of detection.This thesis investigated matched filters and their bounds, and it wasfound that by relaxing the condition for detection, properties beyond theWelch bound could be achieved. By relaxing these conditions, the Welchbound no longer applies, and so a modified Welch bound was developedto accurately investigate the nature of these codes. In this thesis, methodsto generate codes for these new codes were investigated. Generating codesfor a matched filter is a non-convex problem, so gradient based methodswere utilised. Methods to improve correlation and power characteristicswere developed, along with methods for mapping a sequence for use witha digital transmitter having particular limitations. Mis-matched filters wereused to improve signal characteristics that may be lost due to this mapping.The performance of the generated codes was evaluated, and the rela-tionships between input parameters and output properties of the resultingsignal were observed. These performance assessments demonstrate thattradeoffs are required between various properties, and a balance is neededto obtain codes useful for sonar. The optimization was parametrized by anexample set of requirements for sonar. The signals were found to meet the given requirements, and when compared to codes typically used in sonar,the optimized signals were shown to have significantly better correlationproperties. Furthermore, compared to the general bounds for the propertiesof codes, it was found that the new codes had nearly optimal properties,and performed better than equivalent codes bounded by the Welch bound.The performance of codes were also investigated in a water tank toverify their feasibility. There were several additional considerations whichlimit codes that can be tested, and once these are taken into account thetest provided a robust method to verify the design process. Initial testsshowed results that differed from simulations, but after the inclusion ofzero padding before upscaling, the results from empirical testing agreewith simulation.Summarizing the research in this thesis, a new set of codes were devel-oped using a gradient based optimization method. The codes were mappedto a digital transmitter, and the filter adjusted using a mis-matched filter. The optimization was shown to generate near optimal codes which met allthe given sonar system requirements</p>

Low Correlation Codes for Sonar Systems

<p>Sonar is a vital technology for the detection of objects in the water. Sonarsystems have been redefined over many decades, but research is still beingconducted into optimal detection methods. Codes, and the filters thatprocess the codes, have been at the forefront of this research. An importantobjective has been the minimization of interference caused by reflections.Matched filters are commonly used in sonar systems. They are equivalent tocorrelation filters, which are bound by the Welch bound. The Welch boundgoverns the minimum peak correlation for points outside of detection.This thesis investigated matched filters and their bounds, and it wasfound that by relaxing the condition for detection, properties beyond theWelch bound could be achieved. By relaxing these conditions, the Welchbound no longer applies, and so a modified Welch bound was developedto accurately investigate the nature of these codes. In this thesis, methodsto generate codes for these new codes were investigated. Generating codesfor a matched filter is a non-convex problem, so gradient based methodswere utilised. Methods to improve correlation and power characteristicswere developed, along with methods for mapping a sequence for use witha digital transmitter having particular limitations. Mis-matched filters wereused to improve signal characteristics that may be lost due to this mapping.The performance of the generated codes was evaluated, and the rela-tionships between input parameters and output properties of the resultingsignal were observed. These performance assessments demonstrate thattradeoffs are required between various properties, and a balance is neededto obtain codes useful for sonar. The optimization was parametrized by anexample set of requirements for sonar. The signals were found to meet the given requirements, and when compared to codes typically used in sonar,the optimized signals were shown to have significantly better correlationproperties. Furthermore, compared to the general bounds for the propertiesof codes, it was found that the new codes had nearly optimal properties,and performed better than equivalent codes bounded by the Welch bound.The performance of codes were also investigated in a water tank toverify their feasibility. There were several additional considerations whichlimit codes that can be tested, and once these are taken into account thetest provided a robust method to verify the design process. Initial testsshowed results that differed from simulations, but after the inclusion ofzero padding before upscaling, the results from empirical testing agreewith simulation.Summarizing the research in this thesis, a new set of codes were devel-oped using a gradient based optimization method. The codes were mappedto a digital transmitter, and the filter adjusted using a mis-matched filter. The optimization was shown to generate near optimal codes which met allthe given sonar system requirements</p>

Classical Epic in the Works of J.R.R. Tolkien

<p>The Lord of the Rings has often been described as an 'epic', and although Tolkien drew most famously on Northern mythology in his creation of Middle-earth much of his work also bears similarities to classical epic, both with regard to particular characters and archetypes and to more general themes and motifs. This thesis examines the connections between The Lord of the Rings and the epics of Homer and Virgil, investigating the manner in which these allusions function in Tolkien and how they contribute to our understanding of Middleearth as at least partially an epic world with epic ideals of heroism. At the same time, however, it identifies the ways in which Tolkien changes or subverts such classical ideals and archetypes as they combine with other cultural influences. Following the model established in The Hobbit, The Lord of the Rings begins with the folk-tale heroes and setting of the Shire before gradually moving into an epic world. Not only heroes such as Aragorn, but less obviously epic heroes such as Gandalf, Frodo and Sam, draw frequently on the iconography and motifs associated with specific and general classical figures, while women such as Arwen, Eowyn and Galadriel can similarly be read as part of classical tradition. Moreover, despite the purely fictional nature of Middle-earth in contrast to the historical (if mythologised) cultures of classical epic, The Lord of the Rings contains many examples of epic type-scenes that in classical epic illustrate the correct manner in which a hero should behave both in peace and in battle. The Lord of the Rings' relationship to epic is complex, however, not only employing these heroic and epic conventions but also subverting or superseding them as Tolkien engages with the problems of classical motifs within a very different universe. The heroes and heroines of The Lord of the Rings must navigate codes of behaviour both classical and non-classical, and willingly relinquish those out of place in the new age being born around them. This tension between old and new codes of behaviour is made more explicit during the book's twin 'returns', that of Aragorn to Minas Tirith and the hobbits to the Shire. Although these continue to draw extensively on classical predecessors, most notably Aeneas' prophesised arrival in Latium and Odysseus' famous homecoming, these predecessors are also superseded as Middle-earth moves into the Fourth Age. While The Hobbit moves from folk tale to epic and back again, The Lord of the Rings moves from folk-tale to epic to somewhere “beyond the epic” (Flieger 145), and as the book draws to its elegiac conclusion pure classical values become increasingly supplanted by the book’s own heroic code, influenced by many heroic traditions and overwhelmingly by Tolkien's Catholic beliefs. In the end, The Lord of the Rings can perhaps be read as an epic about the passing of epic, and thus an epic for the modern world.</p>

Classical Epic in the Works of J.R.R. Tolkien

<p>The Lord of the Rings has often been described as an 'epic', and although Tolkien drew most famously on Northern mythology in his creation of Middle-earth much of his work also bears similarities to classical epic, both with regard to particular characters and archetypes and to more general themes and motifs. This thesis examines the connections between The Lord of the Rings and the epics of Homer and Virgil, investigating the manner in which these allusions function in Tolkien and how they contribute to our understanding of Middleearth as at least partially an epic world with epic ideals of heroism. At the same time, however, it identifies the ways in which Tolkien changes or subverts such classical ideals and archetypes as they combine with other cultural influences. Following the model established in The Hobbit, The Lord of the Rings begins with the folk-tale heroes and setting of the Shire before gradually moving into an epic world. Not only heroes such as Aragorn, but less obviously epic heroes such as Gandalf, Frodo and Sam, draw frequently on the iconography and motifs associated with specific and general classical figures, while women such as Arwen, Eowyn and Galadriel can similarly be read as part of classical tradition. Moreover, despite the purely fictional nature of Middle-earth in contrast to the historical (if mythologised) cultures of classical epic, The Lord of the Rings contains many examples of epic type-scenes that in classical epic illustrate the correct manner in which a hero should behave both in peace and in battle. The Lord of the Rings' relationship to epic is complex, however, not only employing these heroic and epic conventions but also subverting or superseding them as Tolkien engages with the problems of classical motifs within a very different universe. The heroes and heroines of The Lord of the Rings must navigate codes of behaviour both classical and non-classical, and willingly relinquish those out of place in the new age being born around them. This tension between old and new codes of behaviour is made more explicit during the book's twin 'returns', that of Aragorn to Minas Tirith and the hobbits to the Shire. Although these continue to draw extensively on classical predecessors, most notably Aeneas' prophesised arrival in Latium and Odysseus' famous homecoming, these predecessors are also superseded as Middle-earth moves into the Fourth Age. While The Hobbit moves from folk tale to epic and back again, The Lord of the Rings moves from folk-tale to epic to somewhere “beyond the epic” (Flieger 145), and as the book draws to its elegiac conclusion pure classical values become increasingly supplanted by the book’s own heroic code, influenced by many heroic traditions and overwhelmingly by Tolkien's Catholic beliefs. In the end, The Lord of the Rings can perhaps be read as an epic about the passing of epic, and thus an epic for the modern world.</p>

A remark on skew factorization and new 𝔽4-linear codes

Nine new [Formula: see text] linear codes with lengths [Formula: see text] and [Formula: see text] that improve previously best known parameters are constructed. By modifying these codes, another 17 new codes are obtained. It is conjectured that the complete set of factors of [Formula: see text] can be derived from the factors of [Formula: see text] for even values of [Formula: see text] in the skew polynomial ring [Formula: see text]. It is further shown that the [Formula: see text] code obtained is linearly complementary dual.

Two Public-Key Cryptosystems Based on Expanded Gabidulin Codes

This paper presents two public-key cryptosystems based on the so-called expanded Gabidulin codes, which are constructed by expanding Gabidulin codes over the base field. Exploiting the fast decoder of Gabidulin codes, we propose an efficient algorithm to decode these new codes when the noise vector satisfies a certain condition. Additionally, these new codes have an excellent error-correcting capability because of the optimality of their parent Gabidulin codes. Based on different masking techniques, we give two encryption schemes by using expanded Gabidulin codes in the McEliece setting. According to our analysis, these two cryptosystems can both resist the existing structural attacks. Furthermore, our proposals also have an obvious advantage in public-key representation without using the cyclic or quasi-cyclic structure compared to some other code-based cryptosystems. To achieve the security of 256 bits, for instance, a public-key size of 37005 bytes is enough for our first proposal, while around 1044992 bytes are needed for Classic McEliece selected as a candidate of the third round of the NIST PQC project.

On some punctured codes of ℤq-Simplex codes

In this paper, we have constructed some new codes from [Formula: see text]-Simplex code called unit [Formula: see text]-Simplex code. In particular, we find the parameters of these codes and have proved that it is a [Formula: see text] [Formula: see text]-linear code, where [Formula: see text] and [Formula: see text] is a smallest prime divisor of [Formula: see text]. When rank [Formula: see text] and [Formula: see text] is a prime power, we have given the weight distribution of unit [Formula: see text]-Simplex code. For the rank [Formula: see text] we obtain the partial weight distribution of unit [Formula: see text]-Simplex code when [Formula: see text] is a prime power. Further, we derive the weight distribution of unit [Formula: see text]-Simplex code for the rank [Formula: see text] [Formula: see text].