標(biāo)題: Titlebook: General Theory of Information Transfer and Combinatorics; Rudolf Ahlswede,Lars B?umer,Haik Mashurian Book 2006 Springer-Verlag Berlin Heid [打印本頁] 作者: 漏出 時間: 2025-3-21 19:07
書目名稱General Theory of Information Transfer and Combinatorics影響因子(影響力)
書目名稱General Theory of Information Transfer and Combinatorics影響因子(影響力)學(xué)科排名
書目名稱General Theory of Information Transfer and Combinatorics網(wǎng)絡(luò)公開度
書目名稱General Theory of Information Transfer and Combinatorics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱General Theory of Information Transfer and Combinatorics被引頻次
書目名稱General Theory of Information Transfer and Combinatorics被引頻次學(xué)科排名
書目名稱General Theory of Information Transfer and Combinatorics年度引用
書目名稱General Theory of Information Transfer and Combinatorics年度引用學(xué)科排名
書目名稱General Theory of Information Transfer and Combinatorics讀者反饋
書目名稱General Theory of Information Transfer and Combinatorics讀者反饋學(xué)科排名
作者: 邊緣 時間: 2025-3-21 20:18 作者: ineluctable 時間: 2025-3-22 00:46
On Identificationder and receiver can communicate via a .. In the simplest case the sender just puts some . into the channel and the receiver gets some .. Usually the channel is ., i.e. the channel output is a random variable whose distribution is governed by the input letters. This model can be extended in several 作者: 拔出 時間: 2025-3-22 05:30
Identification and Predictionede. This and other directions of research can be found also in [2]. Well known is Shannon’s theory of transmission of messages over a noisy channel ([15]). Using the framework of Shannon’s channel model a new concept of information transfer – called identification – was introduced by Ahlswede and D作者: 污穢 時間: 2025-3-22 10:43
Watermarking Identification Codes with Related Topics on Common Randomnessel to attack the watermark and both,the information hider and the decoder, know the attack channel;.(2) the decoder either completely he knows the covertext or knows nothing about it..Then instead of the first assumption they suggested to study more robust models and instead of the second assumption作者: encomiast 時間: 2025-3-22 14:57
Notes on Conditions for Successive Refinement of Informationtian’s result on multiple descriptions [13], we refine our previous proof on successive refinability conditions reported in [7] and restate the result by Tuncel and Rose [17]. In particular, it is noted that the successive refinement in “purely” reliability sense is always possible.作者: encomiast 時間: 2025-3-22 17:07 作者: pantomime 時間: 2025-3-23 01:09
Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraintber .(.) of messages which can be reliably identified using an identification code grows doubly exponentially with the wordlength ., as .→∞. This paper provides contributions to the study of identification plus transmission (IT) codes under a wordlength constraint .≤.. for sending an identifier and 作者: CRUDE 時間: 2025-3-23 04:24
Codes with the Identifiable Parent Property and the Multiple-Access Channel,...,.. We are interested in codes . with the property that, given any descendant .., one can always identify at least one of the ‘parent’ codewords in .. We study bounds on .(.,.), the maximal cardinality of a code . with this property, which we call the .. Such codes play a role in schemes that pr作者: eardrum 時間: 2025-3-23 08:23 作者: dragon 時間: 2025-3-23 21:55
Large Families of Pseudorandom Sequences of , Symbols and Their Complexity – Part IIer the .–complexity (extended now to .–ary alphabets) . of a family .. It serves again as a performance parameter of key spaces in cryptography. We give a lower bound for the .–complexity for a family of the type constructed in Part I. In the last sections we explain what can be said about the theor作者: prodrome 時間: 2025-3-24 02:05 作者: HAUNT 時間: 2025-3-24 03:42 作者: 難聽的聲音 時間: 2025-3-24 09:31
Density Functional Calculations,s an answer to the question “What is the actual message?” In the identification problem we deal with the question how many possible messages the receiver of a noisy channel can identify? Identification means there is an answer to the question “Is the actual message .?” Here . can be any member of the set of possible messages.作者: 現(xiàn)代 時間: 2025-3-24 12:29
https://doi.org/10.1007/978-3-031-37499-9ede. This and other directions of research can be found also in [2]. Well known is Shannon’s theory of transmission of messages over a noisy channel ([15]). Using the framework of Shannon’s channel model a new concept of information transfer – called identification – was introduced by Ahlswede and Dueck in [1].作者: 少量 時間: 2025-3-24 17:50
Computational Commutative Algebra 2tian’s result on multiple descriptions [13], we refine our previous proof on successive refinability conditions reported in [7] and restate the result by Tuncel and Rose [17]. In particular, it is noted that the successive refinement in “purely” reliability sense is always possible.作者: 打火石 時間: 2025-3-24 22:43
,Theodorsen’s Integral Equation,,...,.. We are interested in codes . with the property that, given any descendant .., one can always identify at least one of the ‘parent’ codewords in .. We study bounds on .(.,.), the maximal cardinality of a code . with this property, which we call the .. Such codes play a role in schemes that protect against piracy of software.作者: 針葉 時間: 2025-3-25 02:18 作者: 衍生 時間: 2025-3-25 04:09 作者: 初學(xué)者 時間: 2025-3-25 08:34 作者: 密碼 時間: 2025-3-25 14:14 作者: monologue 時間: 2025-3-25 18:53 作者: Intuitive 時間: 2025-3-25 21:06 作者: 精密 時間: 2025-3-26 02:24 作者: Fester 時間: 2025-3-26 07:36 作者: 征稅 時間: 2025-3-26 09:29 作者: ensemble 時間: 2025-3-26 16:29
Peter Russer,Johannes A. RusserA large family of finite pseudorandom binary sequences is presented, and also tested “theoretically” for pseudorandomness. The optimal way of implementation is discussed and running time analysis is given. Numerical calculations are also presented.作者: 膠狀 時間: 2025-3-26 19:27 作者: Enthralling 時間: 2025-3-27 00:17 作者: EXALT 時間: 2025-3-27 01:40
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block EnciphererIn this paper we propose a model of secrecy systems for identification via channels with ALIB encipherers and find the smallest asymptotic key rate of the ALIB encipherers needed for the requirement of security.作者: 現(xiàn)任者 時間: 2025-3-27 05:27 作者: hyperuricemia 時間: 2025-3-27 13:30
978-3-540-46244-6Springer-Verlag Berlin Heidelberg 2006作者: 為寵愛 時間: 2025-3-27 16:04 作者: Ligament 時間: 2025-3-27 21:43
0302-9743 Overview: 978-3-540-46244-6978-3-540-46245-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: convert 時間: 2025-3-27 23:47
https://doi.org/10.1007/b101871nt on the first 60 years we refer to the preface of the book “Numbers, Information and Complexity”, special volume in honour of R. Ahlswede on occasion of his 60th birthday, edited by Ingo Alth?fer, Ning Cai, Gunter Dueck, Levon Khachatrian, Mark S. Pinsker, Andras Sárk?zy, Ingo Wegener and Zhen Zha作者: Hallowed 時間: 2025-3-28 05:30 作者: 免除責(zé)任 時間: 2025-3-28 07:51
Quantum Mechanics: A Brief Introduction,der and receiver can communicate via a .. In the simplest case the sender just puts some . into the channel and the receiver gets some .. Usually the channel is ., i.e. the channel output is a random variable whose distribution is governed by the input letters. This model can be extended in several 作者: LURE 時間: 2025-3-28 11:19 作者: 植物群 時間: 2025-3-28 15:05 作者: 連系 時間: 2025-3-28 19:45
Computational Commutative Algebra 2tian’s result on multiple descriptions [13], we refine our previous proof on successive refinability conditions reported in [7] and restate the result by Tuncel and Rose [17]. In particular, it is noted that the successive refinement in “purely” reliability sense is always possible.作者: 慢跑 時間: 2025-3-28 22:56
https://doi.org/10.1007/978-1-4614-1800-9rmanent user activity, Khachatrian [10] has written an excellent survey for general, symmetric and non-symmetric rates. In this survey, we only deal with the special symmetric rate case, where all users have two codewords. The length of the shortest possible code is characterized, and amongst others作者: 高歌 時間: 2025-3-29 07:05 作者: 有限 時間: 2025-3-29 08:52 作者: 文件夾 時間: 2025-3-29 15:08
Introduction to Contact Mechanics,ich we conjecture to be tight and which is proved to be tight (Corollary 1) for Wyner’s original (degraded) wire-tape channel and also for the reversely degraded wire-tape channel for which the legitimate receiver gets a degraded version from the enemy (Corollary 2)..Somewhat surprisingly we complet作者: 競選運動 時間: 2025-3-29 18:17 作者: 懲罰 時間: 2025-3-29 22:35 作者: fructose 時間: 2025-3-30 03:49
Optimal Design and Location of Manipulators,er the .–complexity (extended now to .–ary alphabets) . of a family .. It serves again as a performance parameter of key spaces in cryptography. We give a lower bound for the .–complexity for a family of the type constructed in Part I. In the last sections we explain what can be said about the theor作者: Aprope 時間: 2025-3-30 05:37
Fran?ois-Xavier Roux,André Barkaave strong pseudorandom properties, they can be generated very slowly since no fast algorithm is known to compute ind .. The purpose of this paper is to modify this family slightly so that the members of the new family can be generated much faster, and they have almost as good pseudorandom propertie作者: refine 時間: 2025-3-30 08:21
Introduction to Contact Mechanics,ely determine the capacities of secure common randomness (Theorem 2) and secure identification (Theorem 3 and Corollary 3). Unlike for the DMC, these quantities are different here, because identification is linked to non-secure common randomness.作者: 搜尋 時間: 2025-3-30 16:24 作者: 急性 時間: 2025-3-30 18:55
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feeely determine the capacities of secure common randomness (Theorem 2) and secure identification (Theorem 3 and Corollary 3). Unlike for the DMC, these quantities are different here, because identification is linked to non-secure common randomness.作者: 令人心醉 時間: 2025-3-30 21:37 作者: 你敢命令 時間: 2025-3-31 02:12 作者: vitreous-humor 時間: 2025-3-31 05:33
Oil-Film Thickness in Rolling Bearings,ity of the family of these sequences is more important than its size. In this paper our goal is to construct “many” “good” PR sequences on . symbols, to extend the notion of .–complexity to the . symbol case and to study this extended .–complexity concept.作者: Metastasis 時間: 2025-3-31 09:33 作者: LUDE 時間: 2025-3-31 14:55
Large Families of Pseudorandom Sequences of , Symbols and Their Complexity – Part IIve a lower bound for the .–complexity for a family of the type constructed in Part I. In the last sections we explain what can be said about the theoretically best families . with respect to their .–complexity .. We begin with straightforward extensions of the results of [4] for .=2 to general . by using the same Covering Lemma as in [1].作者: occult 時間: 2025-3-31 19:19 作者: interpose 時間: 2025-4-1 01:18
General Theory of Information Transfer and Combinatorics作者: GLEAN 時間: 2025-4-1 04:14
https://doi.org/10.1007/b101871h can even quantitatively be measured – unheard of in classical Philosophy..During the period to be described here came on January 30, 2002 as a shock the message of the sudden and unexpected passing of his collaborator and friend Levon Khachatrian. His untimely death disrupted a very fruitful coope作者: 謊言 時間: 2025-4-1 06:27
Quantum Mechanics: A Brief Introduction,e channel) in such a way, that the receiver can . the sequence of output letters so that he can decide with a small probability of error what the message . was. The procedures for encoding and decoding are called a . for the channel and the number of times the channel is used to transmit one message作者: Brocas-Area 時間: 2025-4-1 14:03
https://doi.org/10.1007/978-3-540-70628-1he output sequence of covertext the information hider generates side information componentwise as the secret key. In the second model the only constraint to the key space is an upper bound for its rate..We present lower bounds for the identification capacities in the above models, which include the 作者: BURSA 時間: 2025-4-1 16:07
https://doi.org/10.1007/978-1-4614-1800-9optimal codes, but we do not know about constructions with length approaching the upper bound. The signature code is similar to the .. code examined by D’yachkov and Rykov [7]. It is interesting, that the upper and lower bounds for the length of .. codes are the same as for signature codes.作者: 不吉祥的女人 時間: 2025-4-1 19:19 作者: Incompetent 時間: 2025-4-1 23:27 作者: Affiliation 時間: 2025-4-2 05:13 作者: 污穢 時間: 2025-4-2 07:00
Watermarking Identification Codes with Related Topics on Common Randomnesshe output sequence of covertext the information hider generates side information componentwise as the secret key. In the second model the only constraint to the key space is an upper bound for its rate..We present lower bounds for the identification capacities in the above models, which include the
