Titlebook: General Theory of Information Transfer and Combinatorics; Rudolf Ahlswede,Lars B?umer,Haik Mashurian Book 2006 Springer-Verlag Berlin Heid

漏出

書目名稱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é)科排名

邊緣

ineluctable

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

拔出

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

污穢

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

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

pantomime

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

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