Kind Of Code Research Articles

Some Properties of Channel Detecting Codes on Specific Domains

This project aims at investigating properties of channel detecting codes on specific domains \(1^+0^+\). We focus on the transmission channel with deletion errors. Firstly, we discuss properties of channels with deletion errors. We propose a certain kind of code that is a channel detecting (abbr. \(\gamma\)-detecting) code for the channel \(\gamma = \delta(m, N)\) where \(m < N\). The characteristic of this \(\gamma\)-detecting code is considered. One method is provided to construct \(\gamma\)-detecting code. Finally, we also study a kind of special channel code named \(\tau(m, N)\)-srp code.

ECOLINGUISTICS OF TEACHING A FOREIGN LANGUAGE AS A LANGUAGE OF INTERETHNIC COMMUNICATION

The article outlines the ecolinguistic principles and strategies of teaching a foreign language as a language of interethnic communication. The ecolinguistic approach assumes that teaching a foreign language as a language of interethnic communication should promote communication around the world, without violating the original linguistic traditions of nations, nationalities and ethnic groups, provide linguistic and cultural diversity, a culturally rich, but united world. In this regard, a foreign language is also intended to serve the needs of host cultures, to preserve and emphasize their uniqueness. As a language of international communication, a foreign language is seen not as a full-fledged linguoculturally filled language, but as a code for the transmission of personal and national linguoculturally conditioned messages. This kind of code should adapt to the needs and requirements of the world community, borrowing designations with appropriate meanings from national languages, and not vice versa. Rather than level cultures and civilizations, we see its role as reflecting their diversity. Ecolinguistic strategies for teaching a foreign language as a language of interethnic communication proposed, in line with which it is deemed desirable for foreign language curricula to represent: 1) to the maximum — global issues, world heritage, history/modernity/future, 2) extensively — modernity, history, culture of host cultures, 3) to a moderate degree — modernity, history, culture of the country of a foreign language (10–20 % of the educational material). When teaching a foreign language, traditional language pedagogy is preferred, the linguocultural method combined with immersion are deemed not quite ecolinguistic because of foreign acculturation. It is welcome though when teaching the national/native language to create a strong cultural identity (inculturation) and immunity to foreignization. In TEFL, immersion can be used, but without acculturation. Excessive branding of foreign realities and personalities as part of foreign acculturation is not believed to be sustainable. Foreign language textbooks should be politically correct and tolerant, especially with regard to facts, history, values, personalities of the host culture; traditional moral and ideological conclusions should ensue from the texts. The national/native language should be used as a rightful metalanguage of explanation when comparing cultural phenomena. It is advisable to write and publish foreign language textbooks by the authors of the host culture.

Common lossless compression algorithms and their error resiliency performance

With the development of communication technology and computer technology, many related industries, such as multimedia entertainment, put forward higher requirements for storing and transmitting information data. The research of data compression technology has attracted more and more attention. Therefore, the error resiliency ability of data compression algorithm is particularly important. How to enhance the error resiliency of data compression communication systems has been a hot topic for researchers. This paper mainly introduces the lossless data compression technology and its basic principle and performance index. Two typical lossless compression codes, Huffman and Arithmetic coding are deeply studied, including the principle of coding and the problem of error resiliency. Huffman coding and Arithmetic coding are two very important lossless compression codes widely used. The ability to resist channel error is an important index for data compression in communication. It is of great significance to further improve the channel adaptability of data compression to study the above two kinds of codes and their ability to resist channel error.

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.

Simulation of steady-state and transient loss of cooling accident of a channel in a reactor plate-type fuel element

The suitable cooling of fuel elements in a nuclear reactor is an important requirement that must be met to avoid that the fuel temperature rises above the safety limits according to the reactor design. During the reactor operation, there are transients that could lead to a temperature that overcomes these limits, such as those related to the cooling system. The CFD codes are tools that could aid in the understand of the phenomenon during such transients, allowing to access details of the flow that are not possible, or are possible only with limitations, by using other kind of codes or experiments. In the present work, the results obtained using ANSYS-CFXÒ code for the IEA-R1 reactor during a steady state and transient of slow loss of cooling accident event are presented. The results obtained shown a good agreement with experimental data reported and works that used this reactor as case of study. These results are part of a research in which the main objective is to simulate the flow of the coolant in the fuel element channels during transients. These results would support an initial analysis of the flow during the transition from forced to natural convection that occurs when the coolant flow falls below a settled value and the valve on the bottom of the core opens by gravity, aiming to understand better phenomena involved and the limitations of the models available in the ANSYS-CFXÒ code.

Research on multiplexed colour QR code with direct readability

With the rapid popularization of QR code technology, colour QR code is an important direction of its development, making it of great value to research a colour QR code that can be read directly while improving the data capacity. This letter proposes a novel composite colour QR code by combining colour coding and multiplexing technology. Based on the actual demands of high-capacity, this code presents the public identification information in the form of the plain code and conceals the secret information (e.g., authentication information such as traceability, blockchain) as the hidden code. The reading conditions of colour QR codes are discussed, a colour coding model is established and the corresponding algorithm to optimize its design is given. Through code scanning tests, it is verified that this kind of code has significant value in the field of anti-counterfeiting, commodity marketing etc.

Cardinal rank metric codes over Galois rings

In 1985, Gabidulin introduced the rank metric in coding theory over finite fields, and used this kind of codes in a McEliece cryptosystem, six years later. In this paper, we consider rank metric codes over Galois rings. We propose a suitable metric for codes over such rings, and show its main properties. With this metric, we define Gabidulin codes over Galois rings, propose an efficient decoding algorithm for them, and hint their cryptographic application.

Iconic and Symbolic Representation in Early Mathematics Teaching

Mathematics is an abstract science, it uses a specific symbolic language, a kind of code that is difficult for children to comprehend. Using operation signs and numbers is not simple and obvious for them. The learning of mathematics by children cannot therefore be based on symbols alone. Action is needed first. However, since there is a large gap between an action and a symbol, it is necessary to support the teaching of mathematics with graphic means. Introducing a graphic element as a kind of methodological aid requires careful preparation, motivation and embedding it in previous physical activities performed by children. Otherwise, such an item, instead of facilitating the understanding of a concept, hinders that understanding and becomes an illusory aid. This paper describes the role and importance of pictorial representation in early mathematics teaching. Based on selected examples of tasks from textbooks, the difficulties of illustrating mathematical concepts are presented, and appropriate methodological solutions in this area are indicated.

Manggaraian expressions of environmental preservation: a study on ecolinguistics

This paper explores the manggaraian expressions that used to explain the inisiative of people in Manggarai to preserve the environtment. This is a kind of code in which located the local wisdom to manage the surroundings as well as possible so that they will not be disappear. It promotes some problems such as meanings and functions of the expressions in term of preservation the environtment. Then it is designed to describe the meanings and functions of the expressions which become the indicators of environtmental development. These problems can be analyzed by theoretical conccep of ecolinguistics. It is viewed that language is the symbol verbal of comunication, used to describe the problems of environtments. In addition, Sapir said that vocabulary of languages in the world reflects the environtment of its speaker. The two statements indicate what language employs to draw the environtmental issues. It is sum up that language has very important roles to manage the environtment. Data collections includethe informations or qualitative statements that given by the informen, gathered from the field. These informations have been got through the interview and observation. The interview is a way to get the informations.

Triple Cyclic Codes Over 𝔽q + u𝔽q

Let [Formula: see text], where [Formula: see text] is a power of a prime number [Formula: see text] and [Formula: see text]. A triple cyclic code of length [Formula: see text] over [Formula: see text] is a set that can be partitioned into three parts that any cyclic shift of the coordinates of the three parts leaves the code invariant. These codes can be viewed as [Formula: see text]-submodules of [Formula: see text]. In this paper, we study the generator polynomials and the minimum generating sets of this kind of codes. Some optimal or almost optimal linear codes are obtained from this family of codes. We present the relationship between the generators of triple cyclic codes and their duals. As a special class of triple cyclic codes, separable codes over [Formula: see text] are discussed briefly in the end.

An Entropy-Based Approach: Compressing Names for NDN Lookup

NDN (Named Data Networking) is one of the most popular future network architecture, a “clean slate” design for replacing the traditional TCP/IP network. However, the lookup algorithm of FIB entry in NDN is the bottleneck of the current NDN. Owing to the unique identifier of content name, whose length is variable, the size of FIB entries is proliferating, and the effectiveness of lookup algorithms is low. This paper proposed an entropy-oriented name processing mechanism, compressing the content names effectively by bringing in an encoding scheme. This mechanism can be split into two parts: name compression and lookup. The first part compressed the content names and converted them into a kind of code with a smaller size by considering the information redundancies of content names; the second part built a compact structure to minimize the memory footprint of FIB entries with keeping the high lookup performance. This mechanism outperformed many traditional name lookup algorithms, had better flexibility and cost less memory footprint.

First coupled GENE–XGC microturbulence simulations

Covering the core and the edge region of a tokamak, respectively, the two gyrokinetic turbulence codes Gyrokinetic Electromagnetic Numerical Experiment (GENE) and X-point Gyrokinetic Code (XGC) have been successfully coupled by exchanging three-dimensional charge density data needed to solve the gyrokinetic Poisson equation over the entire spatial domain. Certain challenges for the coupling procedure arise from the fact that the two codes employ completely different numerical methods. This includes, in particular, the necessity to introduce mapping procedures for the transfer of data between the unstructured triangular mesh of XGC and the logically rectangular grid (in a combination of real and Fourier space) used by GENE. Constraints on the coupling scheme are also imposed by the use of different time integrators. First, coupled simulations are presented. We have considered collisionless ion temperature gradient turbulence, in both circular and fully shaped plasmas. Coupled simulations successfully reproduce both GENE and XGC reference results, confirming the validity of the code coupling approach toward a whole device model. Many lessons learned in the present context, in particular, the need for a coupling procedure as flexible as possible, should be valuable to our and other efforts to couple different kinds of codes in pursuit of a more comprehensive description of complex real-world systems and will drive our further developments of a whole device model for fusion plasmas.

A Class of Optimal Cyclic Symbol-pair Codes from Combinatorial Designs

Motivated by the application of high-density data storage technologies, symbol-pair codes were defined by Cassuto and Blaum recently. In this coding model, every two consecutive symbols are read together to address channels with high write resolution but low read resolution, so that individual symbols cannot be read off due to physical limitations. Since such kind of code was introduced, a lot of work has been carried out by many researchers, including upper bounds, constructions, decoding et.al. In this work, we continue the research on the construction of symbol-pair codes. We will present one special construction for cyclic symbol-pair codes from the perspective of combinatorial designs.

Low Density Parity-Check Codes Based on Affine Permutation Matrices

Recently, Low Density Parity-Check (LDPC) codes based on Affine Permutation Matrices (APM) drew lots of attention. Compared with the Quasi-Cyclic LDPC (QC-LDPC) codes, these kinds of codes have some advantages. APM-LDPC codes obtain lower cycle-distributions, minimum hamming distance and greater girth. This paper explains the importance of cyclic distribution by comparing APM-LDPC codes with QC-LDPC codes. Then a particular form of APM-LDPC codes is proposed and researched. The new codes can low down the cycle-distribution to larger extent. In the following research, an effective method, which constructs the new codes with fixed girth, is proposed. Simulations show that the construction method is reasonable and effective. The transmission performances are better than the traditional methods, as well. Finally, the implementation and verification are carried out on FPGA.

Do we use visual codes when information is not presented visually?

For many years, the working/short-term memory literature has been dominated by the study of phonological codes. Consequently, insufficient attention has been devoted to visual codes. In the present study, we attempt to remedy the situation by exploring a critical aspect of modern models of working memory, namely the principle that responses do not depend primarily on what kinds of materials are presented, but on what kinds of codes are generated from those materials. More specifically, we used the visual similarity effect as a tool to ask whether there is a generation of visual codes when information is not presented visually. In two immediate serial recall experiments, we manipulated the visual similarity (similar words, dissimilar words), the presentation modality (visual presentation, auditory presentation), and concurrent articulation (none, concurrent articulation). We observed a visual similarity effect independent of presentation modality. Comparable results were observed with two different sets of stimuli and with or without concurrent articulation. Thus, for the first time, we demonstrate that, from acoustically presented word lists, visual codes in working/short-term memory are generated, producing a visual similarity effect. It is now clear that the encoding of visual or acoustic presentation to include the opposite type of representation is bidirectional.

New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields

Low-Density Parity-Check (LDPC) codes have low linear decoding complexity, which is a kind of good codes with excellent performance. Therefore, LDPC codes have great research value. Two kinds of LDPC codes are constructed based on vector space over finite field. The code length, code rate and minimum distance are given. Moreover, the two kinds of codes are compared with the existing codes, and the constructed codes are better than some existing ones in terms of code rate or minimum distance.

On Iconic-Discursive Representations: Do they Bring us Closer to a Humean Representational Mind?

This paper argues, contrary to Fodor’s well-known position, that the iconic and discursive modes of representation are not mutually exclusive categories. It is argued that there exists at least a third kind of representation which blends the semantic properties of icons and the syntactic properties of discourses. We reason that this iconic-discursive genus behaves differently from other representational formats, such as distributed representations or maps, previously put forward as challenging Fodor’s basic distinction. A reflection follows about how this kind of representation impacts on the Fodorian issues for which the original dual distinction was argumentatively instrumental, namely, the kinds of codes and possible inter-code relations accessible to the representational mind. The suggestion is put forward that iconic-discursive representations may facilitate trade-offs between the world and the representational mind, as well as between the differently complex levels of representation that mediate between percepts and concepts. We conclude that such aspects of the computational mind, which until now appeared to be stubbornly resistant with respect to a conciliation of Hume’s empiricism and Fodor’s computationalism, may be more easily accessed and understood taking advantage of the biosemiotics perspective and acknowledging the richness of the biosemiotics codes accessible to cognition.

Generalized Subspace Subcodes With Application in Cryptology

Most codes with an algebraic decoding algorithm are derived from Reed-Solomon codes. They are obtained by taking equivalent codes, for example, generalized Reed-Solomon codes, or by using the so-called subfield subcode method, which leads to alternant codes over the underlying prime field, or over some intermediate subfield. The main advantage of these constructions is to preserve both the minimum distance and the decoding algorithm of the underlying Reed-Solomon code. In this paper, we explore in detail the subspace subcodes construction. This kind of codes was already studied in the particular case of cyclic Reed-Solomon codes. We extend this approach to any linear code over the extension of a finite field. We are interested in additive codes who are deeply connected to subfield subcodes. We characterize the duals of subspace subcodes. We introduce the notion of generalized subspace subcodes. We apply our results to generalized Reed-Solomon codes which leads to codes with interesting parameters, especially over a large alphabet. To conclude this paper, we discuss the security of the use of generalized subspace subcodes of Reed-Solomon codes in a cryptographic context.

Broadcaster’s Code Switching in Musik Aktifitas Program At Radio Suara Kancanta 100,3 Fm Labuhan Haji, Lombok Timur, Ntb - Indonesia

This study analyzed the implementation of code switching by an announcer or broadcaster in one of the broadcast programs namely Musik Aktifitas program at Radio Suara Kancanta 100,3 fm ,Lombok Timur. The objectives of this study were (1) find the type of code used in Musik Aktifitas programs (2) determine the frequency of the most dominant use of code by the announcer or broadcasterin Musik Aktifitas program. ) Identify the factors behind that made the broadcaster used the code switching in that program. To obtain the data in a descriptive qualitative study, the writer use a recording technique followed by in-depth interviews with the broadcaster of Musik Aktifitas program to determine the background or the reasons of using code switching . The results of this study indicate that (1) there were kinds of code used in Musik Aktifitas program namely tag switching, intrasentensial switching and intersentensial switching (2) types of code which most predominantly used by broadcasters in Musik Aktifitas program was tag switching (45, 65% ), followed by intrasentensial switching (43.48%) and Intersentensial switching (10.87%). There were (6) reasons why the broadcaster of Musik Aktifitas program used in that program as follows : 1. Talking about particular topic ,2. Quoting Somebody else ,3. Being emphatic about something ,4. Sentence fillers or sentence connectors 5.Expressing group identity and 6. Real lexical need.

Periodic dependences in the distribution of chemical elements in the human hair ash residue

150 years ago D. I. Mendeleev revealed the Periodic law to the world and since that time periodic dependencies have been increasingly used in various fields of basic and applied sciences. For the first time we consider the regularities of periodic dependences of the concentration of chemical elements in the ash residue of human hair on the number of the element. Such dependencies for various regions of Russia reveal strictly individual character. It is shown that distributions of the chemical elements for men and women also differ, as well as the distributions determined for the same groups in inhabitants of different regions of residence and depend to a significant extent on the genetic and physiological characteristics of human organism, variability of environmental conditions, earlier diseases and other impacts. This means that population of different urban regions (e.g., Siberian region) is characterized by a strictly individual distribution of biogenic elements. A hypothesis has been put forward that extrema observed on the studied dependences can be a kind of code for a given locality, reflecting correlation with various factors of genetic and ecological nature.