Patent ID: 6346897
Filing Date: 2002-02-12
Classification: H03M

Abstract:
A method for mapping 2N message N-tuples into 2N+1 codeword (N+1)-tuples, wherein each of said N-tuples and (N+1)-tuples is a binary code comprised of bits, 0 and 1, comprising the steps of:(a) categorizing the 2N+1 codeword (N+1)-tuples into M subsets of codeword (N+1)-tuples, wherein M is an integer larger than 1, each subset G has NG codeword (N+1)-tuples, NG being a positive integer, and the total number of codeword (N+1)-tuples in the M subsets is 2N given as follows: &Sum;G=1M&it;NG=2N,â€ƒwherein said each subset G has a predetermined number KG of lower bits and a predetermined number (N+1âˆ’KG) of higher bits and the number of lower bits in every codeword (N+1)-tuple in any subset is not equivalent to that of lower bits in every codeword (N+1)-tuple in any other sutset; and (b) matching said 2N message N-tuples with said 2N codeword (N+1)-tuples in said M subsets, respectively, in one-to-one correspondence to generate a lookup table.