Sprintson, AlexSadeghi, ParastooBooker, GrahamEl Rouayheb, Salim2015-12-10June 13-18http://hdl.handle.net/1885/61642We consider scenarios where wireless clients are missing some packets, but they collectively know every packet. The clients collaborate to exchange missing packets over an error-free broadcast channel with capacity of one packet per channel use. First, we present an algorithm that allows each client to obtain missing packets, with minimum number of transmissions. The algorithm employs random linear coding over a sufficiently large field. Next, we show that the field size can be reduced while maintaining the same number of transmissions. Finally, we establish lower and upper bounds on the minimum number of transmissions that are easily computable and often tight as demonstrated by numerical simulations.Keywords: Broadcast channels; Data exchange; Field size; Linear coding; Lower and upper bounds; Numerical simulation; Performance bounds; Randomized Algorithms; Wireless client; Information theory; Algorithms201010.1109/ISIT.2010.55133132016-02-24