ดูต้นฉบับสำหรับ มุนินทร์ เอี่ยมโอภาส

==My Profile==

'''Name:''' Munin Eamopas (Nin)

'''E-Mail Address:''' rnunin(at)gmail(dot)com

==Research Topic==
Network coding

==Notes==

'''Polynomial time algorithms for multicast network code construction'''

find encoding vector for edge e , b(e) , from

<math>b(e) = \sum_{e'  \in  \Gamma_{in}(start(e)) } m_e(e')b(e')</math>

select m(e') randomly and find b(e)

check if (all t in T) ; Bt\ {b(Ft(e))} U {b(e)}   is linearly independent 

if not select m(e) again



'''Polynomial-Time Construction of Linear Network Coding'''
*k independent sessions between k source-sink pairs 
*can be solved in polynomial time
*its exponent is obviously not small



'''Simple Network Codes for Instantaneous Recovery from Edge Failures in Unicast Connections'''

Unicast (1sorce -> 1destination)
Simply unicast พิจารณา node แค่ 4 แบบ , แบ่ง network เป็น blockๆ
* capacity in = out
**degree  in > out
**degree  in < out
* capacity in != out
**degree  in > out
**degree  in < out
*ไม่พูดถึง degree in = out