In traditional discussions of Fire codes, the proof of the burst-correction capability of this code is rather technical. It is never left out, because the descriptions of the standard decoding algorithm (by means of shift registers) do not give an independent proof of this burst-correction capability. Here, an algebraic method of decoding Fire codes is presented, that at the same time yields a transparent proof of the burst-correction capability of Fire codes