2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/134295This article is focused on some variations of Reed-Muller codes that yield improvements to the rate for a prescribed decoding performance under the Berlekamp-Massey-Sakata algorithm with majority voting. Explicit formulas for the redundancies of the new codes are given.Information TheoryDiscrete MathematicsE.4text