
This paper studies Single and Double Erasure Correcting (SDErC) Integer codes over the ring of integers. A notable departure from conventional integer codes is that the proposed SDErC integer codes successfully decode without the use of syndrome look-up tables. Further, we observe that the SDErC integer codes are equivalent to Single Error Correcting Integer codes. The requirement that the minimum distance of any SDErC code must be at least 3 is also validated by the studied SDErC integer codes. Furthermore, the probability of correct decoding of a SDErC integer code over a Binary Erasure Channel is derived. Finally, performance comparisons demonstrate that the SDErC integer codes achieve good code rates with logarithmic decoding complexity, making them efficient and practical for reliable data transmission.