標(biāo)題: Titlebook: Coding Theory and Applications; 2nd International Co G. Cohen,P. Godlewski Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 19 [打印本頁] 作者: Monroe 時(shí)間: 2025-3-21 16:20
書目名稱Coding Theory and Applications影響因子(影響力)
書目名稱Coding Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Coding Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Coding Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Coding Theory and Applications被引頻次
書目名稱Coding Theory and Applications被引頻次學(xué)科排名
書目名稱Coding Theory and Applications年度引用
書目名稱Coding Theory and Applications年度引用學(xué)科排名
書目名稱Coding Theory and Applications讀者反饋
書目名稱Coding Theory and Applications讀者反饋學(xué)科排名
作者: intrude 時(shí)間: 2025-3-21 22:31 作者: 因無茶而冷淡 時(shí)間: 2025-3-22 04:07 作者: Lipoprotein(A) 時(shí)間: 2025-3-22 06:00
Analysis of Short Circuiting Phenomena,e linear codes have been derived. For s=2, it is shown that the strongly regular graph of this code gives rise to the Hadamard difference sets v=2., k=2.-2., λ=2.-2. and v=2., k= 2.+2., λ=2.+2.. In fact, the author has now shown that this construction can be extended to derive the Hadamard differenc作者: 樂章 時(shí)間: 2025-3-22 09:23 作者: CROAK 時(shí)間: 2025-3-22 14:04 作者: CROAK 時(shí)間: 2025-3-22 17:27 作者: LATHE 時(shí)間: 2025-3-22 23:29 作者: glucagon 時(shí)間: 2025-3-23 03:53 作者: arrogant 時(shí)間: 2025-3-23 05:47
K-permutivity,itué par ces colonnes contient en lignes toutes les permutations de {i., .. i.} . Pour n et k fixés, on va encadrer le nombre p(n,k) de lignes d‘un tel tableau. On obtient:.A. ? p(n,k) ? A. · d. / k! ou A. est le nombre d‘injections d‘un ensemble de cardinal p dans un ensemble de cardinal n, et d. l作者: 占卜者 時(shí)間: 2025-3-23 10:05 作者: 豐滿有漂亮 時(shí)間: 2025-3-23 15:45
On modular weights in arithmetic codes,uées sur des entiers. Pour décrire de manière adéquate le poids de telles erreurs, Garcia et Rao ont introduit la notion de distance modulaire entre entiers (relative à un modulo M>0 et une base r>1), qui présente l‘inconvénient de ne pas toujours satisfaire l‘inégalité triangulaire (cependant, cell作者: handle 時(shí)間: 2025-3-23 19:34 作者: ANNUL 時(shí)間: 2025-3-23 22:24 作者: COUCH 時(shí)間: 2025-3-24 03:56
The generalized Goppa codes and related discrete designs from hermitian surfaces in PG(3, s2),correcting codes and estimation of their transmission rate (k/n) and error correcting power (d/n) by invoking Riemann-Roch theorem and the subsequent discovery by Tsfasman, Vladut and Zink of a sequence of linear codes in q symbols, which performs better than those predicted by the Gilbert-Varshamov作者: Preamble 時(shí)間: 2025-3-24 07:18 作者: CHAFE 時(shí)間: 2025-3-24 12:24 作者: 發(fā)展 時(shí)間: 2025-3-24 18:02 作者: enormous 時(shí)間: 2025-3-24 22:18 作者: preeclampsia 時(shí)間: 2025-3-25 02:52
Control Application on Design Parameters,s of information. Channels that link an input and an output random field also are of interest..First, we describe in detail a celebrated result of random field theory to the effect that a random field has the Markov property if and only if it is a Gibbs state with a nearest neighbor potential. Next 作者: forestry 時(shí)間: 2025-3-25 06:02
Developments in Settling Studies,an extensive list of its properties is formulated. The discrete Fourier transform (DFT) of a finite sequence is then connected to the linear complexity of a periodic sequence by Blahut‘s theorem. Cyclic codes are given a DFT formulation that relates their minimum distance to the least linear complex作者: Blanch 時(shí)間: 2025-3-25 09:36 作者: 浮雕寶石 時(shí)間: 2025-3-25 12:05
https://doi.org/10.1007/978-81-322-3634-4totic estimate of the number of zeroes of the Lloyd polynomial..We obtain a recursion on the Lee composition distribution of the translates of a code and deduce from that an upper bound on the covering radius of a code..We give an algebraic characterization of T-designs in this scheme, which shows t作者: Hiatal-Hernia 時(shí)間: 2025-3-25 18:38
Verification of Tube Settling Theory,uées sur des entiers. Pour décrire de manière adéquate le poids de telles erreurs, Garcia et Rao ont introduit la notion de distance modulaire entre entiers (relative à un modulo M>0 et une base r>1), qui présente l‘inconvénient de ne pas toujours satisfaire l‘inégalité triangulaire (cependant, cell作者: ARBOR 時(shí)間: 2025-3-25 21:32 作者: Immunotherapy 時(shí)間: 2025-3-26 03:56 作者: SLUMP 時(shí)間: 2025-3-26 07:19 作者: recede 時(shí)間: 2025-3-26 08:34
Verification of Tube Settling Theory,al codes [1]. The bound is a random coding bound over the ensemble of nonlinear time-varying Euclidean trellis codes. We compare schemes using different signal constellations and mappings and apply the bound to particular trellis coded modulation (TCM) schemes such as Ungerboeck‘s [3] and Lafanecher作者: 古老 時(shí)間: 2025-3-26 16:11 作者: 放棄 時(shí)間: 2025-3-26 18:24
https://doi.org/10.1007/978-981-97-5361-1e uses a . and the second one the .. Both are briefly described and their communication properties are recalled. An underwater experiment has been conducted with these codes. The obtained performances are given in terms of error and transmission rates. Two reception schemes are compared.作者: 高原 時(shí)間: 2025-3-26 21:01
Developments in Settling Studies,Nous présentons des constructions pour des recouvrements d‘espaces de Hamming binaires de dimension n par des sphères de rayon 1. Nous montrons que la densité minimale μ. de tels recouvrements est au plus 3/2. Le comportement asymptotique de μ. quand n tend vers l‘infini n‘est pas connu.作者: thwart 時(shí)間: 2025-3-27 01:12
Analysis of Short Circuiting Phenomena,Using a generalization to singular curves of GOPPA construction for geometric codes [G], we construct a code with the above parameters.作者: Recessive 時(shí)間: 2025-3-27 08:41 作者: 某人 時(shí)間: 2025-3-27 11:32
Alexander P. Lisitsyn,Liudmila L. DeminaIt exists sequences of length N of constant amplitude and zero autocorrelation over 2n symbols, provided that each sequence be preceeded by n symbols and followed by n other symbols. Methods for obtaining these N + 2n symbols are proposed and examples are given.作者: 發(fā)怨言 時(shí)間: 2025-3-27 14:01 作者: 惡臭 時(shí)間: 2025-3-27 19:59
A [32,17,14]-geometric code coming from a singular curve,Using a generalization to singular curves of GOPPA construction for geometric codes [G], we construct a code with the above parameters.作者: 托運(yùn) 時(shí)間: 2025-3-28 00:14
Projective reed-muller codes,On introduit une classe de codes linéaires de la famille des codes de Reed-Muller, les codes de Reed-Muller projectifs. Ces codes sont des extensions des codes de Reed-Muller généralisés; les codes de Reed-Muller projectifs d‘ordre 1 atteignent la borne de Plotkin. On donne les paramètres des codes de Reed-Muller projectifs d‘ordre 2.作者: febrile 時(shí)間: 2025-3-28 04:54 作者: 百科全書 時(shí)間: 2025-3-28 09:16 作者: GRIEF 時(shí)間: 2025-3-28 12:02 作者: Colonoscopy 時(shí)間: 2025-3-28 15:24
Verification of Tube Settling Theory,al codes [1]. The bound is a random coding bound over the ensemble of nonlinear time-varying Euclidean trellis codes. We compare schemes using different signal constellations and mappings and apply the bound to particular trellis coded modulation (TCM) schemes such as Ungerboeck‘s [3] and Lafanechere and Costello‘s [4].作者: 震驚 時(shí)間: 2025-3-28 18:49 作者: 閃光東本 時(shí)間: 2025-3-29 00:13 作者: Acetabulum 時(shí)間: 2025-3-29 04:38
,Optimum ’1’ — Ended binary prefix codes,ct to the requirement that each code word must end with a ’1’. We give lower and upper bounds to the performance of the optimum code for any information source; the lower bound is tight in some cases. We also describe an algorithm that generates an optimum code for any information source.作者: trigger 時(shí)間: 2025-3-29 11:07 作者: Dedication 時(shí)間: 2025-3-29 15:27 作者: 山羊 時(shí)間: 2025-3-29 19:04 作者: 假裝是你 時(shí)間: 2025-3-29 20:40 作者: 粘 時(shí)間: 2025-3-30 01:56
978-3-540-19368-5Springer-Verlag Berlin Heidelberg 1988作者: 儀式 時(shí)間: 2025-3-30 07:17
Conference proceedings 1988geometry and combinatorial coding to applications like modulation, real-space decoding and implementation of coding algorithms on microcomputers. The symposium was the second one of this type. With its broad spectrum, it was a unique opportunity for contacts between university and industry on the topics of information and coding theory.作者: 放大 時(shí)間: 2025-3-30 09:25 作者: placebo 時(shí)間: 2025-3-30 16:12 作者: 色情 時(shí)間: 2025-3-30 18:36 作者: 似少年 時(shí)間: 2025-3-30 23:45 作者: 小說 時(shí)間: 2025-3-31 01:37 作者: 職業(yè)拳擊手 時(shí)間: 2025-3-31 08:13
Control Application on Design Parameters,der algorithms for computing the stationary distribution of a time evolution mechanism. These algorithms, which have long been employed in mathematical statistical mechanics, also play a central role in simulated annealing.作者: dapper 時(shí)間: 2025-3-31 09:11
Information theory in random fields,der algorithms for computing the stationary distribution of a time evolution mechanism. These algorithms, which have long been employed in mathematical statistical mechanics, also play a central role in simulated annealing.作者: Lime石灰 時(shí)間: 2025-3-31 14:11 作者: molest 時(shí)間: 2025-3-31 17:36
0302-9743 n Cachan near Paris, France. It gives an account of the state of the art of research in France on Coding, ranging from rather theoretical topics like algebraic geometry and combinatorial coding to applications like modulation, real-space decoding and implementation of coding algorithms on microcompu作者: conquer 時(shí)間: 2025-3-31 22:16 作者: Dictation 時(shí)間: 2025-4-1 04:10
https://doi.org/10.1007/978-81-322-3634-4and deduce from that an upper bound on the covering radius of a code..We give an algebraic characterization of T-designs in this scheme, which shows that they form a special class of orthogonal arrays.作者: 瘋狂 時(shí)間: 2025-4-1 08:42
K-permutivity,l tableau. On obtient:.A. ? p(n,k) ? A. · d. / k! ou A. est le nombre d‘injections d‘un ensemble de cardinal p dans un ensemble de cardinal n, et d. le nombre de permutations d‘un ensemble de k+1 élèments, sans point fixe.作者: Watemelon 時(shí)間: 2025-4-1 11:59 作者: 兵團(tuán) 時(shí)間: 2025-4-1 14:52
Vertrieb,ichen Vertrieb und Verkauf. Unternehmensleistung ist die Summe der Nominal- und Realgüter, wobei im folgenden Unternehmensleistung und Produkt synonym verwendet werden. Durch die Dynamik der nationalen und internationalen M?rkte sind marktorientierte Unternehmungen immer mehr gezwungen, auf etwaige
