The performance of a hybrid sequential-algebraic coding scheme is evaluated taking into account the probability of error, the complexity of implementation, and the overall rate. The hybrid scheme is one suggested by Huband and Jelinek based on a similar proposal by Falconer. Upper and lower bounds on the performance of a straight sequential coding scheme have been utilized. The corresponding relationships for the algebraic portion of the hybrid code and the complete hybrid code are obtained. The performance of the hybrid scheme is compared to the performance of a straight sequential scheme, and found to obtain up to several orders of magnitude improvement in probability of error for the, same overall rate and complexity of implementation.