標題: Titlebook: Eurocode ’92; International Sympos P. Camion,P. Charpin,S. Harari Book 1993 Springer-Verlag Wien 1993 algebra.algorithms.coding.coding theo [打印本頁] 作者: 悲傷我 時間: 2025-3-21 19:53
書目名稱Eurocode ’92影響因子(影響力)
書目名稱Eurocode ’92影響因子(影響力)學科排名
書目名稱Eurocode ’92網(wǎng)絡(luò)公開度
書目名稱Eurocode ’92網(wǎng)絡(luò)公開度學科排名
書目名稱Eurocode ’92被引頻次
書目名稱Eurocode ’92被引頻次學科排名
書目名稱Eurocode ’92年度引用
書目名稱Eurocode ’92年度引用學科排名
書目名稱Eurocode ’92讀者反饋
書目名稱Eurocode ’92讀者反饋學科排名
作者: 過度 時間: 2025-3-21 22:31 作者: 易改變 時間: 2025-3-22 02:59 作者: goodwill 時間: 2025-3-22 06:35
Construction of the Best Binary Cyclic Codes of Even Lengthtablish the set of the minimal distances reached by even length codes, and for each of these distances, to determine the associated generator polynomial of lowest degree. Thanks to this result we construct the complete table of the best possible binary cyclic codes on each minimal distance up to the作者: 殺蟲劑 時間: 2025-3-22 12:25
Weights of Primitive Binary Cyclic Codes from Non-Primitive Codese k over ... We consider N the binary cyclic code C of length N = 2. ?1, generated by.. For special cases, we determine the weights of C by using the weights of the irreducible cyclic code of length s, generated by..作者: Ibd810 時間: 2025-3-22 16:51
Boolean Functions on Finite Fields of Characteristic 2 ways to obtain them, and characterize them as the solutions of a differential equation. We prove that their derivatives are the squares of those polynomials which are invariant under a certain transformation that we introduce, and deduce a result on BCH codes. Eventually, we use them to solve some 作者: Ibd810 時間: 2025-3-22 19:58 作者: MILL 時間: 2025-3-23 00:59
On Generalized Bent Functionsnons une majoration du rayon de recouvrement des codes de Reed-Muller affines construits sur des anneaux finis et commutatifs. Une majoration du degré des fonctions courbes généralisées termine l’article.作者: Intellectual 時間: 2025-3-23 03:38
Bounds for Self-Complementary Codes and Their Applicationshe size of a self-complementary code with a given minimum distance . presented here is in general better than the corresponding bound for arbitrary binary codes in the Hamming space. Some applications of this bound for estimating the minimum distance of self-dual binary codes, the cross-correlation 作者: 虛假 時間: 2025-3-23 09:16 作者: ARENA 時間: 2025-3-23 11:21 作者: 耐寒 時間: 2025-3-23 16:42 作者: arboretum 時間: 2025-3-23 18:50
CISM International Centre for Mechanical Scienceshttp://image.papertrans.cn/e/image/316566.jpg作者: 拉開這車床 時間: 2025-3-24 00:19 作者: 堅毅 時間: 2025-3-24 04:32 作者: 貧窮地活 時間: 2025-3-24 09:51 作者: osculate 時間: 2025-3-24 12:34
,Feststellen von Kausalzusammenh?ngen,tablish the set of the minimal distances reached by even length codes, and for each of these distances, to determine the associated generator polynomial of lowest degree. Thanks to this result we construct the complete table of the best possible binary cyclic codes on each minimal distance up to the作者: 盡管 時間: 2025-3-24 16:11 作者: AGONY 時間: 2025-3-24 21:19 作者: chlorosis 時間: 2025-3-25 01:07 作者: 嚴峻考驗 時間: 2025-3-25 06:38
Is China‘s Currency Increasingly Important?nons une majoration du rayon de recouvrement des codes de Reed-Muller affines construits sur des anneaux finis et commutatifs. Une majoration du degré des fonctions courbes généralisées termine l’article.作者: NIP 時間: 2025-3-25 10:10
Civil Society and the Role of Educationhe size of a self-complementary code with a given minimum distance . presented here is in general better than the corresponding bound for arbitrary binary codes in the Hamming space. Some applications of this bound for estimating the minimum distance of self-dual binary codes, the cross-correlation 作者: EXALT 時間: 2025-3-25 12:49
Limited Resources Limiting Life?,Ceci permet d’envisager des procédés cryptographiques fondés sur ce fait [5]. Il est donc nécessaire pour assurer la sécurité de tels systèmes d’évaluer les algorithmes existants dont le but est justement de trouver de tels mots. Par exemple, dans [5], trouver l’erreur aléatoire introduite pour chif作者: candle 時間: 2025-3-25 18:18 作者: Coterminous 時間: 2025-3-25 22:52
Irritation des Selbstverst?ndlichenIt is shown that the Pellikaan’s decoding algorithm of some families of Goppa codes C.(D, G) needs at most (g+1) effective divisors if the degree of G is odd and at most ?lg/2?+1 effective divisors if the degree is even, where g is the genus of the curve used.作者: homeostasis 時間: 2025-3-26 01:46 作者: 拾落穗 時間: 2025-3-26 07:34
https://doi.org/10.1007/978-3-7091-9989-3In this paper, a necessary and sufficient criterion for self-duality of geometric Goppa codes is given.作者: Suppository 時間: 2025-3-26 11:02 作者: 膠狀 時間: 2025-3-26 12:45
https://doi.org/10.1007/978-3-663-04221-1We give a simple characterization of the q-ary images of the q.-ary cyclic codes of length n in the special case when the order of q module (q. ? 1)/(n,q. ? 1) is m. This is done by introducing an appropriate modulo structure on ...作者: 多節(jié) 時間: 2025-3-26 16:49 作者: Chromatic 時間: 2025-3-26 22:11
On Weighted Coverings and Packings with Diameter OneWe discuss a connection between weighted coverings and packings, study perfect weighted coverings (PWC) with diameter one and determine all the pairs (m.,m.) for which there exists a perfect q-ary linear (m.,m.)-covering.作者: fibula 時間: 2025-3-27 01:35 作者: –FER 時間: 2025-3-27 08:16 作者: 常到 時間: 2025-3-27 11:32
A Characterization of the q-Ary Images of qm-Ary Cyclic CodesWe give a simple characterization of the q-ary images of the q.-ary cyclic codes of length n in the special case when the order of q module (q. ? 1)/(n,q. ? 1) is m. This is done by introducing an appropriate modulo structure on ...作者: archetype 時間: 2025-3-27 15:48 作者: 嚴厲批評 時間: 2025-3-27 20:59
Eurocode ’92978-3-7091-2786-5Series ISSN 0254-1971 Series E-ISSN 2309-3706 作者: LAP 時間: 2025-3-27 23:58 作者: 動物 時間: 2025-3-28 02:05
Exploring the Basic Income Guarantee ways to obtain them, and characterize them as the solutions of a differential equation. We prove that their derivatives are the squares of those polynomials which are invariant under a certain transformation that we introduce, and deduce a result on BCH codes. Eventually, we use them to solve some differential equations.作者: Oversee 時間: 2025-3-28 10:06
Is China‘s Currency Increasingly Important?nons une majoration du rayon de recouvrement des codes de Reed-Muller affines construits sur des anneaux finis et commutatifs. Une majoration du degré des fonctions courbes généralisées termine l’article.作者: hemorrhage 時間: 2025-3-28 12:00
Weights of Primitive Binary Cyclic Codes from Non-Primitive Codese k over ... We consider N the binary cyclic code C of length N = 2. ?1, generated by.. For special cases, we determine the weights of C by using the weights of the irreducible cyclic code of length s, generated by..作者: 外面 時間: 2025-3-28 15:43 作者: interrogate 時間: 2025-3-28 21:27 作者: deficiency 時間: 2025-3-28 23:50 作者: Fillet,Filet 時間: 2025-3-29 06:56 作者: 細頸瓶 時間: 2025-3-29 07:59
Book 1993ementation of coding algorithms.There were about 90 participants to the conference, from the academic and industrial worlds; 53 conferences were selected. The submitted full-papers were separately refereed for publication by at least two international referees.作者: 譏笑 時間: 2025-3-29 12:48 作者: 很是迷惑 時間: 2025-3-29 16:48 作者: Antagonist 時間: 2025-3-29 22:34 作者: CLEFT 時間: 2025-3-30 00:58 作者: adroit 時間: 2025-3-30 05:01 作者: STANT 時間: 2025-3-30 10:02
Civil Society and the Role of Educationnary codes in the Hamming space. Some applications of this bound for estimating the minimum distance of self-dual binary codes, the cross-correlation of arbitrary binary codes, the modulus of sums of Legendre symbols of polynomials, and some parameters of randomness properties of binary codes, are given.作者: 不適 時間: 2025-3-30 14:31
Irritant Contact Dermatitis in the Tropicsions are self-dual must be duadic, we also learn at which lengths such codes can exist. On the one hand duadic codes are generalized to triadic and polyadic codes, and on the other hand to codes generated by difference sets in abelian groups.作者: AWE 時間: 2025-3-30 17:36
https://doi.org/10.1007/978-3-658-20293-4w. In [8], Koch has given another more direct construction of these Conway-Pless codes denoted by him . = 2.., . = 8.. and . = 16... Since the five extremal codes, though pairwise non-equivalent, have the same weight enumerator it is natural to try to calculate the coset weight enumerators and to ask for some parameters which may distinguish them.作者: nonchalance 時間: 2025-3-30 23:41 作者: languid 時間: 2025-3-31 02:42
Limited Resources Limiting Life?,frer un mot revient à trouver le mot le plus court d’un code linéaire..Nous présentons ici l’analyse théorique de deux de ces algorithmes [3, 7]. Ces résultats sont confirmés, tout au moins pour l’un d’eux, par l’implantation, et autorisent des extrapolations pour les grandes dimensions.作者: aphasia 時間: 2025-3-31 05:45 作者: Soliloquy 時間: 2025-3-31 11:16
Coset Weight Enumerators of the Extremal Self-Dual Binary Codes of Length 32w. In [8], Koch has given another more direct construction of these Conway-Pless codes denoted by him . = 2.., . = 8.. and . = 16... Since the five extremal codes, though pairwise non-equivalent, have the same weight enumerator it is natural to try to calculate the coset weight enumerators and to ask for some parameters which may distinguish them.作者: 誹謗 時間: 2025-3-31 15:04 作者: 阻擋 時間: 2025-3-31 17:38 作者: NAV 時間: 2025-4-1 01:21
On Duals of Binary Primitive BCH Codesthe divisibility of all duals of extended BCH codes. Next we obtain a lower bound on their minimum distance, that yields results for several affine-invariant codes. In particular, it gives a bound for all duals of extended BCH codes, which is interesting especially when the Carlitz-Uchiyama bound is negative.
