Patent ID: 8751914

Claim:
An encoding method associating p redundancy data bits with k information data bits to determine code words with a block length of n=p+k data bits, the code words being of tail-biting trellis low density parity check type, said method comprising the steps: implementing a degree distribution profile of n data bits defining a base code word comprising multiple replicas of the n data bits with respect to the degree distribution, the base code word being represented by a two-state trellis formed of sections with positions accommodating data bits of the base code word whereby the number of positions of a section is denoted as the degree of the section, making a partition of the base code word trellis into p intersecting regular parts of triple sections representing p parity check equations, arranging the base code word data bits into the positions of the two-state trellis with respect to the degree of the sections and of the data bits as well as pre-determined permutation rules, successively recovering the values of all unknown redundancy data bits, one regular part of triple section after another, using a redundancy data bit value as a known value after being recovered from previous regular parts of triple sections.