搜索结果: 1-15 共查到“工学 coding”相关记录200条 . 查询时间(0.187 秒)
Coding for health equity(图)
医疗保健 编码 计算机科学
2023/6/5
2017年5G和未来网络频道编码研讨会(2017 Workshop on Channel Coding for 5G and Future Networks)
2017年 5G和未来网络频道编码 研讨会
2017/3/30
The Workshop on Channel Coding for 5G and Future Networks will be held in Paris, France, in conjunction with IEEE ICC 2017, 21-25 May 2017.
Channel coding is a well-studied subject – some say. The ch...
THE RESEARCH OF FINE CLASSIFICATION AND CODING OF CITY GEO-NAMES
Geonames City Fine Classifying Coding
2016/3/17
Geonames are the bridge to link the socio-economic and spatial information. Names and related information products as essential mapping information resources, People can get more relevant information ...
The Affine Projection Model as a Tool for Rapid Geo-Coding of IRS P5 Satellite Imagery
High Resolution Pushbroom IRS-P5 Mapping Sensor Modeling
2015/12/18
Nowadays, the information content of the satellite imageries as a means for the disaster forecasting and management has attracted the worldwide attention more than before. On the other hand, linear ar...
An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels
Feedback discrete memoryless channel error exponent
2015/8/17
Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk–Kailath, Horstein), or apply to general channels but either have high coding comple...
Optimized Noisy Network Coding for Gaussian Relay Networks
Optimized Noisy Network Gaussian Relay Networks
2015/8/17
In this paper, we provide an improved lower bound on the rate achieved by noisy network coding in arbitrary Gaussian relay networks, whose gap to the cutset upper bound depends on the network not only...
Noisy network coding naturally combines two parallel lines of work on network information flow — network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress–forward codi...
A 3-node lossy source coding problem for a 2-DMS(X1, X2) is considered. Source nodes 1 and 2 observe X1 and X2, respectively, and each wishes to reconstruct the other source with a prescribed distorti...
Noisy network coding unifies network coding by Ahlswede, Cai, Li, and Yeung for noiseless networks and compress–forward by Cover and El Gamal for noisy relay channels.
Noisy Network Coding
Noisy Network
2015/8/17
A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noisele...
We investigate distributed source coding of two correlated sources X and Y where messages are passed to a decoder in a cascade fashion. The encoder of X sends a message at rate R1 to the encoder of Y....
A Proof of Marton’ s Coding Theorem for the Discrete Memoryless Broadcast Channel
Marton’ s Coding Theorem Discrete Memoryless Broadcast Channel
2015/8/12
A simple proof using random partitions and typicality is given for Marton’ s coding theorem for broadcast channels.
Source Coding With Limited-Look-Ahead Side Information at the Decoder
Causal source codes delay-constrained coding Gel’fand–Pinsker channel rate distortion function Slepian–Wolf coding Wyner–Ziv coding
2015/8/12
We characterize the rate distortion function for the source coding with decoder side information setting when the ith reconstruction symbol is allowed to depend only on the first i + `side information...
Noisy Network Coding
Compress-forward discrete memoryless network Gaussian network interference relay channel network coding noisy network coding relaying two-way relay channel
2015/8/12
A noisy network coding scheme for communicating messages between multiple sources and destinations over a general noisy network is presented. For multi-message multicast networks, the scheme naturally...
An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels
Feedback discrete memoryless channel error exponent
2015/8/12
Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk–Kailath, Horstein), or apply to general channels but either have high coding complexity (...