Network coding is an emerging field of research with sound and mature theory supporting it. Recent works shows that it has many benefits like improved fault tolerance, higher flexibility in selection of file parts to transfer and resiliency to network partitions [4, 3]. Despite those appealing properties there is no wide usage of network coding in real file sharing applications.

In this work, we try to bridge the gap between theory of network coding and practice. From the one hand, we deploy one the most successful file sharing client, the BitTorrent client. We use the BitTorrent algorithm for optimizing the neighbor selections for maximizing the upload bandwidth. From the other hand, we propose several simple heuristics that improve significantly the efficiency of the network coding deployed. In a nutshell, we propose computation intensive variant of network coding that can be applied to most of the existing network coding protocols. By changing the random selection of coded parts to a selection based on feedback from the network, we significantly improve the network utilization and the efficiency of the protocol.

In this paper we report our work in progress building the BitCod client. Using extensive simulations we demonstrate that our technique can compete with the performance of the state-of-the-art BitTorrent [2] file sharing client. Next, we plan to implement and test a prototype of the BitCod client over the WAN.