標題: Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 5th International Co Lloren? Huguet,Alain Poli Conference proceedings 198 [打印本頁] 作者: 銀河 時間: 2025-3-21 18:16
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)學科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網絡公開度
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網絡公開度學科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次學科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用學科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋學科排名
作者: Ossification 時間: 2025-3-21 22:41
Covering radius for codes obtained from T(m) triangular graphs,damental circuit matrix for it. Using this matrix as a generator matrix we can obtain a single-error-correcting linear code C(T(m)) with parameters:.n=(m(m?1) (m?2))/2, k=(m(m?1) (m?3)+2)/2 and d=3..Using the fact that each codeword in C(T(m)) is formed by a combination of simple circuits in T(m), w作者: 語言學 時間: 2025-3-22 03:30 作者: dialect 時間: 2025-3-22 07:16
An Iterative Euclidean Algorithm,an extended algorithm. We show how all polynomials obtained by the classical extended Euclidean algorithm are actually automatically produced by that iterative process..In sum, an algorithm is given which is as economical as BERLEKAMP‘s for decoding and which is proved to perform decoding of alterna作者: fledged 時間: 2025-3-22 09:57 作者: Externalize 時間: 2025-3-22 13:31
Distribution of codewords and decoding error rate in rs codes with application to performance evaluconcerning to it remain to be some treatments. Now, in this paper, we propose a new strategy to determine error rate (measured in bits, symbols,..) suitable for ECC design as well as for performance evaluation to optical disc. It is different essentially from those traditional ones in principle. As 作者: 溫和女孩 時間: 2025-3-22 21:07
Newton symmetric functions and the arithmetic of algebraically closed fields,omial whose roots are the sum (resp. the product) of the roots of two given polynomials. This formula is obtained considering a transformation sending a polynomial in the sequence of its Newton symmetric functions, and allows to obtain a better bound for the complexity of the computation of the abov作者: Allege 時間: 2025-3-22 23:53 作者: overreach 時間: 2025-3-23 03:06 作者: Priapism 時間: 2025-3-23 05:31
Non linear covering codes : A few results and conjectures, For fixed t, μ. (t) is upperbounded by a real number c(t) independent of n. For t=1, one can take c(1)=1.5. We conjecture : .. μ.(1)=1. Another conjecture is : . K(n+2,t+1)≤K(n,t). We prove this for t=1 and discuss a possible way of proving it for higher t, by extensions of the concept of normality.作者: 貪婪的人 時間: 2025-3-23 12:48 作者: DECRY 時間: 2025-3-23 17:41 作者: 侵蝕 時間: 2025-3-23 18:23 作者: 牽索 時間: 2025-3-23 23:31 作者: 認為 時間: 2025-3-24 05:13
Vahid Vahidinasab,Behnam Mohammadi-Ivatlooan extended algorithm. We show how all polynomials obtained by the classical extended Euclidean algorithm are actually automatically produced by that iterative process..In sum, an algorithm is given which is as economical as BERLEKAMP‘s for decoding and which is proved to perform decoding of alterna作者: AWRY 時間: 2025-3-24 08:40
Ali Paeizi,Mohammad Taghi Ameli,Sasan Azadichains of products of chains of size .,...,. — where . is a prime. We first explain this correspondance ; then we define as special antichains the weakly self-dual codes and the even codes over .(4) which are affine-invariant codes.作者: 蜿蜒而流 時間: 2025-3-24 13:52 作者: 脆弱么 時間: 2025-3-24 18:32 作者: 放氣 時間: 2025-3-24 21:49
https://doi.org/10.1007/978-981-16-1256-5 For fixed t, μ. (t) is upperbounded by a real number c(t) independent of n. For t=1, one can take c(1)=1.5. We conjecture : .. μ.(1)=1. Another conjecture is : . K(n+2,t+1)≤K(n,t). We prove this for t=1 and discuss a possible way of proving it for higher t, by extensions of the concept of normality作者: atopic-rhinitis 時間: 2025-3-25 01:17
https://doi.org/10.1007/978-3-642-48337-0Exhaustive search for minimally autocorrelated binary sequences has not met any conclusive answer yet. We present here a new algorithm which allows us to obtain in a reasonable time results for heretofore unreachable values.作者: intention 時間: 2025-3-25 05:37 作者: 致詞 時間: 2025-3-25 09:22 作者: Instinctive 時間: 2025-3-25 14:17 作者: 駕駛 時間: 2025-3-25 17:11 作者: Surgeon 時間: 2025-3-25 21:28
Searching for weakly autocorrelated binary sequences,Exhaustive search for minimally autocorrelated binary sequences has not met any conclusive answer yet. We present here a new algorithm which allows us to obtain in a reasonable time results for heretofore unreachable values.作者: 碎石 時間: 2025-3-26 03:34 作者: otic-capsule 時間: 2025-3-26 07:06 作者: indecipherable 時間: 2025-3-26 09:15 作者: Intact 時間: 2025-3-26 14:29
An algebraic model for the storage of data in parallel memories,The use of SIMD computers requires efficient schemes of storage of data in order to have conflict-free access in parallel computation. In this paper we restate the problem of finding such schemes in an algebraic context. This approach supplies simple statements and proofs of main results on the subject, and allows further development of it.作者: 鬼魂 時間: 2025-3-26 20:09 作者: 完成才會征服 時間: 2025-3-26 21:28 作者: 得意牛 時間: 2025-3-27 03:24 作者: 使出神 時間: 2025-3-27 06:38 作者: Contracture 時間: 2025-3-27 12:44 作者: Notorious 時間: 2025-3-27 16:40
Towards an expert system for error correcting codes: SECC,作者: acetylcholine 時間: 2025-3-27 18:25 作者: arthrodesis 時間: 2025-3-27 23:01
,Grobner bases, Ritt’s algorithm and decision procedures for algebraic theories,作者: Myosin 時間: 2025-3-28 03:04
Algebrric solution of systems of polynomirl equations using Groebher bases,作者: Campaign 時間: 2025-3-28 06:28 作者: 帶來的感覺 時間: 2025-3-28 13:46 作者: 被告 時間: 2025-3-28 15:10
https://doi.org/10.1007/978-3-319-16024-5ce from those of the ordinary, we cited some heuristic examples. Finally, two appendices are attached, one is a special discussion concerning to requisite qualifications of RS codes to be employed for our strategy, in which, some numerical examples are given, the other one is a decoding procedure fo作者: SAGE 時間: 2025-3-28 18:50 作者: Myocarditis 時間: 2025-3-28 23:01 作者: 豐富 時間: 2025-3-29 04:22
Frederik Milkau,John Collins,Wolfgang Ketterof [2] about the decomposition of directed graphs, applied to regular tournaments allow to determine their convex subsets in time 0(n.)..Very recent results of [1] about digraph decompositions gives an 0(n.)-algorithm. Our result is less general but much simpler.作者: Spinal-Fusion 時間: 2025-3-29 10:38
Vahid Vahidinasab,Behnam Mohammadi-Ivatloont codes by the simple argument used for the EUCLIDEAN algorithm..Finally a result of BERLEKAMP‘s [1] is exploited to reduce by another half the degrees of all polynomials involved in the decoding process in the particular case of binary BCH codes.作者: Suggestions 時間: 2025-3-29 11:44 作者: 憤怒事實 時間: 2025-3-29 16:07
https://doi.org/10.1007/978-3-642-48337-0=(m(m?1) (m?2))/2, k=(m(m?1) (m?3)+2)/2 and d=3..Using the fact that each codeword in C(T(m)) is formed by a combination of simple circuits in T(m), we give a characterization of its codewords which allow us to show that:.so, it is finally proved that given T(m) and any spanning tree in it, C(T(m)) has σ=[m(m?1)/4].作者: esthetician 時間: 2025-3-29 22:31 作者: Inordinate 時間: 2025-3-30 00:19
Non simple tournaments : Theoretical properties and a polynomial algorithm,of [2] about the decomposition of directed graphs, applied to regular tournaments allow to determine their convex subsets in time 0(n.)..Very recent results of [1] about digraph decompositions gives an 0(n.)-algorithm. Our result is less general but much simpler.作者: 痛得哭了 時間: 2025-3-30 05:59 作者: 不可救藥 時間: 2025-3-30 09:05 作者: sterilization 時間: 2025-3-30 13:13 作者: 邪惡的你 時間: 2025-3-30 18:50
0302-9743 and general results in coding theory), computational algebra, Gr?bner basis, complexity, finite algebra and graphs. The proceedings of the 6th conference are published as Vol. 357 of the .Lecture Notes in Computer . .Science..978-3-540-51082-6978-3-540-46150-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 等待 時間: 2025-3-30 21:54 作者: 你正派 時間: 2025-3-31 01:17 作者: Conquest 時間: 2025-3-31 08:20
9樓作者: Crumple 時間: 2025-3-31 12:24
9樓作者: 胡言亂語 時間: 2025-3-31 14:18
9樓作者: Contracture 時間: 2025-3-31 17:35
10樓作者: conscribe 時間: 2025-3-31 23:27
10樓作者: installment 時間: 2025-4-1 02:04
10樓作者: 假裝是我 時間: 2025-4-1 06:36
10樓
