消息首页搜索举报

信息论基础(英文版)/国外信息科学与技术图书系列网络技术 (加)杨伟豪新华正版

网络技术新华书店全新正版书籍支持7天无理由

69.3 7.0折 99 全新

库存4件

河北保定

认证卖家担保交易快速发货售后保障

作者(加)杨伟豪

出版社科学出版社

ISBN9787030344564

出版时间2015-09

版次1

装帧平装

字数430千字

定价99元

货号xhwx_1201175956

上书时间2024-01-05

浩子书屋

八年老店

已实名已认证进店收藏店铺

在售商品暂无
平均发货时间 14小时
好评率暂无

最新上架

实验班提优训练数学 3升4年级人教版(rmjy) 暑衔接版小学数学单元测试严军新华正版 ¥29.80

实验班提优训练数学 2升3年级暑衔接版人教版(rmjy) 小学数学单元测试严军新华正版 ¥29.80

画语·画记美术理论娄烜烜新华正版 ¥43.24

绩效与薪酬管理大中专公共社科综合杨廷钫新华正版 ¥36.64

大数据分析与挖掘大中专公共社科综合刘伟新华正版 ¥37.35

旅游市场营销大中专公共社科综合赵宇飞、石丹、麻松、蔡亚男、刘莉、姜雪、刘秀实、仝菲新华正版 ¥45.60

前行的人生/曾高飞中国现当代文学曾高飞新华正版 ¥84.14

地下水污染控制（第二版）大中专理科科技综合郑天元新华正版 ¥30.40

旅游目的地管理：理论与实践大中专理科科技综合杨光明，张凤太新华正版 ¥37.95

商品详情

品相描述：全新: 正版特价新书

商品描述: 目录：

1.  the  science  of  information
2.  information  measures
  2.1  independence  and  markov  chains
  2.2  shannons  information  measures
  2.3  continuity  of  shannons  information  measures
  2.4  chain  rules
  2.5  informational  divergence
  2.6  the  basic  inequalities
  2.7  some  useful  information  inequalities
  2.8  fanos  inequality
  2.9  entropy  rate  of  stationary  source
  problems
  historical  notes
3.  zero-error  data  pression
  3.1  the  entropy  bound
  3.2  prefix  codes
    3.2.1  definition  and  estence
    3.2.2  huffman  codes
  3.3  redundancy  of  prefix  codes
  problems
  historical  notes
4.  weak  typicality
  4.1  the  weak  aep
  4.2  the  source  co  theorem
  4.3  efficient  source  co
  4.4  the  shannon-mcmiilan-breimantheorem
  problems
  historical  notes
5.  strong  typicality
  5.1  strongaep
  5.2  strong  typicality  versus  weak  typicality
  5.3  joint  typicality
  5.4  an  interpretation  of  the  basic  inequalities
  problems
  historical  notes
6.  the/-measure
  6.1  preliminaries
  6.2  the/-measure  for  two  random  variables
  6.3  construction  of  the/-measure  ч*
  6.4  #*  can  be
  6.5  information  diagrams
  6.6  examples  of  applications
  appendix  6.a:  a  variation  of  the  inclusion-exclusion  formula
  problems
  historical  notes
7.  markov  structures
  7.1  conditional  mutual  independence
  7.2  full  conditional  mutual  independence
  7.3  markov  random  field
  7.4  markov  chain
  problems
  historical  notes
8.  channel  capacity
  8.1  discrete  memorylesschannels
  8.2  the  channel  co  theorem
  8.3  the  converse
  8.4  achievability  of  the  channel  capacity
  8.5  a  discussion
  8.6  feedback  capacity
  8.7  separation  of  source  and  channel  co
  problems
  historical  notes
9.  rate-distortion  theory
  9.1  single-letter  distortion  measures
  9.2  the  rate-distortion  function  r(d)
  9.3  the  rate-distortion  theorem
  9.4  the  converse
  9.5  achievability  of  ri(d)
  problems
  historical  notes
10.  the  blahut-arimoto  algorithms
  10.i  alternating  optimization
  10.2  the  algorithms
    10.2.1  channel  capacity
    10.2.2  the  rate-distortion  function
  10.3  convergence
    10.3.1-  a  sufficient  condition
    10.3.2  convergence  to  the  channel  capacity
  problems
  historical  notes
11.  single-source  work  co
  11.1  a  point-to-point  work
  11.2  what  is  work  co?
  11.3  a  work  code
  11.4  the  max-flow  bound
  11.5  achievability  of  the  max-flow  bound
    11.5.1  acyclic  works
    11.5.2  cyclic  works
  problems
  historical  notes
12.  information  inequalities
  12.1  the  region  fn
  12.2  information  expressions  in  canonical  form
  12.3  a  geometrical  framework
    12.3.1  unconstrained  inequalities
    12.3.2  constrained  inequalities
    12.3.3  constrained  identities
  12.4  equivalence  of  constrained  inequalities
  12.5  the  implication  problem  of  conditional  independence
  problems
  historical  notes
13  shannon-type  inequalities
  13.1  the  elemental  inequalities
  13.2  a  linear  programming  approach
    13.2.1  unconstrained  inequalities
    13.2.2  constrained  inequalities  and  identities
  13.3  a  duality
  13.4  machine  proving  -  itip
  13.5  tackling  the  implication  problem
  13.6  minimality  of  the  elemental  inequalities
  appendix  13.a:  the  basic  inequalities  and  the  polymatroidal
    aoms
  problems
  historical  notes
14.  beyond  shannon-type  inequalities
  14.1  characterizations  of  г2,г3,  and  гn
  14.2  a  non-shannon-type  unconstrained  inequality
  14.3  a  non-shannon-type  constrained  inequality
  14.4  applications
  problems
  historical  notes
15.  multi-source  work  co
  15.1  two  characteristics
    15.1.1  the  max-flow  bounds
    15.1.2  superition  co
  15.2  examples  of  application
    15.2.1  multilevel  diversity  co
    15.2.2  satellite  munication  work
  15.3  a  work  code  for  acyclic  works
  15.4  an  inner  bound
  15.5  an  outer  bound
  15.6  the  lp  bound  and  its  tightness
  15.7  achievability  of  rin
  appendix  15.a:  appromation  of  random  variables  with
    infinite  alphabets
  problems
  historical  notes
16.  entropy  and  grou
  16.1  group  preliminaries
  16.2  group-characterizable  entropy  functions
  16.3  a  group  characterization  of  гn
  16.4  information  inequalities  and  group  inequalities
  problems
  historical  notes
bibliography
index

内容简介：

信息论基础（英文版）作者（杨伟豪）现为中文大学网络编码研究所主任，是网络编码理论的提出者之一。本书原版自2002年出版以来，被哥伦比亚大学、康奈尔大学、麻省理工学院、斯坦福大学等美国有名学府所采用，是信息理论方面的重要教材。本书首先介绍了信息论的经典内容，然后全面详细地论述了，度量、网络编码、shannon型与非shannon型信息不等式等理论，以及熵函数与群论之间的关系。信息论基础（英文版）中配有大量的实例、插图和题，适合作为通信、电子信息、计算机等专业的高年级本科生和的教材，也可供相关领域的科研人员参。

作者简介：

杨伟豪（raymondw．yeung）教授1988年于美国康奈尔大学。获博士。之后曾在at＆t贝尔实验室工作3年，于1991年加入中文大学。现为网络编码研究所主任。是网络编码理论的提出者之一，其主要研究领域为信息理论与网络编码。他还是ieeefellow和工程师学会会士。