{"id":"https://openalex.org/W2106682188","doi":"https://doi.org/10.1109/tit.2008.2006456","title":"Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes","display_name":"Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2106682188","doi":"https://doi.org/10.1109/tit.2008.2006456","mag":"2106682188"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2008.2006456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2006456","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0708.0905","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023360388","display_name":"Thorsten Hehn","orcid":"https://orcid.org/0000-0002-1858-0627"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Thorsten Hehn","raw_affiliation_strings":["University of Erlangen Nuremberg, Erlangen, Germany","Univ. of Erlangen- Nuremberg, Erlangen"],"affiliations":[{"raw_affiliation_string":"University of Erlangen Nuremberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Univ. of Erlangen- Nuremberg, Erlangen","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084947882","display_name":"Olgica Milenkovi\u0107","orcid":"https://orcid.org/0000-0002-1871-4912"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Olgica Milenkovic","raw_affiliation_strings":["The Everitt Laboratory, Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Electrical and Computer Engineering"],"affiliations":[{"raw_affiliation_string":"The Everitt Laboratory, Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Electrical and Computer Engineering","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047339531","display_name":"Stefan Laendner","orcid":null},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Laendner","raw_affiliation_strings":["University of Erlangen Nuremberg, Erlangen, Germany","University of Erlangen - Nuremberg, Erlangen, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Erlangen Nuremberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"University of Erlangen - Nuremberg, Erlangen, Germany#TAB#","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028217481","display_name":"Johannes B. Huber","orcid":"https://orcid.org/0000-0003-2586-5249"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Johannes B. Huber","raw_affiliation_strings":["University of Erlangen Nuremberg, Erlangen, Germany","University of Erlangen - Nuremberg, Erlangen, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Erlangen Nuremberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"University of Erlangen - Nuremberg, Erlangen, Germany#TAB#","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5023360388"],"corresponding_institution_ids":["https://openalex.org/I181369854"],"apc_list":null,"apc_paid":null,"fwci":3.8117,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.93688957,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"54","issue":"12","first_page":"5308","last_page":"5331"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","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":0.9987999796867371,"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.6366849541664124},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6334398984909058},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6246175765991211},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6205825209617615},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5922861695289612},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4449616074562073},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.43102091550827026},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.41434726119041443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4087122976779938},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.373757541179657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30958807468414307},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2803613841533661},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.11106035113334656},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.10906732082366943},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07133013010025024}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6366849541664124},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6334398984909058},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6246175765991211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6205825209617615},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5922861695289612},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4449616074562073},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.43102091550827026},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.41434726119041443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4087122976779938},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.373757541179657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30958807468414307},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2803613841533661},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.11106035113334656},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.10906732082366943},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07133013010025024},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2008.2006456","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2006456","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0708.0905","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0708.0905","pdf_url":"https://arxiv.org/pdf/0708.0905","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0708.0905","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0708.0905","pdf_url":"https://arxiv.org/pdf/0708.0905","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"score":0.5099999904632568,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W161569435","https://openalex.org/W174599562","https://openalex.org/W1606480398","https://openalex.org/W1975177438","https://openalex.org/W1998242373","https://openalex.org/W2024356427","https://openalex.org/W2052900991","https://openalex.org/W2068871408","https://openalex.org/W2070870425","https://openalex.org/W2095882513","https://openalex.org/W2097395096","https://openalex.org/W2104345270","https://openalex.org/W2104459449","https://openalex.org/W2106682188","https://openalex.org/W2115995841","https://openalex.org/W2125087461","https://openalex.org/W2138850861","https://openalex.org/W2140124864","https://openalex.org/W2140227657","https://openalex.org/W2146712900","https://openalex.org/W2151875415","https://openalex.org/W2155197892","https://openalex.org/W2166168181","https://openalex.org/W2496163386","https://openalex.org/W2504281202","https://openalex.org/W2564495413","https://openalex.org/W2942537621","https://openalex.org/W3104554114","https://openalex.org/W4244691952","https://openalex.org/W4248821906","https://openalex.org/W4249150173"],"related_works":["https://openalex.org/W1599365967","https://openalex.org/W2042522304","https://openalex.org/W1520296533","https://openalex.org/W2992200486","https://openalex.org/W2109519980","https://openalex.org/W2103800122","https://openalex.org/W2104345270","https://openalex.org/W2141877208","https://openalex.org/W2135388054","https://openalex.org/W2566690554"],"abstract_inverted_index":{"We":[0,32,91],"introduce":[1],"the":[2,5,18,28,39,62,96,129,132],"notion":[3],"of":[4,9,17,24,65,99,101,111,126,131,140],"stopping":[6,40,70],"redundancy":[7,41,71],"hierarchy":[8,42],"a":[10,15,75,115,123],"linear":[11],"block":[12],"code":[13],"as":[14],"measure":[16],"tradeoff":[19],"between":[20],"performance":[21,130],"and":[22,35,48,51,88],"complexity":[23],"iterative":[25,85],"decoding":[26,77,134],"for":[27,38,54,122],"binary":[29],"erasure":[30],"channel.":[31],"derive":[33],"lower":[34],"upper":[36],"bounds":[37,94],"via":[43],"Lovasz's":[44],"local":[45],"lemma":[46],"(LLL)":[47],"Bonferroni-type":[49],"inequalities,":[50],"specialize":[52],"them":[53],"codes":[55],"with":[56,68],"cyclic":[57],"parity-check":[58,66],"matrices.":[59],"Based":[60],"on":[61,95],"observed":[63],"properties":[64],"matrices":[67],"good":[69],"characteristics,":[72],"we":[73],"develop":[74],"novel":[76],"technique,":[78],"termed":[79],"automorphism":[80,103],"group":[81,104],"decoding,":[82],"that":[83,121,139],"combines":[84],"message":[86],"passing":[87],"permutation":[89],"decoding.":[90,143],"also":[92],"present":[93],"smallest":[97],"number":[98,125],"permutations":[100],"an":[102],"decoder":[105],"needed":[106],"to":[107,114,138],"correct":[108],"any":[109],"set":[110],"erasures":[112],"up":[113],"prescribed":[116],"size.":[117],"Simulation":[118],"results":[119],"demonstrate":[120],"large":[124],"algebraic":[127],"codes,":[128],"new":[133],"method":[135],"is":[136],"close":[137],"maximum-likelihood":[141],"(ML)":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}