In this paper, we propose two low-complexity decoding algorithms for systematic binary deterministic rateless codes. One is based on segmentation available for large information block. Segmentation-based decoding algorithm can dramatically reduce the complexity on solving inverse of matrix, which dominates the complexity of decoding. Another is based on enumeration for small information block. Enumeration-based decoding algorithm can avoid solving the inverse of matrix, which is of advantage in term of complexity.