濠电姷鏁搁崑娑樜涙惔銊ュ瀭闁兼祴鏅滃畷鏌ユ倵閿濆骸鏋涚紒鈧崒姘肩唵閻犺桨璀﹀Σ鍛娿亜閿曗偓瀵墎鎹㈠┑瀣潊闁绘ê寮跺В鎰版⒑闂堟稒鎼愭繛宸幖閻e嘲顫濈捄铏瑰幐闂侀€炲苯澧伴柤楦跨簿閵囨劙骞掗幋鐑嗘闂備礁鎼ˇ顖炴倶濠靛牆顥氶柛顭戝枓濡插牓鏌¢崘鈺傚暗闁伙綀浜槐鎺楀Ω瑜庨弳鈺冪磼鏉堛劍顥堥柡浣规崌閺佹捇鏁撻敓锟� [闂傚倷娴囬惃顐﹀幢閳轰焦顔勭紓鍌氬€哥粙鍕箯閿燂拷 | 闂傚倷鑳舵灙缂佺粯鍔楃划鏃堟倻閽樺鐎梺绋挎湰閸╁啴寮搁弽顓熺厪濠电偛鐏濋崝姘舵煛閸屾浜�]

    • 信息论的编码定理(第3版英文版香农信息科学经典)
      • 作者:(美)雅各布·沃尔福威茨|责编:陈亮//刘叶青
      • 出版社:世图出版公司
      • ISBN:9787519296902
      • 出版日期:2023/01/01
      • 页数:173
    • 售价:23.6
  • 内容大纲

        本书共有15章,内容丰富详实,还包含了相当多的历史评论和大量的参考书目,为读者进一步阅读拓展知识面提供了参考书目。
  • 作者介绍

  • 目录

    1.Heuristic Introduction to the Discrete Memoryless Channel
    2.Combinatorial Preliminaries
      2.1.Generated sequences
      2.2.Properties of the entropy function
      Remarks
    3.The Discrete Memoryless Channel
      3.1.Description of the channel
      3.2.A coding theorem
      3.3.The strong converse
      3.4.Strong converse for the binary symmetric channel
      3.5.The finite-state channel with state calculable by both sender and receiver
      3.6.The finite-state channel with state calculable only by the sender
      Remarks
    4.Compound Channels
      4.1.Introduction
      4.2.The canonical channel
      4.3.A coding theorem
      4.4.Strong converse
      4.5.Compound d.m.c. with c.p.f. known only to the receiver or only to the sender
      4.6.Channels where the c.p.f. for each letter is stochastically determined
      4.7.Proof of Theorem 4.6.4.
      4.8.The d.m.c. with feedback
      Remarks
    5.The Discrete Finite-Memory Channel
      5.1.The discrete channel
      5.2.The discrete finite-memory channel
      5.3.The coding theorem for the d.f.m.c.
      5.4.Strong converse of the coding theorem for the d.f.m.c.
      5.5.Rapidity of approach to C in the d.f.m.c.
      5.6.Discussion of the d.f.m.c.
      Remarks
    6.Channels with Arbitrarily Varying Channel Probability Functions
      6.1.Introduction
      6.2.Necessary and sufficient conditions for a positive rate of transmission
      6.3.  Remarks on the capacity of an arbitrarily varying channel
      6.4.The capacity C of an arbitrarily varying channel when b=2
      6.5.Certain results for the general arbitrarily varying channel
      Remarks
    7.General Discrete Channels
      7.1.Alternative description of the general discrete channel
      7.2.The method of maximal codes
      7.3.The method of random codes
      7.4.Weak converses
      7.5.Digression on the d.m.c.
      7.6.Discussion of the foregoing
      7.7.Channels without a capacity
      7.8.Strong converses
      7.9.The strong converse for the d.m.c. revisited
      Remarks
    8.The Semi-Continuous Memoryless Channel

      8.1.Introduction
      8.2.A coding theorem and its strong converse
    9.Continuous Channels with Additive Gaussian Noise
      9.1.A continuous memoryless channel with additive Gaussian noise
      9.2.Message sequences within a suitable sphere
      9.3.Message sequences on the periphery of the sphere orwithin a shell adjacent to the boundary
      9.4.Another proof of Theorems 9.2.1 and 9.2.2
      Remarks
    10.Mathematical Miscellanea
      10.1.Introduction
      10.2.The asymptotic equipartition property
      10.3.Admissibility of an ergodic input for a discrete finite- memory channel
    11.Fundamentals of Rate Distortion Theory
      11.1.Introduction
      11.2.The approximation theorem
      11.3.Converse of the approximation theorem
      11.4.Summary of the previous results
      11.5.The rate distortion function when side information is available
      Remarks
    12.Source Coding
      12.1.Separate coding to span the product of two spaces
      12.2.Source coding with side information at the decoder
      12.3.Encoding assisted by a common channel
      Remarks
    13.Source Coding and Rate Distortion
      13.1.The problem of Section 12.3 for rate distortion
      13.2.The rate distortion function for source coding with side information at the decoder
    14.Multiple Access Channels
      14.1.Description of the problem
      14.2.A coding theorem
      14.3.Converse of the coding theorem
      14.4.Miscellaneous remarks
    15.Degraded Broadcast Channels
      15.1.Formulation of the problem
      15.2.A coding theorem
      15.3.Beginning of the proof of the strong converse
      15.4.Proof of the weak converse
      15.5.Miscellaneous remarks
    References

推荐书目

  • 孩子你慢慢来/人生三书 华人世界率性犀利的一枝笔,龙应台独家授权《孩子你慢慢来》20周年经典新版。她的《...

  • 时间简史(插图版) 相对论、黑洞、弯曲空间……这些词给我们的感觉是艰深、晦涩、难以理解而且与我们的...

  • 本质(精) 改革开放40年,恰如一部四部曲的年代大戏。技术突变、产品迭代、产业升级、资本对接...

更多>>>