Two new algorithms for space- and time- efficient decoding of minimum redundancy codes with numerical sequence property are investigated. Both algorithms are particularly efficient in case of large source alphabets and limited memory resources. Practical experiments show a reduction of up to 50 \% and more in the number of operations.