QQ客服 官方微博 反馈留言

	Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
	PerAustrin; PetteriKaski; JesperNederlof; MikkoKoivisto
刊名	IEEE Transactions on Information Theory
	2018
卷号	Vol.64 No.2页码:1368-1373
关键词	Upper bound Computer science Electronic mail Adders Information technology Hypercubes Entropy Additive combinatorics binary adder channel isoperimetric inequality uniquely decodeable code pair zero-error capacity
ISSN号	0018-9448;1557-9654
URL标识	查看原文
公开日期	[db:dc_date_available]
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/5348973
专题	上海电子信息职业技术学院
作者单位	1.Department of Computer Science, Helsinki Institute for Information Technology HIIT, University of Helsinki, Helsinki, Finland 2.School of Computer Science and Communication, KTH Royal Institute of Technology, Stockholm, Sweden 3.Department of Information and Computer Science, Helsinki Institute for Information Technology HIIT, Aalto University, Espoo, Finland 4.Department of Mathematics and Computer Science, Technical University of Eindhoven, Eindhoven, AZ, The Netherlands
推荐引用方式 GB/T 7714	PerAustrin,PetteriKaski,JesperNederlof,et al. Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs[J]. IEEE Transactions on Information Theory,2018,Vol.64 No.2:1368-1373.
APA	PerAustrin,PetteriKaski,JesperNederlof,&MikkoKoivisto.(2018).Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs.IEEE Transactions on Information Theory,Vol.64 No.2,1368-1373.
MLA	PerAustrin,et al."Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs".IEEE Transactions on Information Theory Vol.64 No.2(2018):1368-1373.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。