An encoding method comprising generating an encoded sequence comprising: n-1 information sequences denoted as X 1 through X n-1; and a parity sequence denoted as P, by encoding the n-1 information sequences at a (n-1)/n coding rate according to a predetermined parity check matrix having m×z rows and n×m×z columns, n being an integer no less than two, m being an even number no less than two, and z being a natural number, wherein the predetermined parity check matrix is a first parity check matrix or a second parity check matrix, the first parity check matrix corresponding to a low-density parity check convolutional code using a plurality of parity check polynomials and using a tail-biting scheme, the second parity check matrix generated by performing at least one of row permutation and column permutation with respect to the first parity check matrix, and for all e being an integer greater than or equal to zero and less than or equal to m × z - 1 and satisfying e ≠ α - 1, where α is 1, an eth parity check polynomial that satisfies zero, of the low-density parity check convolutional code, where the (e+1)th row of the first parity check matrix corresponds to the eth parity check polynomial, is expressed as D b 1, i + 1 P D + ∑ k = 1 n − 1 1 + ∑ j = 1 r k, i D a k, i, j X k D = 0 where i is a variable denoting an integer that is no less than zero and no greater than m - 1 and satisfies i = e%m, where % denotes a modulo operator, and b 1,i is a natural number, and an (α - 1)th parity check polynomial that satisfies zero, of the low-density parity check convolutional code, where the αth row of the first parity check matrix corresponds to the (α-1)th parity check polynomial, is expressed as P D + ∑ k = 1 n − 1 1 + ∑ j = 1 r k, α − 1 % m D a k, α − 1 % m, j X k D = 0 where, in Math. 1 and Math. 2, k denotes an integer no less than one and no greater than n-1, j denotes an integer no less than one and no greater than r k,i, and r k,i denotes an integer no less than two, D denotes a delay operator, X k denotes a polynomial representation of an information sequence X k among the n-1 information sequences, and P denotes a polynomial representation of the parity sequence P, and a k,i,j denotes a natural number, and when x and y are integers no less than one and no greater than r k,i and satisfy x ≠ y, a k,i,x ≠ a k,i,y holds true for all x and y, and Maths. 1 and 2 satisfy a first condition and a second condition, the first condition being that, given s being an integer no less than one and no greater than n - 1, and v s,1 and v s,2 being integers less than m, a s,i,1 %m = v s,1 and a s,i,2 %m = v s,2 hold true for all s and all i, and the second condition being that for all integer values of s no less than one and no greater than n - 1, v s,1 and v s,2 are odd numbers. generating an encoded sequence comprising: n-1 information sequences denoted as X 1 through X n-1; and a parity sequence denoted as P, by encoding the n-1 information sequences at a (n-1)/n coding rate according to a predetermined parity check matrix having m×z rows and n×m×z columns, n being an integer no less than two, m being an even number no less than two, and z being a natural number, wherein the predetermined parity check matrix is a first parity check matrix or a second parity check matrix, the first parity check matrix corresponding to a low-density parity check convolutional code using a plurality of parity check polynomials and using a tail-biting scheme, the second parity check matrix generated by performing at least one of row permutation and column permutation with respect to the first parity check matrix, and for all e being an integer greater than or equal to zero and less than or equal to m × z - 1 and satisfying e ≠ α - 1, where α is 1, an eth parity check polynomial that satisfies zero, of the low-density parity check convolutional code, where the (e+1)th row of the first parity check matrix corresponds to the eth parity check polynomial, is expressed as D b 1, i + 1 P D + ∑ k = 1 n − 1 1 + ∑ j = 1 r k, i D a k, i, j X k D = 0 where i is a variable denoting an integer that is no less than zero and no greater than m - 1 and satisfies i = e%m, where % denotes a modulo operator, and b 1,i is a natural number, and an (α - 1)th parity check polynomial that satisfies zero, of the low-density parity check convolutional code, where the αth row of the first parity check matrix corresponds to the (α-1)th parity check polynomial, is expressed as P D + ∑ k = 1 n − 1 1 + ∑ j = 1 r k, α − 1 % m D a k, α − 1 % m, j X k D = 0 where, in Math. 1 and Math. 2, k denotes an integer no less than one and no greater than n-1, j denotes an integer no less than one and no greater than r k,i, and r k,i denotes an integer no less than two, D denotes a delay operator, X k denotes a polynomial representation of an information sequence X k among the n-1 information sequences, and P denotes a polynomial representation of the parity sequence P, and a k,i,j denotes a natural number, and when x and y are integers no less than one and no greater than r k,i and satisfy x ≠ y, a k,i,x ≠ a k,i,y holds true for all x and y, and Maths. 1 and 2 satisfy a first condition and a second condition, the first condition being that, given s being an integer no less than one and no greater than n - 1, and v s,1 and v s,2 being integers less than m, a s,i,1 %m = v s,1 and a s,i,2 %m = v s,2 hold true for all s and all i, and the second condition being that for all integer values of s no less than one and no greater than n - 1, v s,1 and v s,2 are odd numbers.