標(biāo)題: Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 17th International S Serdar Bozta?,Hsiao-Feng (Francis) Lu Conference pro [打印本頁] 作者: 夸大 時(shí)間: 2025-3-21 18:24
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)學(xué)科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡(luò)公開度
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次學(xué)科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用學(xué)科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋學(xué)科排名
作者: 惡臭 時(shí)間: 2025-3-21 23:40 作者: 做事過頭 時(shí)間: 2025-3-22 02:09
Algebraic Structure Theory of Tail-Biting Trellisesnterestingly, the complexity of a tail-biting trellis can be much lower than that of the best possible conventional trellis. We extend the well-known BCJR construction for conventional trellises to linear tail-biting trellises, introducing the notion of a . .. This implicitly induces a coset decompo作者: MOTTO 時(shí)間: 2025-3-22 04:51
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159621.jpg作者: aggravate 時(shí)間: 2025-3-22 08:51
https://doi.org/10.1007/978-3-540-77224-8Boolean function; Error-correcting Code; Public Key; algebraic codes; algebraic complexity; algebraic com作者: intricacy 時(shí)間: 2025-3-22 13:25 作者: 燒烤 時(shí)間: 2025-3-22 20:27 作者: neoplasm 時(shí)間: 2025-3-22 21:17 作者: aerial 時(shí)間: 2025-3-23 04:21
Modeling Energy Price VolatilityWe compute the Walsh spectrum and hence the nonlinearity of a new family of quadratic multi-term APN functions. We show that the distribution of values in the Walsh spectrum of these functions is the same as the Gold function.作者: 安心地散步 時(shí)間: 2025-3-23 07:10 作者: 轉(zhuǎn)折點(diǎn) 時(shí)間: 2025-3-23 13:20 作者: DIKE 時(shí)間: 2025-3-23 15:22 作者: Mets552 時(shí)間: 2025-3-23 20:20
Generalized Sudan’s List Decoding for Order Domain CodesWe generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the proposed method is larger than the original list decoding without multiplicity.作者: 結(jié)合 時(shí)間: 2025-3-23 23:11 作者: 異常 時(shí)間: 2025-3-24 03:09
Space-Time Codes from Crossed Product Algebras of Degree 4We study crossed product algebras of degree 4, and present a new space-time code construction based on a particular crossed product division algebra which exhibits very good performance.作者: 破譯 時(shí)間: 2025-3-24 07:11 作者: 未成熟 時(shí)間: 2025-3-24 14:43 作者: 責(zé)問 時(shí)間: 2025-3-24 16:12
Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codea cryptographic viewpoint, this result immediately leads to the exact number of Boolean functions of . variables with nonlinearity 2.?+?1. The notion of . and ., which is introduced by Helleseth, Kl?ve, and Levenshtein to describe the monotone structure of correctable/uncorrectable errors, plays a significant role in the result.作者: 輕快來事 時(shí)間: 2025-3-24 22:33 作者: 中古 時(shí)間: 2025-3-25 00:11 作者: Gossamer 時(shí)間: 2025-3-25 03:23
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-540-77224-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 1分開 時(shí)間: 2025-3-25 10:09 作者: 放氣 時(shí)間: 2025-3-25 12:27
Energy Resources in East Africalist decoding and closely related notions have been instrumental in several advances in explicit constructions of combinatorial objects with strong “random-like” properties, such as expander graphs, randomness extractors, and pseudorandom generators. Our aim here is to present作者: 帶來墨水 時(shí)間: 2025-3-25 17:47 作者: 注意 時(shí)間: 2025-3-25 20:01 作者: 搖曳 時(shí)間: 2025-3-26 02:06 作者: Ossification 時(shí)間: 2025-3-26 07:30
Energy Resources in East Africalist decoding and closely related notions have been instrumental in several advances in explicit constructions of combinatorial objects with strong “random-like” properties, such as expander graphs, randomness extractors, and pseudorandom generators. Our aim here is to present作者: Provenance 時(shí)間: 2025-3-26 11:56 作者: 異端 時(shí)間: 2025-3-26 14:13 作者: CHASM 時(shí)間: 2025-3-26 17:55
https://doi.org/10.1007/978-3-319-47821-0The formulas are ., i.e., work without change for doublings; even better, they are ., i.e., work without change for all inputs. Dedicated doubling formulas use only 3.?+?4., and dedicated tripling formulas use only 9.?+?4...This paper introduces .. Inverted Edwards coordinates (..:..:..) represent t作者: 無意 時(shí)間: 2025-3-27 00:13 作者: orient 時(shí)間: 2025-3-27 01:51
https://doi.org/10.1007/978-3-319-47821-0trices, and combinatorial descriptions in the form of trellises. A conventional trellis for a linear code . is a directed labelled layered graph with unique start and final nodes, and all paths from the start to the final node spell out codewords. The trellis can be thought of as being laid out on a作者: Occlusion 時(shí)間: 2025-3-27 08:50
https://doi.org/10.1007/978-3-319-47821-0asing length whose limit parameters . and . (rate and relative minimum distance) are better than the Gilbert-Varshamov bound. The basic ingredients in the proof of the TVZ theorem are sequences of modular curves (or their corresponding function fields) having many rational points in comparison to th作者: 陰謀 時(shí)間: 2025-3-27 11:20 作者: GRIN 時(shí)間: 2025-3-27 14:45 作者: 群島 時(shí)間: 2025-3-27 21:30
Equipment Energy Balance and Exergy Balancef . (usually 256) bytes and denote it by .. after the KSA. Under reasonable assumptions we present a simple proof that each permutation byte after the KSA is significantly biased (either positive or negative) towards many values in the range 0, ..., .???1. These biases are independent of the secret 作者: 他很靈活 時(shí)間: 2025-3-28 00:23 作者: 他很靈活 時(shí)間: 2025-3-28 02:21 作者: placebo-effect 時(shí)間: 2025-3-28 07:02 作者: transplantation 時(shí)間: 2025-3-28 14:16 作者: 擺動(dòng) 時(shí)間: 2025-3-28 17:29 作者: 主講人 時(shí)間: 2025-3-28 22:15
https://doi.org/10.1007/978-3-319-47821-0 papers [12,8] closed the gap in our knowledge about combinatorial and algorithmic limitations of list decoding (for codes over large alphabets). This article surveys these latter algorithmic progress.作者: Acetaldehyde 時(shí)間: 2025-3-28 23:54 作者: Cardioplegia 時(shí)間: 2025-3-29 04:12
Modeling Energy Price Volatilitythan Tardos code, especially in the case of fewer pirates. For example, the ratio of our length relative to Tardos code in some practical situation with 4 pirates is 4.33%; while the lowest among the preceding codes in this case (S?kori? et al., 2007) is 9.87%.作者: Adulate 時(shí)間: 2025-3-29 07:54 作者: Tidious 時(shí)間: 2025-3-29 15:00 作者: Harbor 時(shí)間: 2025-3-29 19:09
Iterative List Decoding of LDPC Codes.g. [3] and the references therein. “Good“ LDPC codes are often randomly generated by computer, but recently codes with an algebraic or geometric structure have also been considered e.g [3] and [4]. The performance of the iterative decoder is typically studied by simulations and a theoretical analysis is more difficult.作者: fibroblast 時(shí)間: 2025-3-29 20:08
A Survey of Recent Attacks on the Filter Generatorfeedback shift registers over an extension field .(2.). Some extensions and improvements of the attacks to the filter generator have been given by R?njom, Gong and Helleseth. The purpose of this paper is to give a short overview of these attacks and to discuss how to extend these attacks to the nonlinear combiner generator.作者: Ibd810 時(shí)間: 2025-3-30 00:29
Efficient List Decoding of Explicit Codes with Optimal Redundancy papers [12,8] closed the gap in our knowledge about combinatorial and algorithmic limitations of list decoding (for codes over large alphabets). This article surveys these latter algorithmic progress.作者: Laconic 時(shí)間: 2025-3-30 07:55
Nice Codes from Nice Curveseir genus (more precisely, these curves attain the so-called Drinfeld-Vladut bound). Starting with such a sequence of curves and using Goppa’s construction of algebraic geometry (AG) codes, one easily obtains sequences of linear codes whose limit parameters beat the Gilbert-Varshamov bound.作者: Notify 時(shí)間: 2025-3-30 10:03 作者: Mortal 時(shí)間: 2025-3-30 15:15
Fault-Tolerant Finite Field Computation in the Public Key Cryptosystemsad to the other channels. By assuming certain fault models, our proposed model provides protection against their error propagation. Also, we provide an analysis of the error detection and correction capabilities of our proposed model.作者: Onerous 時(shí)間: 2025-3-30 18:49
https://doi.org/10.1007/978-3-319-47821-0. Dedicated doubling formulas use only 3.?+?4., and dedicated tripling formulas use only 9.?+?4.. Inverted Edwards coordinates thus save 1. for each addition, without slowing down doubling or tripling.作者: Hiatal-Hernia 時(shí)間: 2025-3-31 00:31
Inverted Edwards Coordinates. Dedicated doubling formulas use only 3.?+?4., and dedicated tripling formulas use only 9.?+?4.. Inverted Edwards coordinates thus save 1. for each addition, without slowing down doubling or tripling.作者: 延期 時(shí)間: 2025-3-31 03:29 作者: GLUE 時(shí)間: 2025-3-31 07:33 作者: follicular-unit 時(shí)間: 2025-3-31 11:04
Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA boolean variables for .?>?3 is obtained without invoking results from the difference set theory. We finally propose a new coding approach to achieve the constant amplitude transmission of codeword length 2. for both even . as well as odd ..作者: PON 時(shí)間: 2025-3-31 16:59 作者: 斑駁 時(shí)間: 2025-3-31 19:22 作者: 天氣 時(shí)間: 2025-4-1 00:30 作者: 空氣 時(shí)間: 2025-4-1 03:24 作者: vanquish 時(shí)間: 2025-4-1 08:22 作者: 有特色 時(shí)間: 2025-4-1 13:29
Efficient List Decoding of Explicit Codes with Optimal Redundancy. Even though combinatorial limitations on list decoding had been known since the 1970’s, there was essentially no algorithmic progress till the breakthrough works of Sudan [14] and Guruswami-Sudan [11] in the mid to late 1990’s. There was again a lull in algorithmic progress till a couple of recent
