Practical comparison of some decoders for erasure-correcting codes: speed vs. corrective ability
Abstract
Practical comparison of some decoders for erasure-correcting codes: speed vs. corrective ability
Incoming article date: 17.08.2025The paper is devoted to the search for an effective decoding method for a new class of binary erasure-correcting codes. The codes in question are set by an encoding matrix with restrictions on column weights (MRSt codes). To work with the constructed codes, a decoder based on information aggregates and a decoder based on the belief propagation are used, adapted for the case of erasures. Experiments have been carried out to determine the decoding speed and correcting ability of these methods in relation to the named classes of noise-resistant codes. In the case of MRSt codes, the decoder, based on the principle of spreading trust, significantly benefits in speed compared to the decoder for information aggregates, but loses slightly in terms of corrective ability.
Keywords: channels with erasure, distributed fault-tolerant data storage systems, code with equal-weight columns, decoder based on information aggregates, decoder based on the belief propagation, RSt code, MRSt code