Disclosed is a fast encoding method suitable for Reed-Solomon codes with a small number of redundancies including a step of setting parity-check matrices including presetting parity-check matrices H2 and H3 in which the number of redundant symbols s in the Reed-Solomon codes is 2 or 3. The method also includes a step of constructing the shortened Reed-Solomon codes including constructing (k, s) Reed-Solomon codes over a finite field GF(2m) that conform to the preset parity-check matrix; using k points {oi}i=1k in the R-points input {oi}i=0R−1 as message symbols, and setting the remaining points to zero; a step of encoding including recursively processing the R-points input to obatin s redundant symbols, achieving the encoding of Reed-Solomon codes with a small number of redundancies. Embodiments of the present invention further include an electronic device and a computer-readable storage medium.