Coding Theory

The aim of this study is to research the effect of the preferences of the students concerning PowerPoint presentations in financial accounting courses on their final scores. The data was collected from questionnaires that were applied to 77 students taking Financial Accounting I course in Anadolu University. According to the results of the study; The preference of the students about PowerPoint presentations have no significant effect on their final scores. However when the preferences about PowerPoint presentations are combined with an appropriate study environment, this effect positively increases the final score.

Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? The first author previously extended this question to ask about not only fixed points but also two-cycles, and gave heuristics (building on work of Zhang, Cobeli, Zaharescu, Campbell, and Pomerance) for estimating the number of such pairs given certain conditions on g and h. In this paper we extend these heuristics and prove results for some of them, building again on the aforementioned work. We also make some new conjectures and prove some average versions of the results.

In this paper we apply different techniques of information distortion on a set of classical books written in English. We study the impact that these distortions have upon the Kolmogorov complexity and the clustering by compression technique (the latter based on Normalized Compression Distance, NCD). We show how to decrease the complexity of the considered books introducing several modifications in

A coding theory approach to error control in redundant residue number systems (RRNSs) is presented. The concepts of Hamming weight, minimum distance, weight distribution, and error detection and correction capabilities in redundant residue number systems are introduced. The necessary and sufficient conditions for the desired error control capability are derived from the minimum distance point of view. Closed-form expressions are

Gender has been consistently controlled as a variable in usability and playability tests. However, there is no consensus on whether and how gender differences should influence the design of digital environments. According to some research, digital environments may be unintentionally designed especially for males as a result of the existing gender biases which risks reproducing gender-polarized culture in a computational field. This study attempts to highlight that females are still being negatively affected by existing gender stereotypes and prescribed gender identities despite relatively equal access and use of computer technology. This qualitative study aims to provide insights about the first-time user experience in a home environment of 16 middle school children in Turkey (8 males-8 females), aged between 11 and 14 years, with a code learning game named "Code Combat". The analysis is supported with complementary quantitative findings. The present study investigates the participants' conceptualizations and opinions toward coding concept and this specific coding game. Further, it explores how existing gender stereotypes and gender biased expectations impact their behaviors and attitudes in the context of game experience. Our results indicated that perceived computer competence and perceived coding difficulty had important effects on the participants' performance relatedly with their gender identity. According to our findings, there are important gender differences to be found in our 9 constructs, namely; perceived computer competence, perceived coding difficulty, identification, perceived game difficulty, perceived success, level of enjoyment, level of anxiety, the likelihood of playing it another time and the likelihood of trying new features.

The concept of ‘core category’ is most associated with the grounded theory method developed by Barney Glaser and Anselm Strauss but has been utilised in relation to other qualitative methods such as phenomenology. The terminology varies and a core category may sometimes be referred to or indexed as core theme, core meaning, core variable, or central category. A core category is the main theme, story-line, or process which subsumes and integrates all lower-level categories in a grounded theory, encapsulates the data efficiently at the most abstract level, and is the category with the strongest explanatory power......

One of the most important applications of algebraic geometry, known as linguistics, has been used in linguistics, military and diplomatic. It was said that the first to mobilize a comment between the army is the Pharaohs. He also mentioned that the Arabs have old attempts at encryption. The Chinese used many methods in conveying messages during war. Their intention was to get the wrong signals. This research is a general study on science (word) searching for several methods in English linguistics, a word of thanks and a message.

In 2 experiments, high– and low–spatial ability students viwed a computer-generated animation and listened simultaneously (concurrent group) or successively (successive group) to a narration that explained the workings either of a bicycle tire pump (Experiment 1) or of the human respiratory system (Experiment 2). The concurrent group generated more creative solutions to subsequent transfer problems than did the successive group;

The Heartbleed bug is corrupt „devil code‟ that steals information from the openSSL protocol. “OpenSSL is a popular open-source cryptographic library that Implements the SSL and TLS protocols.” SSL (secure socket layer) and TLS (transport layer security protocol) provide the secure layer in communication privacy and security lies from web network to virtual private network (VPNs) and email to instant messaging. It is server side software for establishment of secure connection over web and other communication terminology.

Techniques from coding theory are applied to study rigorously the capacity of the Hopfield associative memory. Such a memory storesn-tuple ofpm 1's. The components change depending on a hard-limited version of linear functions of all other components. With symmetric connections between components, a stable state is ultimately reached. By building up the connection matrix as a sum-of-outer products ofmfundamental memories, one hopes to be able to recover a certain one of themmemories by using an initialn-tuple probe vector less than a Hamming distancen/2away from the fundamental memory. Ifmfundamental memories are chosen at random, the maximum asympotic value ofmin order that most of themoriginal memories are exactly recoverable isn/(2 log n). With the added restriction that every one of themfundamental memories be recoverable exactly,mcan be no more thann/(4 log n)asymptotically asnapproaches infinity. Extensions are also considered, in particular to capacity under quantization of the outer-product connection matrix. This quantized memory capacity problem is closely related to the capacity of the quantized Gaussian channel.

In this work, linear codes over the ring S4 = F2 + uF2 + u2F2 + u3F2 are considered. The
Lee weight and gray map for codes over S4 are defined and MacWilliams identities for the complete, the
symmetrized and the Lee weight enumerators are obtained. Cyclic and (1 + u2)-constacyclic codes over
S4 are studied, as a result of which a substantial number of optimal binary codes of di↵erent lengths are
obtained as the Gray images of cyclic and constacyclic codes over S4.

Un esperimento iniziato nel 2001, e divenuto nel tempo un riferimento culturale su scala nazionale. Ritengo che il fine del mio lavoro sia aiutare a comprendere, e che la cultura debba essere libera e senza ostacoli di accesso. Chi acquista il formato cartaceo, ebook, od effettua una donazione, entra a far parte dei sostenitori del progetto, e può scaricare la versione PDF dell'edizione più recente, perfettamente navigabile e stampabile. L'edizione più recente è di Giugno 2019, la trovi presso https://teoriadeisegnali.it/

11th International Conference on Information Theory (IT 2022 ) will provide an excellent
international forum for sharing knowledge and results in theory, methodology and
applications of Information Theory. The goal of this conference is to bring together
researchers and practitioners  from academia and industry to  focus  on understanding  modern
Information Theory concepts and  establishing new  collaborations in these areas.  Authors are
solicited to  contribute  to  the  conference by  submitting articles that illustrat e research results,
projects, surveying works and industrial experiences that describe significant advances in the
areas of Information Theory and applications.

This short article gives an introduction to binary linear block codes for error detection and error correction.  Various codes are discussed and compared, including repetition codes, Hamming codes, and Reed-Muller codes.

A version of this article was published by the Radio Society of Great Britain in their members' magazine/journal, 'RadCom'.

The upper bound for (k,r)-arcs in a projective plane PG (2,31) of 3≤ r ≤ 30 is un known
except for r =16,17 which is found in [4] and [7].
In this paper we finding unknown values for (k,r)-arcs in a projective plane PG(2,31) for
3≤ r ≤10 through studing the upper bound as in table (2.3), also we show that the non existence
some of these arcs for the value (q+3)/2 < r < (q-1), and we getting Theorems(1.3.8) and (1.3.9).

This paper describes a pedagogical approach, Coding as Another language (CAL) to teach programming and computational thinking in early childhood. The CAL curriculum connects powerful ideas from the discipline of computer science with ideas from literacy in a way that is developmentally appropriate for children 4-8 years of age. CAL is free and can be used with two widely available programming environments for young children: the free on-screen ScratchJr app and the KIBO robotics kit that doesnt require keyboards or screens. Through 24 lessons centered on books, CAL emphasizes creative play and self-expression by positioning the learning of programming as the mastering of a new symbolic language. In addition, CAL provides opportunities for socio-emotional development in the context of a collaborative play-based learning environment, a coding playground, in which there is purposeful exploration of ethical and moral values and intentional promotion of positive behaviors and chrachter strenghs.

Dilbilgisi, genel anlamda, bir dile ait sözcüklerin dizilim sırasını gösteren kurallar bütününe denir, ancak dilbilgisi çeşitleri göz önüne alındığında, bu tanım her dilbilgisi türüne göre değişiklik gösterebilir. Bu dilbilgisi çeşitlerinin başlıcaları şunlardır: Geleneksel betimsel, karşılaştırmalı üretimsel, dönüşümsel ve evrensel dilbilgisidir. Dilbilgisi öğretimi yaygın olarak tüme varım (inductive) tümden gelim (deductive) ve seçmeli (eclectic) olarak öğretilmektedir (Cross, 1995). İngilizce yazılmış dilbilgisi kaynakların nerdeyse hepsinde dilbilgisi öğretimi betimsel olarak – tanım ve örnek cümleler – açıklanmaktadır. Sadece, bir kaynakta sıfat sıralaması İngilizce bir cümlenin baş harfleriyle kodlanmıştır (Allsop,1990:78). Şöyle ki:
Very soon a train should come.
Value/opinion size age temprature shape colour origin, material.
Ülkemizde yabancı dil öğretimi ile ilgili sorun devam etmektedir. Yabancı dil öğrenenler genelde ya pratik konuşamamaktan ya da dilbilgisi/sözcük  eksikliğinden şikâyet etmektedir. İngilizce dilbilgisi sorunu kodlama olarak bilinen hafıza teknikleri öğretilerek aşılabileceği önerilmektedir.
Bugünkü bilgilerimize göre kodlama, bilginin uzun süreli hafızaya yerleşmesini sağlamaktadır. Şöyle ki: Bilgiler duyusal hafızaya gelir. Burada tanınan (T), algılanan (A) ve dikkat edilen (D) bilgi = (TAD) kısa süreli hafızaya geçer ve 10 ile 20sn kalır. Bilgi burada Tekrar edilir (T) ve Anlamlı (A) Kodlanırsa (K) uzun süreli hafızaya geçip kalıcı olmaktadır.Bir benzetme ile TADına bakılan bilgiyi kişi isterse taç gibi kafasına TAKabilir.
Akrostiş, loci, bağlama, şekil-resim, hafıza çivileri ve çağrışım yapmak kodlama (hafıza) tekniklerinden bazılarıdır. Kodlayarak dil öğrenenler, öğrenilecek bilgiyi, kendi öğrenme yöntemlerine göre işleyerek zihinlerine yazmaktadırlar. Türkçe bir veya iki sözcük içerisinde ifade edilebilen İngilizce dilbilgisi kuralları - dİNGilliYOR, DOlaR, DİDinDİ, VEREmDİ, HAStayDI, HADemeyMİŞ, siVİLLeşECEK. CANlanABİLİR, MAYalanABİLİR - yukarıdaki hafıza teknikleri (kodlamalar) kullanılarak daha anlamlı hale getirilebilir. Şöyle ki: Türkçe sert ünsüzleri (f s t k ç ş h p), sıfat fiil eklerini ("-an,-ası, -mez,-ar,-dik,-ecek,-miş") ve isim fiil eklerini (-ma, -ış, -mak) öğretmek için üretilen ve anonim olarak kullanılan kodlar nasıl unutulmadı ve etkili olduysa, İngilizce dilbilgisi öğretimi için üretilen kodlamalar da aynı şekilde etkili ve kalıcı olabilir.
Ayrıca, İngilizce dilbilgisi yapılarını öğretmek için kullanılan bu kodlar, yabancılara Türkçe öğretimi (Türkçe’nin yabancı dil olarak öğretimi) için hazırlanan kitap ve etkinliklerde de kullanılabilir.

In satelite communication there are so many different noise characteristics which causes of errors. In this work to facilitate the error free satelite communication we examined the causes of the errors and seeked the ways of reduction the effects of these errors. Furthermore, main study is to make an FPGA core for Forward Error Correcting codes which can be used for Telecommand(TC) Space Data Link Protocol is defined by Consultative Committee for Space Data Systems (CCSDS). The modified special code Bose-Chaudhuri-Hocquenghem(BCH) using a data unit called the Communications Link Transmission Unit (CLTU), which consists of a Start Sequence, BCH Codeblocks, and a Tail Sequence was implemented by VHDL , simulations were also done for one , two and three bit errors in fifty six bits of data. The simulations show us this code detects and corrects one bit error and shows the location of the error , for more bit errors it only detects the error. For datarate and error correction simplicity of TC link this code has optimum performance .

Traditional System-on-Chip (SoC) design employed shared buses for data transfer among various subsystems. As SoCs become more complex involving a larger number of subsystems, traditional busbased architecture is giving way to a new paradigm for on-chip communication. This paradigm is called Network-on-Chip (NoC). A communication network of point-to-point links and routing switches is used to facilitate communication between subsystems. The routing switch proposed in this paper consists of four components, namely the input ports, output ports, switching fabric, and scheduler. The scheduler design is described in this paper. The function of the scheduler is to arbitrate between requests by data packets for use of the switching fabric. The scheduler uses an improved round robin based arbitration algorithm. Due to the symmetric structure of the scheduler, an area-efficient design is proposed by folding the scheduler onto itself, thereby reducing its area roughly by 50%.

International Journal on Information Theory (IJIT) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Information Theory. Authors are solicited to contribute to the journals by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of Information Theory and applications.

The notion of n-best approximations can be used for error correction in coding theory. The notion of n-eigen values can be used in deterministic modal superposition principle for undamped structures, which can find its applications in finite element analysis of mechanical structures with uncertain parameters. Further, it is suggested that the concept of n-matrices can be used in real world problems which adopts fuzzy models like Fuzzy Cognitive Maps, Fuzzy Relational Equations and Bidirectional Associative Memories. The applications of these algebraic structures are given in the third chapter. The fourth chapter suggests problems to further a reader's understanding of the subject.

This paper explored the position statement NAEYC and the FRC created almost two decades ago regarding appropriate usage of technology with young children. While their recommendations are vague and arbitrary, they are grounded in research and appropriate still today.
This paper supplements the position statement by including relevant pieces to the author's current research occurring in Michigan where children are leading the curricular path and choose to develop skills connected to coding.
Exploration of screen-free technology is also addressed.