We consider the full-duplex operation with network coding in two-hop relay networks to enhance the throughput for block transmission of packets. We propose a low-complexity transmission scheme, which does not rely on channel state information (CSI), and hence can be easily implemented in practical systems. We derive a closed-form upper bound on the asymptotic throughput of the proposed scheme, and show that the derived upper bound is tighter than a general upper bound on the throughput of any transmission scheme even with perfect CSI. Simulation results show that, the proposed scheme actually performs close to the general upper bound, and in most cases it substantially outperforms the traditional uncoded Automatic Repeat-reQuest scheme which relies heavily on the ACK/NAK feedback for packet retransmission.