標題: Titlebook: Coding Theory and Applications; 2nd International Ca ángela Barbero Conference proceedings 2008 Springer-Verlag Berlin Heidelberg 2008 Alge [打印本頁] 作者: Gullet 時間: 2025-3-21 19:14
書目名稱Coding Theory and Applications影響因子(影響力)
書目名稱Coding Theory and Applications影響因子(影響力)學科排名
書目名稱Coding Theory and Applications網(wǎng)絡公開度
書目名稱Coding Theory and Applications網(wǎng)絡公開度學科排名
書目名稱Coding Theory and Applications被引頻次
書目名稱Coding Theory and Applications被引頻次學科排名
書目名稱Coding Theory and Applications年度引用
書目名稱Coding Theory and Applications年度引用學科排名
書目名稱Coding Theory and Applications讀者反饋
書目名稱Coding Theory and Applications讀者反饋學科排名
作者: aspersion 時間: 2025-3-21 20:25 作者: Inflamed 時間: 2025-3-22 04:04 作者: Charlatan 時間: 2025-3-22 05:32 作者: LIKEN 時間: 2025-3-22 10:29
,On Rank and Kernel of ?4-Linear Codes,pper bounds, are established. For each possible rank . between these bounds, the construction of a ?.-linear code with rank . is given. Equivalently, for each possible dimension of the kernel ., the construction of a ?.-linear code with dimension of the kernel . is given.作者: Cacophonous 時間: 2025-3-22 15:43
M. Guala,K. T. Christensen,R. J. Adriantely regular codes in Johnson graphs and other well-known mathematical problems. Some auxiliary theorems, which can be applied for treatment of perfect colorings in two colors in other graphs, are given in this paper.作者: Cacophonous 時間: 2025-3-22 18:00
Turbulence Dynamics in a Two-Phase Flowwn algorithm for the decoding of Reed-Solomon codes (Peterson’s algorithm) uses syndromes. Now let . be a subset of . consisting of . distinct elements. We can see an RS-code of dimension .?≤?. as the set of all .-tuples that arise by evaluating all polynomial .(.) of degree less than or equal to .???1 in the points ..,...,...作者: impaction 時間: 2025-3-23 01:14
Sedimentation as a Three-Component Systemrity against the attacks under study. We have shown by simulation results that our proposed optimization method has increased the security against node corruption considerably, and at the same time, the cost per level of security is lower compared to optimization methods without constraints on node corruption.作者: gimmick 時間: 2025-3-23 04:02
Sedimentation as a Three-Component Systemunication system. Inductively coupled channels pose special challenges for building a secure system. We give a brief overview of these challenges, and of some cryptographic building blocks and protocols that have been proposed to meet them.作者: Cholagogue 時間: 2025-3-23 08:13
Conference proceedings 2008astle in Medina del Campo. The event provided a forum for the exchange of results and ideas, which we hope will foster future collaboration. The ?rst meeting was held in 1999, and, encouraged by that experience, we now intend to hold the meeting every three years. Springer kindly accepted to publish作者: 攤位 時間: 2025-3-23 11:27
Perfect 2-Colorings of Johnson Graphs ,(6,3) and ,(7,3),tely regular codes in Johnson graphs and other well-known mathematical problems. Some auxiliary theorems, which can be applied for treatment of perfect colorings in two colors in other graphs, are given in this paper.作者: 浸軟 時間: 2025-3-23 14:55 作者: 松緊帶 時間: 2025-3-23 20:47
Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization,rity against the attacks under study. We have shown by simulation results that our proposed optimization method has increased the security against node corruption considerably, and at the same time, the cost per level of security is lower compared to optimization methods without constraints on node corruption.作者: 范例 時間: 2025-3-23 22:20 作者: 門窗的側柱 時間: 2025-3-24 06:10
F. Watchorn,G. J. Nichols,D. W. J. Bosencecations in the most frequent words. We explain the details of these information distortions and we compare with other kinds of modifications like random word distortions and unfrequent word distortions. Finally, some phenomenological explanations from the different empirical results that have been carried out are presented.作者: insincerity 時間: 2025-3-24 06:34
Critical review of thickener design methods,de. The latter expression generalizes the wellknown expression in terms of the degree of a delay-free finite support convolutional code over a field to the ring case. The results are also applicable to block trellis realization of polynomial block codes over ., such as CRC codes over ..作者: 領導權 時間: 2025-3-24 10:48 作者: 完成才能戰(zhàn)勝 時間: 2025-3-24 18:22
Evaluating the Impact of Information Distortion on Normalized Compression Distance,cations in the most frequent words. We explain the details of these information distortions and we compare with other kinds of modifications like random word distortions and unfrequent word distortions. Finally, some phenomenological explanations from the different empirical results that have been carried out are presented.作者: infringe 時間: 2025-3-24 19:40 作者: Optometrist 時間: 2025-3-25 00:01
Close Encounters with Boolean Functions of Three Different Kinds,nally, after providing some cryptographic motivation for two of the three aperiodic descriptions, we devise new constructions for complementary pairs of Boolean functions of three different kinds, and give explicit examples for each.作者: 忘恩負義的人 時間: 2025-3-25 06:31 作者: excursion 時間: 2025-3-25 09:41 作者: bromide 時間: 2025-3-25 15:25
How to Know if a Linear Code Is a Group Code?,ra in which the standard basis is the group basis such that . is a (left) ideal in this group algebra. As application we obtain a class containing properly the class of metacyclic groups such that every group code is an abelian group code. We also use the characterization to describe all the possibl作者: DRAFT 時間: 2025-3-25 17:38 作者: GAVEL 時間: 2025-3-25 23:39
Classic and Quantum Error Correcting Codes,esent two results that show different applications of algebraic methods in coding theory. One of them refers to the classical context and another one to the quantum error correcting theory. These results can be found in [5] and [13] respectively, where proofs and more details can be found.作者: Ablation 時間: 2025-3-26 02:21 作者: Abduct 時間: 2025-3-26 06:25 作者: painkillers 時間: 2025-3-26 11:49 作者: 未開化 時間: 2025-3-26 13:12 作者: 感染 時間: 2025-3-26 16:51 作者: COUCH 時間: 2025-3-26 22:31 作者: Embolic-Stroke 時間: 2025-3-27 03:57
Communication on Inductively Coupled Channels: Overview and Challenges,for coding on such channels, review modulation codes in use in practical systems, and propose new modulation coding techniques. Error correcting codes and the ways in which it may aid the communication on these channels are also covered. Cryptography is another crucial ingredient for a complete comm作者: Factual 時間: 2025-3-27 06:28
0302-9743 ng invited papers in addition to papers on recent results, printed in a separate volume. We would like to thank everyone who made this meeting possible by helpi978-3-540-87447-8978-3-540-87448-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: arthroplasty 時間: 2025-3-27 11:21 作者: 愛管閑事 時間: 2025-3-27 15:15 作者: 注意 時間: 2025-3-27 17:50
Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation, we present an operation to draw from Aut. such that graph isomorphism is preserved, which maintains desirable properties while the graph is being updated. We present simulation results for the additive white Gaussian noise (AWGN) channel, which show an improvement over standard sum-product algorith作者: Ruptured-Disk 時間: 2025-3-28 00:44
https://doi.org/10.1007/978-3-540-87448-5Algebra; Algebraic-geometry codes; Codes and applications; Codes and combinatorial structures; Group cod作者: 彩色的蠟筆 時間: 2025-3-28 03:59
978-3-540-87447-8Springer-Verlag Berlin Heidelberg 2008作者: 泥土謙卑 時間: 2025-3-28 08:04 作者: laparoscopy 時間: 2025-3-28 12:54 作者: 任意 時間: 2025-3-28 16:29 作者: LINES 時間: 2025-3-28 19:13
Lecture Notes in Earth SciencesThe quality of an algebraic geometry code depends on the curve from which the code has been defined. In this paper we consider codes obtained from ., namely those whose number of rational points attains the Lewittes’ bound for some rational point . and the Weierstrass semigroup at . is symmetric.作者: Finasteride 時間: 2025-3-28 23:06
Sedimentation as a Three-Component SystemWe determine the Weierstrass semigroup of a pair of rational points on Norm-Trace curves. We use this semigroup to improve the lower bound on the minimum distance of two-point algebraic geometry codes arising from these curves.作者: 陳腐的人 時間: 2025-3-29 06:26 作者: 神圣不可 時間: 2025-3-29 09:41
Sedimentation as a Three-Component SystemWe consider codes that offer unequal error protection to different information symbols, as measured by the so-called separation vector (a generalisation of the minimum Hamming distance)..We determine the parameters of all optimal linear quaternary codes of length at most eleven.作者: Obstreperous 時間: 2025-3-29 14:00 作者: 任意 時間: 2025-3-29 16:32
Witness Sets,Given a set . of binary .-tuples and .?∈?., how many bits of . suffice to distinguish it from the other elements in .?? We shed new light on this old combinatorial problem and improve on previously known bounds.作者: maverick 時間: 2025-3-29 20:02 作者: Synthesize 時間: 2025-3-30 00:16
Algebraic Geometry Codes from Castle Curves,The quality of an algebraic geometry code depends on the curve from which the code has been defined. In this paper we consider codes obtained from ., namely those whose number of rational points attains the Lewittes’ bound for some rational point . and the Weierstrass semigroup at . is symmetric.作者: COMA 時間: 2025-3-30 07:33
Two-Point Codes on Norm-Trace Curves,We determine the Weierstrass semigroup of a pair of rational points on Norm-Trace curves. We use this semigroup to improve the lower bound on the minimum distance of two-point algebraic geometry codes arising from these curves.作者: 鋼筆記下懲罰 時間: 2025-3-30 10:29
On the Kronecker Product Construction of Completely Transitive ,-Ary Codes,For any integer .?≥?1 and for any prime power ., the explicit construction of an infinite family of completely transitive (and completely regular) .-ary codes with minimum distance .?=?3 and with covering radius . is given.作者: 娘娘腔 時間: 2025-3-30 14:52 作者: 壯觀的游行 時間: 2025-3-30 17:25
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/228892.jpg作者: 教育學 時間: 2025-3-30 22:03
M. Guala,K. T. Christensen,R. J. Adrianof the notion of completely regular codes, given by Delsarte [3]. This problem of existence of such structures is closely related to Delsarte hypothesis about the nonexistence of nontrivial perfect codes in Johnson graphs, the problem of existence of block schemes, the problem of existence of comple作者: 虛度 時間: 2025-3-31 04:00 作者: Affectation 時間: 2025-3-31 08:14 作者: 重疊 時間: 2025-3-31 09:37 作者: 親密 時間: 2025-3-31 17:03
https://doi.org/10.1007/978-94-011-4930-3esent two results that show different applications of algebraic methods in coding theory. One of them refers to the classical context and another one to the quantum error correcting theory. These results can be found in [5] and [13] respectively, where proofs and more details can be found.作者: 新陳代謝 時間: 2025-3-31 18:33
F. Watchorn,G. J. Nichols,D. W. J. Bosenceistortions have upon the Kolmogorov complexity and the clustering by compression technique (the latter based on Normalized Compression Distance, NCD). We show how to decrease the complexity of the considered books introducing several modifications in them. We measure how the information contained in作者: 尊嚴 時間: 2025-4-1 01:39 作者: IRK 時間: 2025-4-1 03:12 作者: linguistics 時間: 2025-4-1 09:15
Critical review of thickener design methods,ial modules which enables us to apply results from the 2007-paper?[8] to introduce the notions of “.-encoder” and “minimal .-encoder”. Here the latter notion is the ring analogon of a row reduced polynomial encoder from the field case. We show how to construct a minimal trellis representation of a d作者: 種族被根除 時間: 2025-4-1 10:39
https://doi.org/10.1007/BFb0117861aperiodic properties of the parent array. For the case of 2 ×2 ×...×2 arrays we define two new notions of aperiodicity by exploiting a unitary matrix represention. In particular, we apply unitary rotations by members of a size-3 cyclic subgroup of the local Clifford group to the aperiodic descriptio作者: 白楊魚 時間: 2025-4-1 15:31
Sedimentation as a Three-Component System to sink nodes are potentially viewed to be corruptible. We study the maximum security capacity for this problem for a single- source single-sink scenario, and we generalize our study for multicast with network coding. Based on our study, two optimization problems are introduced to increase the secu作者: Collision 時間: 2025-4-1 21:14
