QQ客服 官方微博 反馈留言

	Network Coding for Two-Unicast with Rate (1,2)
	Song, Wentu ; Feng, Rongquan ; Cai, Kai ; Zhang, Junshan
	2012
英文摘要	We consider a directed acyclic network with two source-sink pairs {s(1), t(1)} and {s(2), t(2)}. The source s(1) wishes to communicate a message X-1 to the sink t(1) and the source s(2) wishes to communicate two messages X-2 and X-3 to the sink t(2), where X-i, i = 1, 2, 3, are independent random variables of unit rate. We give a simple characterization for linear solvability of such networks under the condition that the minimum cut from {s(1), s(2)} to t(2) equals 3. We develop a region decomposition method for proving this result, which we believe can be an effective approach for non-multicast network coding problem.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000312544302002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; EI; CPCI-S(ISTP); 0
语种	英语
出处	EI ; SCI
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/315384]
专题	数学科学学院
推荐引用方式 GB/T 7714	Song, Wentu,Feng, Rongquan,Cai, Kai,et al. Network Coding for Two-Unicast with Rate (1,2). 2012-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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