http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2009034561-A2
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_8cc224c7775fc6469e9151f8988ae4d7 http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_481648b910607c5dcbe4ba1c7a2b84a8 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H03M13-118 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H03M13-3938 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H03M13-11 |
| filingDate | 2008-09-15-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_5f38705a4dd663d064b58d30640c83de |
| publicationDate | 2009-03-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | WO-2009034561-A2 |
| titleOfInvention | Encoding method and device for tail-biting trellis ldpc codes |
| abstract | Encoding method ( I ) and device associating p redundancy data bits with Ic information data bits to determine code words with a block length of n = p+k data bits. The code words are of tail-biting trellis low density parity check type. The method and the device implement a degree distribution profile of the n data bits defining a base code word including multiple replicas of the n data bits with respect to the degree distribution. This base code is represented by a two- states trellis formed of sections with positions accommodating data bits of the base code whereby the number of positions of a section is denoted as the degree of the section. The method and the device makes (2) a partition of the base code trellis into p intersecting regular parts of triple sections representing p parity check equations. |
| priorityDate | 2007-09-14-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 17.