{"id":"https://openalex.org/W2269725091","doi":null,"title":"Design and Decoding of a Serial Concatenated Code Structure based on Quasi-Cyclic LDPC Codes","display_name":"Design and Decoding of a Serial Concatenated Code Structure based on Quasi-Cyclic LDPC Codes","publication_year":2006,"publication_date":"2006-04-03","ids":{"openalex":"https://openalex.org/W2269725091","mag":"2269725091"},"language":"en","primary_location":{"id":"mag:2269725091","doi":null,"is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/document/5755955/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on","raw_type":null},"volume":null,"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086933979","display_name":"Jean\u2010Baptiste Dor\u00e9","orcid":"https://orcid.org/0000-0001-6673-5876","observed_orcids":["https://orcid.org/0000-0001-6673-5876"]},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean\u2010Baptiste Dor\u00e9","raw_affiliation_strings":["France Telecom, Research and Development division, 4 rue du Clos Courtel 35512 Cesson-S\u00e9vign\u00e9, France"],"raw_orcid":"https://orcid.org/0000-0001-6673-5876","affiliations":[{"raw_affiliation_string":"France Telecom, Research and Development division, 4 rue du Clos Courtel 35512 Cesson-S\u00e9vign\u00e9, France","institution_ids":["https://openalex.org/I19370010"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110212304","display_name":"Marie\u2010H\u00e9l\u00e8ne Hamon","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marie\u2010H\u00e9l\u00e8ne Hamon","raw_affiliation_strings":["France Telecom, Research and Development division, 4 rue du Clos Courtel 35512 Cesson-S\u00e9vign\u00e9, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"France Telecom, Research and Development division, 4 rue du Clos Courtel 35512 Cesson-S\u00e9vign\u00e9, France","institution_ids":["https://openalex.org/I19370010"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086814984","display_name":"Pierre Penard","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pierre Penard","raw_affiliation_strings":["France Telecom, Research and Development division, 4 rue du Clos Courtel 35512 Cesson-S\u00e9vign\u00e9, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"France Telecom, Research and Development division, 4 rue du Clos Courtel 35512 Cesson-S\u00e9vign\u00e9, France","institution_ids":["https://openalex.org/I19370010"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I19370010"],"apc_list":null,"apc_paid":null,"fwci":0.6987,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69385215,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/serially-concatenated-codes","display_name":"serially concatenated codes","score":0.9150000214576721},{"id":"https://openalex.org/keywords/quasi-cyclic-ldpc-codes","display_name":"quasi-cyclic LDPC codes","score":0.9739999771118164},{"id":"https://openalex.org/keywords/structured-ldpc-codes","display_name":"structured LDPC codes","score":0.8410000205039978},{"id":"https://openalex.org/keywords/belief-propagation-decoding","display_name":"belief propagation decoding","score":0.734000027179718},{"id":"https://openalex.org/keywords/decoding-complexity","display_name":"decoding complexity","score":0.859000027179718},{"id":"https://openalex.org/keywords/convergence-analysis","display_name":"convergence analysis","score":0.7269999980926514}],"concepts":[{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.804754376411438},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8026716709136963},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.7508857846260071},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.6742953658103943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6182124614715576},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.553781270980835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5103763937950134},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4623367488384247},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4420897960662842},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4271453619003296},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.41606268286705017},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.31236201524734497},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06417298316955566},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2269725091","doi":null,"is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/document/5755955/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2382259723","https://openalex.org/W2391749631","https://openalex.org/W2189211858","https://openalex.org/W2012354853","https://openalex.org/W7095670278","https://openalex.org/W7100301393","https://openalex.org/W2166605812","https://openalex.org/W2351630875","https://openalex.org/W2030787002","https://openalex.org/W2042642577"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"introduce":[4],"a":[5],"new":[6],"serially":[7],"concatenated":[8],"code":[9,40],"structure,":[10],"based":[11],"on":[12],"Quasi-Cyclic":[13],"(QC)":[14],"codes.":[15],"This":[16],"structure":[17],"can":[18],"be":[19],"viewed":[20],"as":[21],"LDPC":[22,32],"codes,":[23],"and":[24,42,69],"benefits":[25],"from":[26,53],"the":[27,76],"advantages":[28],"of":[29,50,66],"structured":[30],"QC":[31],"codes:":[33],"simple":[34],"characterization,":[35],"good":[36],"performance":[37],"for":[38],"moderate":[39],"length":[41],"efficient":[43],"implementation.":[44],"These":[45],"codes":[46],"enable":[47],"different":[48],"types":[49],"decoding":[51,59,78],"algorithms,":[52],"classical":[54],"Belief":[55],"Propagation":[56],"to":[57,74],"Turbo-Like":[58],"algorithms.":[60],"A":[61],"joint":[62],"analysis,":[63],"in":[64],"terms":[65],"complexity,":[67],"convergence":[68],"performance,":[70],"has":[71],"been":[72],"performed":[73],"determine":[75],"best":[77],"choice.":[79]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-26T11:51:55.731654","created_date":"2016-06-24T00:00:00"}