......DE....FRGB....................................................................................JDIM360 Ver 2.15 (14 Jul 2008) - 1999001/01801982CORRECTED EUROPEAN PATENT APPLICATIONA9A320100728W184deBibliographieenBibliographyfrBibliographieEP07106217.82006032820100208enenen200536234020051215JP201007282010302007062720072620100728201030H03M 13/11 20060101AFI20070521BHEP deKodierer, Dekodierer, Kodier- und DekodiermethodeenEncoder, decoder, methods of encoding and decodingfrCodeur, décodeur, méthode de codage et de décodagenone06251643.0180198020060328Fujitsu Ltd.100169044P105854EP01/ECR1-1, Kamikodanaka 4-chome, Nakahara-kuKawasaki-shi, Kanagawa 211-8588JPKanaoka, Toshikazu, c/o Fujitsu Ltd.1-1, Kamikodanaka 4-chome, Nakahara-kuKawasaki-shi, Kanagawa 211-8588JPMorita, Toshihiko, c/o Fujitsu Ltd.1-1, Kamikodanaka 4-chome, Nakahara-kuKawasaki-shi, Kanagawa 211-8588JPCooper-Rolfe, Elizabeth Louise100757826Haseltine Lake LLP Lincoln House, 5th Floor 300 High HolbornLondon WC1V 7JHGBDEFRGB20090812200933

An information sequence having a code length of N (N=K+M), where K is information length and M is parity length, is encoded into a code sequence by using an LDPC code. The LDPC code is generated based on a matrix H, with M rows and N columns. The matrix H includes a check matrix H2 and a check matrix H1. The check matrix H2 has M rows and M columns, it is a cyclic permutation matrix, and an inverse matrix exists for the check matrix H2, and its column weight is 3. The check matrix H1 has M rows and K columns.