{"id":"https://openalex.org/W2147228450","doi":"https://doi.org/10.1109/icc.2009.5305944","title":"Improving the Performance of LP Decoders for Cyclic Codes","display_name":"Improving the Performance of LP Decoders for Cyclic Codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2147228450","doi":"https://doi.org/10.1109/icc.2009.5305944","mag":"2147228450"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2009.5305944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5305944","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","raw_type":"proceedings-article"},"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/A5020448384","display_name":"Manouchehr Heidarpour","orcid":"https://orcid.org/0000-0002-2007-3544"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. R. Heidarpour","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Department of Electrical and computer engineering, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Department of Electrical and computer engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083836126","display_name":"Mahmoud Modarres-Hashemi","orcid":"https://orcid.org/0000-0001-8318-8915"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Modarres-Hashemi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Department of Electrical and computer engineering, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Department of Electrical and computer engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090381199","display_name":"Mohammadali Khosravifard","orcid":"https://orcid.org/0000-0002-0645-7285"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Khosravifard","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Department of Electrical and computer engineering, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]},{"raw_affiliation_string":"Department of Electrical and computer engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035133764","display_name":"T. Aaron Gulliver","orcid":"https://orcid.org/0000-0001-9919-0323"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"T. A. Gulliver","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada","Dept. of Electrical & Computer Engineering, University of Victoria, Victoria, BC Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"Dept. of Electrical & Computer Engineering, University of Victoria, Victoria, BC Canada#TAB#","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2169021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"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/decoding-methods","display_name":"Decoding methods","score":0.801675021648407},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.7226715087890625},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6106194257736206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6011614799499512},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.583527147769928},{"id":"https://openalex.org/keywords/cyclic-redundancy-check","display_name":"Cyclic redundancy check","score":0.5734050273895264},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.546055257320404},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5386502742767334},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.5289385914802551},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.525205671787262},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5185506939888},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.511849582195282},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4143518805503845},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4121174216270447},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3395427167415619},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3192484378814697},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.19283738732337952}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.801675021648407},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.7226715087890625},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6106194257736206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6011614799499512},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.583527147769928},{"id":"https://openalex.org/C137627569","wikidata":"https://www.wikidata.org/wiki/Q245471","display_name":"Cyclic redundancy check","level":3,"score":0.5734050273895264},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.546055257320404},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5386502742767334},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.5289385914802551},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.525205671787262},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5185506939888},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.511849582195282},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4143518805503845},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4121174216270447},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3395427167415619},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3192484378814697},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.19283738732337952},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2009.5305944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5305944","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1530912015","https://openalex.org/W1588943481","https://openalex.org/W1594652978","https://openalex.org/W1875056259","https://openalex.org/W2033546746","https://openalex.org/W2040075573","https://openalex.org/W2083917443","https://openalex.org/W2129429545","https://openalex.org/W2140459655","https://openalex.org/W2142414818","https://openalex.org/W2158665129","https://openalex.org/W2169134868","https://openalex.org/W2170915934","https://openalex.org/W2951867507","https://openalex.org/W2952346284","https://openalex.org/W2962897197","https://openalex.org/W6635197353","https://openalex.org/W6639344520","https://openalex.org/W6660180045"],"related_works":["https://openalex.org/W2350442631","https://openalex.org/W2367967120","https://openalex.org/W2883494139","https://openalex.org/W1976246211","https://openalex.org/W2032703617","https://openalex.org/W1978153242","https://openalex.org/W3087284767","https://openalex.org/W2048537153","https://openalex.org/W2604046794","https://openalex.org/W2157945138"],"abstract_inverted_index":{"Recently,":[0],"a":[1,21,48,85],"linear":[2,11],"programming":[3],"(LP)":[4],"decoder":[5,19],"has":[6,20],"been":[7],"introduced":[8],"for":[9,51,92],"binary":[10],"codes.":[12],"Although":[13],"the":[14,25,28,35,39,60,68,72,79,101,104],"performance":[15],"of":[16,27,38,62,71,103],"an":[17],"LP":[18,52,93],"close":[22],"relationship":[23],"with":[24,34],"form":[26,50,88],"parity":[29,80],"check":[30,81],"matrix":[31,82],"(or":[32],"equivalently":[33],"Tanner":[36],"graph)":[37],"code,":[40],"there":[41],"is":[42,90],"no":[43],"clear":[44],"approach":[45],"to":[46,77],"choosing":[47],"suitable":[49,91],"decoding.":[53,94],"In":[54],"this":[55],"paper,":[56],"we":[57],"focus":[58],"on":[59],"class":[61],"cyclic":[63,69],"codes,":[64],"and":[65,83],"show":[66],"that":[67],"structure":[70],"code":[73],"can":[74],"be":[75],"used":[76],"expand":[78],"obtain":[84],"low":[86],"redundancy":[87],"which":[89,99],"Performance":[95],"results":[96],"are":[97],"given":[98],"demonstrate":[100],"effectiveness":[102],"proposed":[105],"algorithm.":[106]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}