The application of joint source-channel coding, based on fountain codes, in the broadcast timeslot of wireless two-way network coding is investigated in this paper. A computationally efficient subroutine is contributed to the implementation of the fountain compressor, and an error analysis is done. Motivated to develop a true joint source-channel-network code that compresses, adds robustness against channel noise and network codes two packets on a single bipartite graph and iteratively decodes the intended packet on the same Tanner graph, an adaptation of the fountain compressor is presented. The proposed code is shown to outperform a separated joint source-channel and network code in high source entropy and high channel noise regions.
Francois P. S. Luus, Bodhaswar T. Maharaj