標(biāo)題: Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 18th International S Maria Bras-Amorós,Tom H?holdt Conference proceedings [打印本頁] 作者: deliberate 時間: 2025-3-21 20:06
書目名稱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é)科排名
作者: Infect 時間: 2025-3-21 23:38
0302-9743 ting Codes, AAECC-18, held in Tarragona, Spain, in June 2009. The 22 revised full papers presented together with 7 extended absstracts were carefully reviewed and selected from 50 submissions. Among the subjects addressed are block codes, including list-decoding algorithms; algebra and codes: rings,作者: 易達到 時間: 2025-3-22 00:25 作者: liposuction 時間: 2025-3-22 05:48 作者: 點燃 時間: 2025-3-22 12:32 作者: intuition 時間: 2025-3-22 16:56 作者: 邪惡的你 時間: 2025-3-22 17:55 作者: 心神不寧 時間: 2025-3-23 00:10 作者: 宏偉 時間: 2025-3-23 04:33 作者: overshadow 時間: 2025-3-23 09:22
On Elliptic Convolutional Goppa Codest bounds. We provide a number of examples for different values of their parameters, including some explicit strongly MDS convolutional codes. We also introduce some conditions for certain codes of this class to be MDS.作者: 動作謎 時間: 2025-3-23 13:44
Word Oriented Cascade Jump ,?LFSRconstructions make use of special word oriented .?LFSRs, which can be efficiently implemented on modern CPU and only require few memory. Experimental results show that one type of efficient word oriented cascade jump .?LFSRs can be used as building blocks for software oriented stream cipher.作者: Tracheotomy 時間: 2025-3-23 15:31
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKEed in the above paper; to our best knowledge, this is the first example of length-preserving hybrid encryption; 2) postquantum deterministic encryption (using the IND-CPA variant of code-based McEliece PKE) which enjoys a simplified construction, where the public key is re-used as a hash function.作者: CORE 時間: 2025-3-23 21:34 作者: amenity 時間: 2025-3-24 01:59
On Some Sequences of the Secret Pseudo-random Index , in RC4 Key Schedulingresults on the probability and the number of such sequences. As an application, we explain a new secret key recovery algorithm that can recover a 16 bytes secret key with a success probability of 0.1409. Our strategy has high time complexity at this point and requires further improvement to be feasible in practice.作者: 小畫像 時間: 2025-3-24 03:10 作者: cipher 時間: 2025-3-24 07:02
Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensionsonditional user anonymity against a semi-honest server. If the pre-computation is allowed, the computation cost of the . protocol is the same as the well-known Diffie-Hellman protocol! In addition, we extend the . protocol in two ways.作者: 多產(chǎn)子 時間: 2025-3-24 13:38 作者: 疾馳 時間: 2025-3-24 17:09
0302-9743 fields, algebraic geometry codes; algebra: rings and fields, polynomials, permutations, lattices; cryptography: cryptanalysis and complexity; computational algebra: algebraic algorithms and transforms; sequences and boolean functions.978-3-642-02180-0978-3-642-02181-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Ambiguous 時間: 2025-3-24 19:09
Energy Resources in East African-abelian group of matrices is used. The primary advantadge of this scheme is that no prime numbers are used and the efficiency is guaranteed by the use of a quick exponentiation algorithm for this group of matrices.作者: irreparable 時間: 2025-3-24 23:52
Energy Resources in East Africaonditional user anonymity against a semi-honest server. If the pre-computation is allowed, the computation cost of the . protocol is the same as the well-known Diffie-Hellman protocol! In addition, we extend the . protocol in two ways.作者: 古老 時間: 2025-3-25 07:21 作者: 昏睡中 時間: 2025-3-25 09:35 作者: 迫擊炮 時間: 2025-3-25 14:37
https://doi.org/10.1007/978-90-481-2383-4Using stratified sampling a desired confidence level and a specified margin of error can be achieved with smaller sample size than under standard sampling. We apply stratified sampling to the simulation of the sum-product algorithm on a binary low-density parity-check code.作者: Endearing 時間: 2025-3-25 17:05 作者: Haphazard 時間: 2025-3-25 22:23 作者: Magnificent 時間: 2025-3-26 02:59 作者: organic-matrix 時間: 2025-3-26 04:27 作者: arthrodesis 時間: 2025-3-26 10:34 作者: Dignant 時間: 2025-3-26 13:37
Simulation of the Sum-Product Algorithm Using Stratified SamplingUsing stratified sampling a desired confidence level and a specified margin of error can be achieved with smaller sample size than under standard sampling. We apply stratified sampling to the simulation of the sum-product algorithm on a binary low-density parity-check code.作者: 記成螞蟻 時間: 2025-3-26 18:48 作者: predict 時間: 2025-3-26 22:47
There Are Not Non-obvious Cyclic Affine-invariant CodesWe show that an affine-invariant code . of length .. is not permutation equivalent to a cyclic code except in the obvious cases: .?=?1 or . is either {0}, the repetition code or its dual.作者: Circumscribe 時間: 2025-3-27 03:03
Noisy Interpolation of Multivariate Sparse Polynomials in Finite FieldsWe consider the problem of recovering an unknown sparse multivariate polynomial . over a finite field . of prime order . from approximate values of .(..,...,..) at polynomially many points . selected uniformly at random. Our result is based on a combination of bounds on exponential sums with the lattice reduction technique.作者: 逢迎白雪 時間: 2025-3-27 08:39
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamprithm, both designed to solve a key equation. This article presents a new version of the key equation and a way to use the Euclidean algorithm to solve it. A straightforward reorganization of the algorithm yields the Berlekamp-Massey algorithm.作者: 方便 時間: 2025-3-27 11:42 作者: 沙草紙 時間: 2025-3-27 13:36 作者: Incompetent 時間: 2025-3-27 20:23
On Self-dual Codes over ,,.. and give a necessary and sufficient condition for the self-duality of induced codes. We then give an inductive algorithm for constructing all self-dual codes over .., and establish the mass formula, which counts the number of such codes.作者: 消息靈通 時間: 2025-3-27 23:05 作者: acquisition 時間: 2025-3-28 03:48
978-3-642-02180-0Springer-Verlag Berlin Heidelberg 2009作者: aneurysm 時間: 2025-3-28 09:46 作者: STANT 時間: 2025-3-28 13:04 作者: 步履蹣跚 時間: 2025-3-28 17:41
https://doi.org/10.1007/978-90-481-2383-4s and properties as the codes in the usual binary linear Reed-Muller family have been introduced. A structural invariant, the rank, for binary codes is used to classify some of these ?.-linear codes. The rank is established generalizing the known results about the rank for ?.-linear Hadamard and ?.-作者: angiography 時間: 2025-3-28 19:51
https://doi.org/10.1007/978-90-481-2383-4f the BIBD graphs and show that they yield optimal expander graphs that are also bipartite Ramanujan graphs. In particular, we show that the bipartite graphs derived from finite projective and affine geometries yield optimal Ramanujan graphs. This in turn leads to a theoretical explanation of the go作者: 賞錢 時間: 2025-3-28 23:03 作者: hurricane 時間: 2025-3-29 06:44 作者: 苦澀 時間: 2025-3-29 07:30 作者: 極小 時間: 2025-3-29 13:40
Energy Resources in East Africaoosing properly certain parameters, the order of the subgroup generated by one of these matrices can be as large as needed. Secondly, we propose and implement a new key exchange scheme based on these primitives. The security of the proposed system is based on discrete logarithm problem although a no作者: TERRA 時間: 2025-3-29 15:43
https://doi.org/10.1007/978-3-540-35669-1 in software. In this paper word oriented cascade jump registers are presented based on the design idea of bit oriented cascade jump registers. Their constructions make use of special word oriented .?LFSRs, which can be efficiently implemented on modern CPU and only require few memory. Experimental 作者: 蚊帳 時間: 2025-3-29 22:50
Energy Resources in East Africaete KSA of RC4. It is known that the value of . in round .?+?1 can be predicted with high probability from ..[.] for the initial values of . and from . for the final values of .. This fact has been exploited in several recent works on secret key recovery from ... In this paper, we perform extensive 作者: 重疊 時間: 2025-3-30 02:59 作者: 假裝是我 時間: 2025-3-30 07:54 作者: 大炮 時間: 2025-3-30 08:15
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-642-02181-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 無王時期, 時間: 2025-3-30 15:18
https://doi.org/10.1007/978-90-481-2383-4rithm, both designed to solve a key equation. This article presents a new version of the key equation and a way to use the Euclidean algorithm to solve it. A straightforward reorganization of the algorithm yields the Berlekamp-Massey algorithm.作者: TSH582 時間: 2025-3-30 17:27
https://doi.org/10.1007/978-90-481-2383-4s and properties as the codes in the usual binary linear Reed-Muller family have been introduced. A structural invariant, the rank, for binary codes is used to classify some of these ?.-linear codes. The rank is established generalizing the known results about the rank for ?.-linear Hadamard and ?.-linear extended 1-perfect codes.作者: investigate 時間: 2025-3-31 00:38
https://doi.org/10.1007/978-90-481-2383-4f the BIBD graphs and show that they yield optimal expander graphs that are also bipartite Ramanujan graphs. In particular, we show that the bipartite graphs derived from finite projective and affine geometries yield optimal Ramanujan graphs. This in turn leads to a theoretical explanation of the good performance of a class of LDPC codes.作者: Aromatic 時間: 2025-3-31 01:14
Sakib Bin Amin,Saanjaana Rahman.. and give a necessary and sufficient condition for the self-duality of induced codes. We then give an inductive algorithm for constructing all self-dual codes over .., and establish the mass formula, which counts the number of such codes.作者: 殺子女者 時間: 2025-3-31 05:56
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159620.jpg作者: overbearing 時間: 2025-3-31 09:48
An Extension of the Order Bound for AG Codesng-Rao bound. By using a finer partition of the set of all codewords of a code we improve the order bounds by Beelen and by Duursma and Park. We show that the new bound can be efficiently optimized and we include a numerical comparison of different bounds for all two-point codes with Goppa distance 作者: 召集 時間: 2025-3-31 16:08 作者: FICE 時間: 2025-3-31 20:00 作者: FRAX-tool 時間: 2025-4-1 01:07 作者: 填料 時間: 2025-4-1 03:40 作者: 錯事 時間: 2025-4-1 06:39
On Elliptic Convolutional Goppa Codesonal codes. We present here this construction carried out over elliptic curves, yielding a variety of codes which are optimal with respect to different bounds. We provide a number of examples for different values of their parameters, including some explicit strongly MDS convolutional codes. We also
