A fast successive cancellation list flip (FSCLF) decoding algorithm is proposed to improve the problem that the decoding performance and complexity of the existing successive cancellation list flip (SCLF) decoding algorithm cannot be considered at the same time. The proposed algorithm speeds up the decoding by adding the identification of four special nodes. In the meantime, the construction of the critical set (CS) no longer depends on the error propagation caused by the previous decoding errors, instead, the log-likelihood ratio (LLR) value is calculated to determine the flipping position by the two special nodes of the R1 node and single-parity-check (SPC) node, and the information bit corresponding to the least reliable input LLR only need to be flipped when the parity check bit isn’t satisfied, thus both the number of the flipping and the complexity is reduced. Simulation results show that the signal-to-noise ratio of the FSCLF algorithm, compared with the SCLF algorithm, is improved about 0.09dB at the block error ratio (BLER) of 10-5. Therefore, the proposed decoding algorithm can play an important role in the middle and short code-length.