검색어 입력폼

[네트워크, 그래프이론] Network Information Flow

등록일 2003.09.23 파워포인트파일MS 파워포인트 (ppt) | 10페이지 | 가격 800원

소개글

논문을 PT로 정리한 것으로 A+ 받은 자료입니다.

유용하게 쓰세요~*

목차

Abstract
A Max-Flow Min-Cut theorem
Model of coding system
Conclusion
Reference

본문내용

Abstract
network information flow
A number of information sources are to be multicast to certain sets of destinations.
model
one information source & sets of destinations
Result
regarded as the Max-flow Min-cut Theorem for network information flow

A Max-Flow Min-Cut theorem
A theorem which characterizes the admissible coding rate region for the single-source problem.

- One-source L-sink problem
- The capacity of an edge(i,j) = Rij
- F = [ Fij ,(i,j) ∈ E ] is a flow = 0 ≤ Fij ≤ Rij

참고 자료

Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, Senior Member
다운로드 맨위로