{"id":"https://openalex.org/W2129124246","doi":"https://doi.org/10.1109/isit.2006.261871","title":"Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices","display_name":"Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W2129124246","doi":"https://doi.org/10.1109/isit.2006.261871","mag":"2129124246"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2006.261871","doi":"https://doi.org/10.1109/isit.2006.261871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2006.261871","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"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/A5058481417","display_name":"E.M. Gabidulin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I153845743","display_name":"Moscow Institute of Physics and Technology","ror":"https://ror.org/00v0z9322","country_code":"RU","type":"education","lineage":["https://openalex.org/I153845743"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Ernst Gabidulin","raw_affiliation_strings":["Moscow Institute of Physics and Technology, Moscow, Russia","[Moscow Institute of Physics, and Technology, Moscow, Russia. Email: gab@mail.mipt.ru]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Moscow Institute of Physics and Technology, Moscow, Russia","institution_ids":["https://openalex.org/I153845743"]},{"raw_affiliation_string":"[Moscow Institute of Physics, and Technology, Moscow, Russia. Email: gab@mail.mipt.ru]","institution_ids":["https://openalex.org/I153845743"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029916990","display_name":"Abdolhosein Moinian","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Abdi Moinian","raw_affiliation_strings":["Department of Communications Systems, Lancaster University, UK","Department of Communications Systems, Lancaster University, United Kingdom. Email: a.moinian@lancaster.ac.uk"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communications Systems, Lancaster University, UK","institution_ids":["https://openalex.org/I67415387"]},{"raw_affiliation_string":"Department of Communications Systems, Lancaster University, United Kingdom. Email: a.moinian@lancaster.ac.uk","institution_ids":["https://openalex.org/I67415387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111860929","display_name":"Bahram Honary","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bahram Honary","raw_affiliation_strings":["Department of Communications Systems, Lancaster University, UK","Department of Communications Systems, Lancaster University, United Kingdom. Email: b.honary@lancaster.ac.uk"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communications Systems, Lancaster University, UK","institution_ids":["https://openalex.org/I67415387"]},{"raw_affiliation_string":"Department of Communications Systems, Lancaster University, United Kingdom. Email: b.honary@lancaster.ac.uk","institution_ids":["https://openalex.org/I67415387"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3974,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.81845561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"679","last_page":"683"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9976000189781189,"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.9976000189781189,"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":0.0017999999690800905,"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":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"}}],"keywords":[{"id":"https://openalex.org/keywords/regular-ldpc-codes","display_name":"regular LDPC codes","score":0.8870000243186951},{"id":"https://openalex.org/keywords/quasi-cyclic-codes","display_name":"quasi-cyclic codes","score":0.9210000038146973},{"id":"https://openalex.org/keywords/permutation-matrix","display_name":"permutation matrices","score":0.9629999995231628},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.718999981880188},{"id":"https://openalex.org/keywords/iterative-decoding","display_name":"iterative decoding","score":0.824999988079071},{"id":"https://openalex.org/keywords/code-construction","display_name":"code construction","score":0.6079999804496765}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8952656984329224},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5869439244270325},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5814537405967712},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5579831600189209},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5498546957969666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5449153780937195},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5053697228431702},{"id":"https://openalex.org/C84140500","wikidata":"https://www.wikidata.org/wiki/Q851512","display_name":"Permutation matrix","level":3,"score":0.504513144493103},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.48034369945526123},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.42003703117370605},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3617275655269623},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3573165237903595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3438981771469116},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2006.261871","doi":"https://doi.org/10.1109/isit.2006.261871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2006.261871","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1534925464","https://openalex.org/W1973712217","https://openalex.org/W1995875735","https://openalex.org/W2041404167","https://openalex.org/W2071304218","https://openalex.org/W2103495212","https://openalex.org/W2114869758","https://openalex.org/W2119990840","https://openalex.org/W2127490352","https://openalex.org/W2130255084","https://openalex.org/W2133068391","https://openalex.org/W2135764410","https://openalex.org/W2137813581","https://openalex.org/W2138998946"],"related_works":["https://openalex.org/W2008581482","https://openalex.org/W7154853135","https://openalex.org/W2026580688","https://openalex.org/W2782797790","https://openalex.org/W1964116215","https://openalex.org/W1526609637","https://openalex.org/W2171899200","https://openalex.org/W2159201958","https://openalex.org/W2384315780","https://openalex.org/W2039041162"],"abstract_inverted_index":{"A":[0],"new":[1,83],"approach":[2],"is":[3,33,59],"proposed":[4],"for":[5],"constructing":[6],"regular":[7,27],"low-density":[8],"parity-check":[9],"(LDPC)":[10],"codes":[11,29,36,75,86,123,137],"based":[12],"on":[13],"tensor":[14],"product":[15],"of":[16,26,45,73,78,93,100,110,121],"matrices.":[17],"In":[18],"this":[19],"paper,":[20],"first":[21],"a":[22,38,65,70,90,97],"general":[23],"construction":[24,80],"method":[25],"LDPC":[28,74,85,108,136],"exploiting":[30],"permutation":[31],"matrices":[32,109],"described.":[34],"Constructed":[35],"have":[37],"quasi-cyclic":[39],"structure":[40],"with":[41,129],"no":[42],"short":[43],"cycles":[44],"length":[46],"4":[47],"in":[48],"their":[49],"Tanner":[50],"graph,":[51],"hence":[52],"simple":[53],"encoding":[54],"while":[55],"maintaining":[56],"good":[57],"performance":[58],"achieved.":[60],"The":[61,82],"paper":[62],"also":[63],"demonstrates":[64],"generalized":[66,84],"design,":[67],"which":[68],"covers":[69],"large":[71,98],"family":[72],"and":[76,95,103,114],"number":[77,92],"other":[79,130],"methods.":[81],"are":[87],"defined":[88],"by":[89],"small":[91],"parameters":[94],"cover":[96],"set":[99],"code":[101],"lengths":[102],"rates.":[104],"Using":[105],"these":[106,122],"codes,":[107],"any":[111],"column":[112],"weight":[113,116],"row":[115],"can":[117],"be":[118],"constructed.":[119],"Performance":[120],"under":[124],"iterative":[125],"decoding":[126],"compares":[127],"well":[128,133],"well-structured":[131],"as":[132,134],"random":[135]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}