An erasure correction coding apparatus that is applied to a higher layer processing section of a communication apparatus that performs packet communication by transmitting information packets and parity packets, comprising: an arranging section adapted to arrange information data which are included in a plurality of n of said information packets into a plurality of information blocks so that, in each information block, Kmax×(q-1) pieces of information data which constitute a sequence of consecutive items of the arranged information data are formed with information data included in n different information packets n ≥ k max ×(q-1), wherein Kmax is the constraint length of a parity check polynomial of equation 1 of a low-density parity-check convolutional code and (q-1) is the numerator of the coding rate (q-1)/q of the parity check polynomial; and an erasure correction encoding section adapted to apply erasure correction coding to the arranged information data using the parity check polynomial and to generate the parity packets, D a # k, 1, 1 + D a # k, 1, 2 + ⋯ + D a # k, 1, L ⁢ 1 ⁢ k + 1 ⁢ X 1 D + D a # k, 2, 1 + D a # k, 2, 2 + ⋯ + D a # k, 2, L ⁢ 2 ⁢ k + 1 ⁢ X 2 D + ⋯ + D a # k, q - 1, 1 + D a # k, q - 1, 2 + ⋯ + D a # k, q - 1, Lq - 1 ⁢ k + 1 ⁢ X q - 1 D + D a # k, 1 + D a # k, 2 + ⋯ + D a # k, Lk + 1 ⁢ P D = 0 where each of X 1, X 2,... X q-1 is a polynomial representation of the arranged information data; P is a polynomial representation of parities that is a component of the parity packets; D is a delay operator; and each of a#k,x,y and b#k,y, k=1, 2, 3,..., g, is an order of the parity check polynomial of equation 1, wherein the constraint length Kmax=a max +1, where a max is the maximum value of a#k,x,y and b#k,y. an arranging section adapted to arrange information data which are included in a plurality of n of said information packets into a plurality of information blocks so that, in each information block, Kmax×(q-1) pieces of information data which constitute a sequence of consecutive items of the arranged information data are formed with information data included in n different information packets n ≥ k max ×(q-1), wherein Kmax is the constraint length of a parity check polynomial of equation 1 of a low-density parity-check convolutional code and (q-1) is the numerator of the coding rate (q-1)/q of the parity check polynomial; and an erasure correction encoding section adapted to apply erasure correction coding to the arranged information data using the parity check polynomial and to generate the parity packets, D a # k, 1, 1 + D a # k, 1, 2 + ⋯ + D a # k, 1, L ⁢ 1 ⁢ k + 1 ⁢ X 1 D + D a # k, 2, 1 + D a # k, 2, 2 + ⋯ + D a # k, 2, L ⁢ 2 ⁢ k + 1 ⁢ X 2 D + ⋯ + D a # k, q - 1, 1 + D a # k, q - 1, 2 + ⋯ + D a # k, q - 1, Lq - 1 ⁢ k + 1 ⁢ X q - 1 D + D a # k, 1 + D a # k, 2 + ⋯ + D a # k, Lk + 1 ⁢ P D = 0 where each of X 1, X 2,... X q-1 is a polynomial representation of the arranged information data; P is a polynomial representation of parities that is a component of the parity packets; D is a delay operator; and each of a#k,x,y and b#k,y, k=1, 2, 3,..., g, is an order of the parity check polynomial of equation 1, wherein the constraint length Kmax=a max +1, where a max is the maximum value of a#k,x,y and b#k,y.