找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Methods and Models; Rudolf Ahlswede’s Le Rudolf Ahlswede ,Alexander Ahlswede,Ingo Althöfer, Book 2018 Springer International

[复制链接]
查看: 46137|回复: 35
发表于 2025-3-21 19:25:25 | 显示全部楼层 |阅读模式
书目名称Combinatorial Methods and Models
副标题Rudolf Ahlswede’s Le
编辑Rudolf Ahlswede ,Alexander Ahlswede,Ingo Althöfer,
视频video
概述Written by a well-known author.Useful as a self-study guide.Includes comments from an invited well-known expert
丛书名称Foundations in Signal Processing, Communications and Networking
图书封面Titlebook: Combinatorial Methods and Models; Rudolf Ahlswede’s Le Rudolf Ahlswede ,Alexander Ahlswede,Ingo Althöfer, Book 2018 Springer International
描述.The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem...A code can be regarded combinatorially as a hypergraph; and many coding theorems can be obtained by appropriate colourings or coverings of the underlying hypergraphs. Several such colouring and covering techniques and their applications are introduced in this book. Furthermore, codes produced by permutations and one of Ahlswede’s favourite research fields -- extremal problems in Combinatorics -- are presented.  . .Whereas the first part of the book concentrateson combinatorial methods in order to analyse classical codes as prefix codes or codes in the Hamming metric, the second is devoted to combinatorial models in Information Theory. Here the code concept already relies on a rather c
出版日期Book 2018
关键词94-XX,94B; Codes and extremal problems; Codes and orthogonal polynomials; Codes produced by permutation
版次1
doihttps://doi.org/10.1007/978-3-319-53139-7
isbn_softcover978-3-319-85073-3
isbn_ebook978-3-319-53139-7Series ISSN 1863-8538 Series E-ISSN 1863-8546
issn_series 1863-8538
copyrightSpringer International Publishing AG 2018
The information of publication is updating

书目名称Combinatorial Methods and Models影响因子(影响力)




书目名称Combinatorial Methods and Models影响因子(影响力)学科排名




书目名称Combinatorial Methods and Models网络公开度




书目名称Combinatorial Methods and Models网络公开度学科排名




书目名称Combinatorial Methods and Models被引频次




书目名称Combinatorial Methods and Models被引频次学科排名




书目名称Combinatorial Methods and Models年度引用




书目名称Combinatorial Methods and Models年度引用学科排名




书目名称Combinatorial Methods and Models读者反馈




书目名称Combinatorial Methods and Models读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:17:26 | 显示全部楼层
发表于 2025-3-22 00:44:49 | 显示全部楼层
发表于 2025-3-22 06:47:57 | 显示全部楼层
Codes Produced by Permutations: The Link Between Source and Channel Codingbound, can be produced with relatively few (linear in the block length) permutations from a single codeword. This cutdown in complexity may be of practical importance. The motivation for looking at such codes came from our covering lemma, which makes it possible to build correlated source codes from
发表于 2025-3-22 09:52:41 | 显示全部楼层
发表于 2025-3-22 12:54:56 | 显示全部楼层
Orthogonal Polynomials in Information Theory Comput 116(2):162–173, 1995, [.]; Tamm, Discret Appl Math 61:271–283, 1995, [.]; Proceedings of 1998 IEEE Symposium on Information Theory, MIT, Cambridge, 1998, [.]; Tamm, IEEE Trans Inf Theory 44(5):2003–2009, 1998, [.]; Numbers, Information and Complexity, Special Volume in Honour of Rudolf Ahlsw
发表于 2025-3-22 19:27:06 | 显示全部楼层
Book 2018torial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to mult
发表于 2025-3-23 00:56:05 | 显示全部楼层
1863-8538 Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The b
发表于 2025-3-23 01:41:16 | 显示全部楼层
How Vegetation Reinforces Soil on Slopes,idge, 1998, [.]; Tamm, IEEE Trans Inf Theory 44(5):2003–2009, 1998, [.]; Numbers, Information and Complexity, Special Volume in Honour of Rudolf Ahlswede, 2000, [.]; Proceedings of the Workshop Codes and Association Schemes, 2001, [.]; Electron J Comb 8(A1):31, 2001, [.]; J Stat Plan Interf 2(2):433–448, 2002, [.]) of Tamm.
发表于 2025-3-23 08:17:13 | 显示全部楼层
Orthogonal Polynomials in Information Theoryidge, 1998, [.]; Tamm, IEEE Trans Inf Theory 44(5):2003–2009, 1998, [.]; Numbers, Information and Complexity, Special Volume in Honour of Rudolf Ahlswede, 2000, [.]; Proceedings of the Workshop Codes and Association Schemes, 2001, [.]; Electron J Comb 8(A1):31, 2001, [.]; J Stat Plan Interf 2(2):433–448, 2002, [.]) of Tamm.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-25 06:29
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表