نتایج جستجو برای: linear code
تعداد نتایج: 637348 فیلتر نتایج به سال:
We derive new asymptotic upper bounds on the generalized weights of a binary linear code of a given size. We also prove some asymptotic results on the distance distribution of binary codes.
one of the most important number sequences in mathematics is fibonacci sequence. fibonacci sequence except for mathematics is applied to other branches of science such as physics and arts. in fact, between anesthetics and this sequence there exists a wonderful relation. fibonacci sequence has an importance characteristic which is the golden number. in this thesis, the golden number is observed ...
This is the first instance in a series of papers on single-pass generation of various types of derivative code by syntax-directed translation. We consider the automatic generation of tangent-linear code by forward mode automatic differentiation implemented as the bottom-up propagation of synthesized attributes on the abstract syntax tree. A proof-of-concept implementation is presented based on ...
On the way of generalizing recent results by Cock and the second author, it is shown that when the basis q is odd, BCH codes can be lengthened to obtain new codes with covering radius R = 2. These constructions (together with a lengthening construction by the first author) give new infinite families of linear covering codes with codimension r = 2k + 1 (the case q = 3, r = 4k + 1 was considered ...
the purpose of the present study is to find out whether bilinguals of khuzestan-arab origin or monolinguals of iranian origin code-switch during learning or speaking english and which group is more susceptible to code-switch. to this end, the students of 24 classes from high schools and pre- university centers were screened out, and interviewed and their voices and code-switchings were recorded...
An algebraic construction for constant dimension subspace codes is called orbit code. It arises as the orbits under the action of a subgroup of the general linear group on subspaces in an ambient space. In particular orbit codes of a Singer subgroup of the general linear group has investigated recently. In this paper, we consider the normalizer of a Singer subgroup of the general linear group a...
We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n, k, r, t)SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t(≤ t) erasures can be sequentially recovered, each one by r (2 ≤ r < k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovere...
We consider the locally repairable codes (LRC), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called (n, k, r, t)-SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t (≤ t) erasures can be sequentially recovered, each by r (2 ≤ r < k) other code symbols. Here, a sequential recovering means that the erased symbols are r...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید