{"id":"https://openalex.org/W2003526724","doi":"https://doi.org/10.1109/isit.2013.6620387","title":"On decoding Interleaved Chinese Remainder codes","display_name":"On decoding Interleaved Chinese Remainder codes","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2003526724","doi":"https://doi.org/10.1109/isit.2013.6620387","mag":"2003526724"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620387","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/8db69eba-b117-4e8d-bd7d-fea2f8dae196","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100339851","display_name":"Wenhui Li","orcid":"https://orcid.org/0000-0001-9609-6120"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wenhui Li","raw_affiliation_strings":["Institute of Communications Engineering, Ulm University, Ulm, Germany","Institute of Communication Engineering, Ulm University, Ulm, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Communications Engineering, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Institute of Communication Engineering, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072164594","display_name":"Vladimir Sidorenko","orcid":"https://orcid.org/0000-0003-4966-3684"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vladimir Sidorenko","raw_affiliation_strings":["Institute of Communications Engineering, Ulm University, Ulm, Germany","Institute of Communication Engineering, Ulm University, Ulm, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Communications Engineering, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Institute of Communication Engineering, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042242064","display_name":"Johan Rosenkilde","orcid":"https://orcid.org/0000-0002-3540-0456"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Johan S. R. Nielsen","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Technical University of Denmark, Lyngby, Denmark","Dept. of Appl. Math. & Comput. Sci., Tech. Univ. of Denmark, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Dept. of Appl. Math. & Comput. Sci., Tech. Univ. of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9883,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81936256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9947999715805054,"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.8390612006187439},{"id":"https://openalex.org/keywords/remainder","display_name":"Remainder","score":0.8328538537025452},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.8250448703765869},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.707106351852417},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.6564782857894897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5824613571166992},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5526295304298401},{"id":"https://openalex.org/keywords/chinese-remainder-theorem","display_name":"Chinese remainder theorem","score":0.4937523305416107},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4499935209751129},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3560105562210083},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3512849807739258},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.32257601618766785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3198070526123047}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8390612006187439},{"id":"https://openalex.org/C39613435","wikidata":"https://www.wikidata.org/wiki/Q846677","display_name":"Remainder","level":2,"score":0.8328538537025452},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.8250448703765869},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.707106351852417},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.6564782857894897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5824613571166992},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5526295304298401},{"id":"https://openalex.org/C151635116","wikidata":"https://www.wikidata.org/wiki/Q193878","display_name":"Chinese remainder theorem","level":2,"score":0.4937523305416107},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4499935209751129},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3560105562210083},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3512849807739258},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.32257601618766785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3198070526123047},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2013.6620387","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/8db69eba-b117-4e8d-bd7d-fea2f8dae196","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/8db69eba-b117-4e8d-bd7d-fea2f8dae196","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li , W , Sidorenko , V & Nielsen , J S R 2013 , On Decoding Interleaved Chinese Remainder Codes . in 2013 IEEE International Symposium on Information Theory Proceedings (ISIT) . IEEE , pp. 1052-1056 , 2013 IEEE International Symposium on Information Theory , Istanbul , Turkey , 07/07/2013 . https://doi.org/10.1109/ISIT.2013.6620387","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/8db69eba-b117-4e8d-bd7d-fea2f8dae196","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/8db69eba-b117-4e8d-bd7d-fea2f8dae196","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li , W , Sidorenko , V & Nielsen , J S R 2013 , On Decoding Interleaved Chinese Remainder Codes . in 2013 IEEE International Symposium on Information Theory Proceedings (ISIT) . IEEE , pp. 1052-1056 , 2013 IEEE International Symposium on Information Theory , Istanbul , Turkey , 07/07/2013 . https://doi.org/10.1109/ISIT.2013.6620387","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1562183207","https://openalex.org/W1965918218","https://openalex.org/W1976137535","https://openalex.org/W2006272675","https://openalex.org/W2012589104","https://openalex.org/W2043216985","https://openalex.org/W2113672208","https://openalex.org/W2129270830","https://openalex.org/W2132376394","https://openalex.org/W2133789648","https://openalex.org/W2149789050","https://openalex.org/W2170389905","https://openalex.org/W2170626562"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2357077655","https://openalex.org/W2085052822"],"abstract_inverted_index":{"We":[0,73],"model":[1],"the":[2,20,32,50,66,71,75,86],"decoding":[3,27,34,77,80],"of":[4,11,52,88,97],"Interleaved":[5,107],"Chinese":[6,108],"Remainder":[7,109],"codes":[8],"as":[9],"that":[10,65],"finding":[12],"a":[13,17,46,81],"short":[14],"vector":[15],"in":[16],"Z-lattice.":[18],"Using":[19],"LLL":[21],"algorithm,":[22,28],"we":[23,55],"obtain":[24],"an":[25,57],"efficient":[26],"correcting":[29],"errors":[30],"beyond":[31],"unique":[33],"bound":[35,59,67],"and":[36,54],"having":[37],"nearly":[38],"linear":[39],"complexity.":[40],"The":[41],"algorithm":[42,78],"can":[43,101],"fail":[44],"with":[45],"probability":[47],"dependent":[48],"on":[49],"number":[51],"errors,":[53],"give":[56],"upper":[58],"for":[60,79,92],"this.":[61],"Simulation":[62],"results":[63],"indicate":[64],"is":[68],"close":[69],"to":[70,104],"truth.":[72],"apply":[74],"proposed":[76],"single":[82],"CR":[83],"code":[84],"using":[85],"idea":[87],"\u201cPower\u201d":[89],"decoding,":[90],"suggested":[91],"Reed-Solomon":[93],"codes.":[94,110],"A":[95],"combination":[96],"these":[98],"two":[99],"methods":[100],"be":[102],"used":[103],"decode":[105],"low-rate":[106]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}