標(biāo)題: Titlebook: Coding Theory and Applications; 4th International Ca Raquel Pinto,Paula Rocha Malonek,Paolo Vettori Conference proceedings 2015 Springer In [打印本頁] 作者: Clinical-Trial 時(shí)間: 2025-3-21 16:15
書目名稱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é)科排名
作者: exigent 時(shí)間: 2025-3-21 22:57 作者: 使成波狀 時(shí)間: 2025-3-22 00:40 作者: nerve-sparing 時(shí)間: 2025-3-22 04:35 作者: Hectic 時(shí)間: 2025-3-22 08:55
A Coding-Based Approach to Robust Shortest-Path Routingting algorithms in use in today’s Internet is made up of variations of the so-called . or Bellman-Ford algorithm (Bellman, Quart Appl Math 16:87–90, 1958; Ford (1956) Network flow theory paper P-923. RAND Corporation, Santa Monica; Moore (1959) The shortest path through a maze. In: Proceedings of an作者: jealousy 時(shí)間: 2025-3-22 16:38
Constructions of Fast-Decodable Distributed Space-Time Codest multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes.作者: jealousy 時(shí)間: 2025-3-22 19:45
The One-Out-of-k Retrieval Problem and Linear Network Codingnumber of randomly accessed nodes storing one message each. Without network coding, this would require . queries on average. After proving that no scheme can perform better than a straightforward lower bound of 0.?5. average queries, we propose and asymptotically evaluate, using mean field arguments作者: Facet-Joints 時(shí)間: 2025-3-22 22:21
On the Error-Correcting Radius of Folded Reed–Solomon Code Designsd. Based on this result, an improved construction of FRS codes is motivated, which can be obtained by puncturing Parvaresh–Vardy codes. The proposed codes allow decoding for all rates, remove the structural loss in decoding radius of the original FRS design and maximize the fraction of correctable e作者: degradation 時(shí)間: 2025-3-23 01:45
SPC Product Codes over the Erasure Channel of recovering a high number of erasures in some special cases, so the error correcting capability is higher than the minimum distance. In this work, we count the number of possible patterns that are uncorrectable when a number of erasures (up to 8) have occurred.作者: 難理解 時(shí)間: 2025-3-23 07:32 作者: 喃喃訴苦 時(shí)間: 2025-3-23 09:58 作者: 評(píng)論性 時(shí)間: 2025-3-23 17:04 作者: breadth 時(shí)間: 2025-3-23 18:57
On the Fan Associated to a Linear Codedeals are not toric. To this end, the correspondence of linear codes and binomial ideals will be briefly described as well as their resemblance to toric ideals. Finally, we will hint at applications of the degree compatible Gr?bner fan to the code equivalence problem.作者: 顛簸下上 時(shí)間: 2025-3-23 22:21 作者: BLAND 時(shí)間: 2025-3-24 05:11
https://doi.org/10.1007/978-3-642-75097-7tant role in applications such as modulation coding for data recording. Shannon found a closed form expression for the capacity of such systems in his seminal paper, and capacity has served as a benchmark for the efficiency of coding schemes as well as a guide for code construction. Advanced data re作者: RENIN 時(shí)間: 2025-3-24 08:05 作者: electrolyte 時(shí)間: 2025-3-24 12:12
Sediments and Water Interactionst multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes.作者: 地牢 時(shí)間: 2025-3-24 15:41
Sediments and Water Interactionsnumber of randomly accessed nodes storing one message each. Without network coding, this would require . queries on average. After proving that no scheme can perform better than a straightforward lower bound of 0.?5. average queries, we propose and asymptotically evaluate, using mean field arguments作者: ineluctable 時(shí)間: 2025-3-24 21:13 作者: GRIPE 時(shí)間: 2025-3-24 23:26
Introduction: Self-Denying Creativity, of recovering a high number of erasures in some special cases, so the error correcting capability is higher than the minimum distance. In this work, we count the number of possible patterns that are uncorrectable when a number of erasures (up to 8) have occurred.作者: 使隔離 時(shí)間: 2025-3-25 04:22 作者: 違反 時(shí)間: 2025-3-25 07:46 作者: 諷刺 時(shí)間: 2025-3-25 14:13 作者: PON 時(shí)間: 2025-3-25 17:34 作者: FLINT 時(shí)間: 2025-3-25 20:15 作者: Scintillations 時(shí)間: 2025-3-26 04:11 作者: Directed 時(shí)間: 2025-3-26 05:42
978-3-319-36552-7Springer International Publishing Switzerland 2015作者: 繁榮地區(qū) 時(shí)間: 2025-3-26 11:01 作者: 招致 時(shí)間: 2025-3-26 13:10
Sediments and Water Interactionst multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes.作者: 好忠告人 時(shí)間: 2025-3-26 18:47 作者: 滑動(dòng) 時(shí)間: 2025-3-26 21:41 作者: metropolitan 時(shí)間: 2025-3-27 04:57
Brain Surface Anatomy and Functional Regionsuch codes have applications in cryptography, e.g. to secret sharing. We pursue here their study and construct asymptotically good families of minimal linear codes. We also push further the study of quasi-minimal and almost-minimal linear codes, relaxations of the minimal linear codes.作者: 六邊形 時(shí)間: 2025-3-27 09:11 作者: embolus 時(shí)間: 2025-3-27 11:57
https://doi.org/10.1007/978-3-642-23893-2deals are not toric. To this end, the correspondence of linear codes and binomial ideals will be briefly described as well as their resemblance to toric ideals. Finally, we will hint at applications of the degree compatible Gr?bner fan to the code equivalence problem.作者: pacific 時(shí)間: 2025-3-27 14:55 作者: BLUSH 時(shí)間: 2025-3-27 19:04 作者: finale 時(shí)間: 2025-3-28 00:34 作者: creatine-kinase 時(shí)間: 2025-3-28 05:49 作者: Tractable 時(shí)間: 2025-3-28 09:26 作者: Rct393 時(shí)間: 2025-3-28 12:15 作者: Enliven 時(shí)間: 2025-3-28 15:30
Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codeses on the distinguishability of such codes from random codes using the Schur product. Wieschebrink treated the genus zero case a few years ago but his approach cannot be extent straightforwardly to other genera. We address this problem by introducing and using a new notion, which we call the . of a code.作者: paltry 時(shí)間: 2025-3-28 20:06
On the Fan Associated to a Linear Codedeals are not toric. To this end, the correspondence of linear codes and binomial ideals will be briefly described as well as their resemblance to toric ideals. Finally, we will hint at applications of the degree compatible Gr?bner fan to the code equivalence problem.作者: 彈藥 時(shí)間: 2025-3-29 00:09
On Extendibility of Additive Code Isometriesn general, it is not the situation for nonlinear codes. In the paper it was proved, that if the length of an additive code is less than some threshold value, then an analogue of the MacWilliams Extension Theorem holds. One family of unextendible code isometries for the threshold value of code length is described.作者: 小母馬 時(shí)間: 2025-3-29 04:06 作者: Ancillary 時(shí)間: 2025-3-29 07:13
G. C. Holdren,David E. ArmstrongA new class of cyclic generalized separable (.,?.) codes is constructed.作者: Confirm 時(shí)間: 2025-3-29 12:09
https://doi.org/10.1057/9780230508194We recall why linear codes with complementary duals (LCD codes) play a role in counter-measures to passive and active side-channel analyses on embedded cryptosystems. The rate and the minimum distance of such LCD codes must be as large as possible. We investigate constructions.作者: 偶然 時(shí)間: 2025-3-29 17:25
https://doi.org/10.1057/9780230299177In this paper, we present an input-state-output representation of a convolutional product code; we show that this representation is non minimal. Moreover, we introduce a lower bound on the free distance of the convolutional product code in terms of the free distance of the constituent codes.作者: 拾落穗 時(shí)間: 2025-3-29 20:35 作者: Hemodialysis 時(shí)間: 2025-3-30 02:16 作者: Custodian 時(shí)間: 2025-3-30 07:57 作者: 小步舞 時(shí)間: 2025-3-30 11:35
Cyclic Generalized Separable (,) CodesA new class of cyclic generalized separable (.,?.) codes is constructed.作者: 聚集 時(shí)間: 2025-3-30 14:10 作者: Nibble 時(shí)間: 2025-3-30 17:22 作者: 不斷的變動(dòng) 時(shí)間: 2025-3-30 21:11
Extending Construction X for Quantum Error-Correcting CodesIn this paper we extend the work of Lisonek and Singh on construction X for quantum error-correcting codes to finite fields of order .. where . is prime. Further, we give some new results on the Hermitian dual of repeated root cyclic codes. These results are used to construct new quantum error-correcting codes.作者: A保存的 時(shí)間: 2025-3-31 01:18 作者: 軟膏 時(shí)間: 2025-3-31 07:21
Sediments and Water Interactions, a few example practical schemes, the best of which attains 0.?82. queries on average. The paper opens two complementary challenges: a systematic analysis of practical schemes so as to identify the best performing ones and design guideline strategies, as well as the need to identify tighter, nontrivial, lower bounds.作者: 解決 時(shí)間: 2025-3-31 10:31
2364-950X in modern coding theory: codes and combinatorial structures, algebraic geometric codes, group codes, quantum codes, convolutional codes, network coding and cryptography..The book includes a survey paper on the interconnections of coding theory with constrained systems, written by an invited speaker作者: 殺子女者 時(shí)間: 2025-3-31 16:35 作者: Mere僅僅 時(shí)間: 2025-3-31 18:31 作者: 食料 時(shí)間: 2025-3-31 22:14
The One-Out-of-k Retrieval Problem and Linear Network Coding, a few example practical schemes, the best of which attains 0.?82. queries on average. The paper opens two complementary challenges: a systematic analysis of practical schemes so as to identify the best performing ones and design guideline strategies, as well as the need to identify tighter, nontrivial, lower bounds.
