Double Code Research Articles

ANALYZING COLLAGE AS A COMMUNICATION ACT IN THE DIGITAL AGE BASED ON THE DADAISM RENEWAL MOVEMENT'S SPIRIT

Collage combines the semiotic tradition of Roland Barthes, the phenomenological tradition of Edmund Husserl, the critical tradition of Karl Marx, and the point of view of Jurgen Habermas in visual communication. The collage technique creates trans-aesthetic elements and double codes, a Dadaist method of encoding signs. Building on previous research, this study explores collage art as a communication act and its process in the digital era. Digital photography technology and computer software facilitate quicker and easier creation of collage art, emphasizing the fundamental concept of "paste." This pasting-sticking process mirrors the communication process of art and design in the digital era, illustrating cyclical communication capable of transcending space and time. The research has several conclusions. (1) By enhancing visual communication strategies and efficiency based on the spirit of the Dadaism renewal movement, unique collages can be created as a personal sign of message(s). (2) Collages as communication act in the digital era represent dialogue in trans-aesthetics code. (3) On the other hand, with the spirit of Dadaism that contains a free mind, open creation, and emphasis on social-cultural issues, collages as a communication process are also possible to frame messages and create fallacy.

Some Results for Double Cyclic Codes over Fq+vFq+v2Fq.

Let Fq be a finite field with an odd characteristic. In this paper, we present a new result about double cyclic codes over a finite non-chain ring. Specifically, we study the double cyclic code over Fq+vFq+v2Fq with v3=v, which is isomorphic to Fq×Fq×Fq. This study mainly involves generator polynomials and generator matrices. The generating polynomial of the dual code is also obtained. We show the relationship between the generating polynomials of the double cyclic codes and those of their dual codes. Finally, as an application of these results, we construct some optimal codes over F3.

On double cyclic codes over $ \mathbb{Z}_2+u\mathbb{Z}_2 $

<abstract><p>In this paper, we introduced double cyclic codes over $ R^r\times R^s $, where $ R = \mathbb{Z}_{2}+u\mathbb{Z}_{2} = \{0, 1, u, 1+u\} $ is the ring with four elements and $ u^2 = 0 $. We first determined the generator polynomials of $ R $-double cyclic codes for odd integers $ r $ and $ s $, then gave the generators of duals of free double cyclic codes over $ R^r\times R^s $. By defining a linear Gray map, we looked at the binary images of $ R $-double cyclic codes and gave several examples of optimal parameter binary linear codes obtained from $ R $-double cyclic codes. Moreover, we studied self-dual $ R $-double cyclic codes and presented an example of a self-dual $ R $-double cyclic code.</p></abstract>

Construction and analysis of check matrices correcting single and double adjacent errors codes

Construction and analysis of check matrices correcting single and double adjacent errors codes

Linear complementary dual codes and double circulant codes over a semi-local ring

<p style='text-indent:20px;'>Let <inline-formula><tex-math id="M1">\begin{document}$ q $\end{document}</tex-math></inline-formula> be an odd prime power and <inline-formula><tex-math id="M2">\begin{document}$ \mathbb{F}_q $\end{document}</tex-math></inline-formula> be the finite field with <inline-formula><tex-math id="M3">\begin{document}$ q $\end{document}</tex-math></inline-formula> elements. In this paper, suppose ring <inline-formula><tex-math id="M4">\begin{document}$ R = \mathbb{F}_{q}+ \mu \mathbb{F}_{q}+ \nu \mathbb{F}_{q}+ \mu \nu \mathbb{F}_{q} $\end{document}</tex-math></inline-formula>, where <inline-formula><tex-math id="M5">\begin{document}$ \mu \nu = \nu \mu, \mu^{2} = \mu, \nu^{2} = \nu. $\end{document}</tex-math></inline-formula> We first give a Gray map from <inline-formula><tex-math id="M6">\begin{document}$ R $\end{document}</tex-math></inline-formula> onto <inline-formula><tex-math id="M7">\begin{document}$ \mathbb{F}_q^{4} $\end{document}</tex-math></inline-formula> and consider a decomposition of the ring <inline-formula><tex-math id="M8">\begin{document}$ R $\end{document}</tex-math></inline-formula>. Additionally, we investigate linear complementary dual (LCD) codes over the ring <inline-formula><tex-math id="M9">\begin{document}$ R $\end{document}</tex-math></inline-formula>. Some conditions for such linear codes over <inline-formula><tex-math id="M10">\begin{document}$ R $\end{document}</tex-math></inline-formula> to be linear complementary dual are given. Furthermore, based on the Artin conjecture, we get a class of good codes by calculating the total number of LCD double circulant codes over <inline-formula><tex-math id="M11">\begin{document}$ R $\end{document}</tex-math></inline-formula>.</p>

Constructing Double Cyclic Codes over for DNA Codes.

In this article, we investigate the algebraic structure of double cyclic codes of length over with and construct DNA codes from these codes. The theory of constructing double cyclic codes suitable for DNA codes is studied. We provide the necessary and sufficient conditions for the double cyclic codes to be reversible and reversible-complement codes. As an illustration, we present some of the DNA codes generated from our results.

Additive double polycyclic codes over $$\mathbb {F}_{p^2}$$ and their applications to quantum codes

Additive double polycyclic codes over $$\mathbb {F}_{p^2}$$ and their applications to quantum codes

Joint-decoding-complexity-oriented collaborative design for joint source-channel coding system based on double protograph-LDPC codes

Joint-decoding-complexity-oriented collaborative design for joint source-channel coding system based on double protograph-LDPC codes

On the number of ℤp-double cyclic codes and quasi cyclic codes

In this paper, we study the class of [Formula: see text]-double cyclic codes of length [Formula: see text] We give a closed formula for the number of [Formula: see text] -double cyclic codes of length [Formula: see text] for any integers [Formula: see text] and [Formula: see text] that are relatively prime to [Formula: see text] Moreover, we give a closed formula for the number of quasi-cyclic (QC) codes of length [Formula: see text] and index [Formula: see text] We also provide formulas for the number of separable and non-separable [Formula: see text]-double cyclic codes of length [Formula: see text] In order to illustrate the results, we calculate the number of some codes with different [Formula: see text] and [Formula: see text]. Moreover, we list optimal parameter [Formula: see text]-double cyclic codes for specific values of [Formula: see text] and [Formula: see text].

Spatiotemporal dynamics of abstract and concrete semantic representations

Dual Coding Theories (DCT) suggest that meaning is represented in the brain by a double code: a language-derived code in the Anterior Temporal Lobe (ATL) and a sensory-derived code in perceptual and motor regions. Concrete concepts should activate both codes, while abstract ones rely solely on the linguistic code. To test these hypotheses, the present magnetoencephalography (MEG) experiment had participants judge whether visually presented words relate to the senses while we recorded brain responses to abstract and concrete semantic components obtained from 65 independently rated semantic features. Results evidenced early involvement of anterior-temporal and inferior-frontal brain areas in both abstract and concrete semantic information encoding. At later stages, occipital and occipito-temporal regions showed greater responses to concrete compared to abstract features. The present findings suggest that the concreteness of words is processed first with a transmodal/linguistic code, housed in frontotemporal brain systems, and only after with an imagistic/sensorimotor code in perceptual regions.

Skew Cyclic Codes over $\mathbb{Z}_{8}+u\mathbb{Z}_{8}+v\mathbb{Z}_{8}$

In this paper, we study the skew cyclic codes over the ring $S=\mathbb{Z}_{8}+u\mathbb{Z}_{8}+v\mathbb{Z}_{8}$, where $u^{2}=u$, $v^{2}=v$, $uv=vu=0$. We consider these codes as left $S[x,\theta]$-submodules and use the Gray map on $S$ to obtain the $\mathbb{Z}_{8}$-images. The generator and parity-check matrices of a free $\theta$-cyclic
 code of even length over $S$ are determined. Also, these codes are generalized to double skew-cyclic codes. We give some examples using Magma computational algebra system.

Effect of memory on the contemporary architectural design concept

The human memory is the mental storehouse that preserves the events, facts, and dreams that happen to him in his life or his mind creates them. According to psychologists and sociologists, the memory pursued by human beings is linked to the mine of creativity as it generates special human emotions. Architects embodied the Double Code Theory through the content of their personal memories. They presented architectural formations that carried two meanings: the first is visible to the audience, and the other is hidden and related to the memory of the architect, where the architect relied on recalling events related to his memory. Architects recall their memories and work to recall their own memories and are inspired by their designs, as the architectural buildings become of historical, civilizational, and cultural value. Thus, the scope of this research belongs to the field of diaries of architecture, trying to unveil the secrets and intentions of architects who inspire their design concepts from the memory of civilizations and their own memories. This paper exposes the ideas of the most prominent designers who worked on buildings around the world, whereas the main aim of this paper is to re-read and interpret contemporary architectural languages that rely on memory in their design concepts to enable us to deconstruct and understand them from the perspective of memories of the past and to understand the intended message beyond, depending on methods of analysis by tracing particles, definitions, and theories through presenting a literature review to highlight what came in the precedent research in this topic. This research hypothesizes that the memory is the inspiration source for contemporary architecture. Throughout the paper, the analytical method investigates this hypothesis using certain parameters of analysis on three case studies, followed by a comparison to explore how each architect of these projects inspired his own memory to lead the design setting. One of the most prominent findings is the process of comprehending the design concept can’t be easy for visitors unless they make an intellectual and physical effort to disclose the secret of architect and truly detect the inspirational memory. Another important finding is that the memory of architect, implemented in the design ideas, always touches whether religious or political events or personal experiences.

Hulls of double cyclic codes

In this paper, we characterize hulls of double cyclic codes over Z2. Firstly, we give the generators of hulls of double cyclic codes under the separable case and the non-separable case with coprime odd block lengths. Then, using the concept of a generating function in combinatorics, the solution of dimensions of hulls of double cyclic codes over Z2 is given. Furthermore, the enumeration of double cyclic codes over Z2 with hulls of a fixed dimension is determined. As an application, some good entanglement-assisted quantum error-correcting codes (EAQECCs) are obtained by the hulls of non-separable double cyclic codes.

Double Constacyclic Codes Over Two Finite Commutative Chain Rings

Many kinds of codes which possess two cycle structures over two special finite commutative chain rings, such as <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${\mathbb {Z}}_{2}{\mathbb {Z}}_{4}$ </tex-math></inline-formula> -additive cyclic codes and quasi-cyclic codes of fractional index etc., were proved asymptotically good. In this paper we extend the study in two directions: we consider any two finite commutative chain rings with a surjective homomorphism from one to the other, and consider double constacyclic structures. We construct an extensive kind of double constacyclic codes over two finite commutative chain rings. And, developing a probabilistic method suitable for quasi-cyclic codes over fields, we prove that the double constacyclic codes over two finite commutative chain rings are asymptotically good.

Multi-Array Design for Hydrokinetic Turbines in Hydropower Canals

The design of hydrokinetic plants in hydropower canals involves the choice of the array layout, rotor geometry, turbine spacing, and array spacing, and necessitates the control of the resultant backwater to avoid upstream flooding hazards. Several works in the literature have shown that array power optimization is feasible with small spacings between the arrays, disregarding the limitation in the power output induced by backwater upstream. In this study, a 1-D channel model with a Double Multiple Streamtube code and wake sub-models are integrated to predict an array layout that will maximize the array power. The outputs of the conducted sensitivity analysis confirm that this design enabled improved power conversion with closely spaced turbines and largely spaced arrays, thus allowing for a partial recovery of the total head variation for a new array deployed upstream. In addition to the quantitative assessment of the mechanical power converted, the tool enables depth control from the downstream undisturbed flow station to the backwater exhaustion far upstream, thereby increasing its flexibility. Furthermore, it overcomes the limitations of actuator disc models by considering rotor’s fluid dynamic losses. The results show that power output linearly scales for a limited number of arrays (≤5), whilst the variation in water depth variation follows a power law from the most downstream array towards upstream, regardless of the plant size. Finally, the maximum upstream inflow depth is demonstrated to become asymptotic for large multi-array plants under ideal conditions.

Analysis and Optimization of a General Linking Matrix for JSCC Scheme Based on Double LDPC Codes

A key component of the joint source-channel coding (JSCC) scheme based on double low-density parity-check (D-LDPC) codes is the introduction of a linking matrix between the source LDPC code and channel LDPC code, by which the decoding information including the source redundancy and channel state information can be transferred iteratively. However, the linking matrix is a fixed one-to-one mapping, i.e., an identity matrix in a conventional D-LDPC code system, which may not take full advantage of the decoding information. Therefore, this paper introduces a general linking matrix, i.e., a non-identity linking matrix, connecting the check nodes (CNs) of the source LDPC code and the variable nodes (VNs) of the channel LDPC code. Further, the encoding and decoding algorithms of the proposed D-LDPC coding system are generalized. A joint extrinsic information transfer (JEXIT) algorithm is derived for calculating the decoding threshold of the proposed system with a general linking matrix. In addition, several general linking matrices are optimized with the aid of the JEXIT algorithm. Finally, the simulation results demonstrate the superiority of the proposed D-LDPC coding system with general linking matrices.

Multi-objective integrated optimization study of prefabricated building projects introducing sustainable levels

As construction becomes greener, people have higher and higher requirements for engineering project management, which makes it necessary to deeply study the comprehensive optimization of schedule, cost and sustainability level. Adhering to the concept of low carbon and green, the article takes carbon emission factor into the total cost of building construction and improves the traditional cost objective of engineering projects; then quantitatively analyzes the economic, environmental and social impacts of assembled buildings from the perspective of sustainability, and introduces the sustainability objective into the traditional duration-cost problem study, taking the duration of each job in the double code arrow diagram as the independent variable to construct the duration -cost-sustainability level multi-objective optimization model. In order to solve the type effectively, a series of Pareto optimal solutions are obtained using the NSGA-II algorithm, and the efficacy coefficient method is used for program decision making. The results show that the Pareto solution set can provide effective support for the project manager’s decision making, and the NSGA-II algorithm is effective in solving the multi-objective optimization model.

Design and Analysis of Joint Group Shuffled Scheduling Decoding Algorithm for Double LDPC Codes System.

In this paper, a joint group shuffled scheduling decoding (JGSSD) algorithm for a joint source-channel coding (JSCC) scheme based on double low-density parity-check (D-LDPC) codes is presented. The proposed algorithm considers the D-LDPC coding structure as a whole and applies shuffled scheduling to each group; the grouping relies on the types or the length of the variable nodes (VNs). By comparison, the conventional shuffled scheduling decoding algorithm can be regarded as a special case of this proposed algorithm. A novel joint extrinsic information transfer (JEXIT) algorithm for the D-LDPC codes system with the JGSSD algorithm is proposed, by which the source and channel decoding are calculated with different grouping strategies to analyze the effects of the grouping strategy. Simulation results and comparisons verify the superiority of the JGSSD algorithm, which can adaptively trade off the decoding performance, complexity and latency.

Global Design of Double Protograph LDPC Codes for Joint Source-Channel Coding

In this letter, a global design of double protograph low-density parity-check (DP-LDPC) codes is proposed for joint source-channel coding (JSCC) system. The maximum number of degree-2 variable nodes (VNs), which is very important for the performance of the system, is determined from a global perspective that considers the joint protograph as a whole. Based on the allocation of degree-2 VNs, the new guidelines with this more comprehensive perspective are summarized and the global optimized DP-LDPC codes are designed. The simulation results that are in consistent with the joint protograph extrinsic information transfer (P-EXIT) analysis indicate that the optimized DP-LDPC codes have better performance compared with the existing re-designed DP-LDPC codes.

Double circulant codes for the Lee and Euclidean distance

&lt;abstract&gt;&lt;p&gt;This paper investigates double circulant codes of length $ 2n $ over $ \mathbb{Z}_{{{p^m}}} $ where $ p $ is an odd prime, $ n $ goes to infinity, and $ m\ge 1 $ is a fixed integer. Using random coding, we obtain families of asymptotically good Lee codes over $ \mathbb{Z}_{{{p^m}}} $ in the case of small and large alphabets, and asymptotically good Euclidean codes over $ \mathbb{Z}_{{{p^m}}} $ for small alphabets. We use Euclidean codes to construct spherical codes, and Lee codes to construct insertion/deletion codes, by a projection technique due to (Yaglom, 1958) for spherical codes, and to (Sok et al., 2018) for deletion codes.&lt;/p&gt;&lt;/abstract&gt;