Modern networks are popular with a large number of short packets generated by many light weight, low power devices. We propose a new approach, segment combining and patching (SCP), for forward error control coding suitable for short packets, where the encoder logically divides a full packet into a number of partially overlapped subpackets based on a Finite Projective Plane of order m, and transmits the full packet n times. Upon receiving all n replicas of a full packet, the decoder generates an additional combined packet using Maximum Ratio Combining. By selecting non-faulty subpackets through Cyclic Redundancy Checks, both inter-cluster and intra-cluster patching are then performed on the n + 1 clusters of subpackets until no new non-faulty subpackets are generated. Simulation results in both AWGN and block fading channels demonstrate that the SCP is an effective approach for forward error control coding for short packet communication in embedded networks, sensor networks, and so on. Lastly, we provide a theory of SCP to show how it works.