"Real" and "Complex" Network Codes
Saurabh Shintre, Sachin Rajsekhar Katti, Sidharth Jaggi, Bikash Kumar Dey, Dina Katabi · 2008
Algebraic approaches to Network Coding focuses on consider ing data as element of a finite field(FFNC) and use finite field algebra at the in- terior nodes. As an alternative, we propose Arithmetic Netw ork Codes(ANC) in which the nodes perform finite precision arithmetic over r and complex fields. We demonstrate the use of such codes in Multi-Resolut ion Transmission and natural advantages gained in Wireless Networks. We show , through simula- tions, that although real field can be considered as an asympt otically large finite field, the performance of similar coding strategies give different results in both scenarios. Our results aim at finding the parameters that gov ern performance of ANC.