{"id":"https://openalex.org/W2131092434","doi":"https://doi.org/10.1109/dsn.2004.1311885","title":"Cyclic redundancy code (CRC) polynomial selection for embedded networks","display_name":"Cyclic redundancy code (CRC) polynomial selection for embedded networks","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2131092434","doi":"https://doi.org/10.1109/dsn.2004.1311885","mag":"2131092434"},"language":"en","primary_location":{"id":"doi:10.1109/dsn.2004.1311885","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsn.2004.1311885","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Conference on Dependable Systems and Networks, 2004","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/Cyclic_Redundancy_Code_CRC_Polynomial_Selection_For_Embedded_Networks/6621818","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036158209","display_name":"Philip Koopman","orcid":"https://orcid.org/0000-0003-1658-2386"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Koopman","raw_affiliation_strings":["ECE Department & ICES, Carnegie Mellon University, Pittsburgh, PA, USA","Dept. of Electr. & Comput. Eng., & ICES, Carnegie Mellon Univ., Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Department & ICES, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., & ICES, Carnegie Mellon Univ., Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108225858","display_name":"Tridib Chakravarty","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Chakravarty","raw_affiliation_strings":["Carnegie-Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.9867,"has_fulltext":true,"cited_by_count":343,"citation_normalized_percentile":{"value":0.97092464,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.992900013923645,"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.992900013923645,"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.9915000200271606,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9861000180244446,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cyclic-redundancy-check","display_name":"Cyclic redundancy check","score":0.8290841579437256},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.7365261316299438},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6430920362472534},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.49282029271125793},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48378345370292664},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4678906500339508},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3956409990787506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38240471482276917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25703245401382446},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1505422592163086},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.08756515383720398}],"concepts":[{"id":"https://openalex.org/C137627569","wikidata":"https://www.wikidata.org/wiki/Q245471","display_name":"Cyclic redundancy check","level":3,"score":0.8290841579437256},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.7365261316299438},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6430920362472534},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.49282029271125793},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48378345370292664},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4678906500339508},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3956409990787506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38240471482276917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25703245401382446},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1505422592163086},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.08756515383720398},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1109/dsn.2004.1311885","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsn.2004.1311885","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Conference on Dependable Systems and Networks, 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:figshare.com:article/6621818","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Cyclic_Redundancy_Code_CRC_Polynomial_Selection_For_Embedded_Networks/6621818","pdf_url":"https://figshare.com/articles/Cyclic_Redundancy_Code_CRC_Polynomial_Selection_For_Embedded_Networks/6621818","source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:repository.cmu.edu:isr-1672","is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1672&context=isr","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Institute for Software Research","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6621818","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Journal contribution"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.5027","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.5027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.cmu.edu/~koopman/roses/dsn04/koopman04_crc_poly_embedded.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.648.9080","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.648.9080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.ece.cmu.edu/~koopman/roses/dsn04/koopman04_crc_poly_embedded.pdf","raw_type":"text"},{"id":"doi:10.1184/r1/6621818.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6621818.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/6621818","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Cyclic_Redundancy_Code_CRC_Polynomial_Selection_For_Embedded_Networks/6621818","pdf_url":"https://figshare.com/articles/Cyclic_Redundancy_Code_CRC_Polynomial_Selection_For_Embedded_Networks/6621818","source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2131092434.pdf","grobid_xml":"https://content.openalex.org/works/W2131092434.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W53577213","https://openalex.org/W1555449224","https://openalex.org/W1941880258","https://openalex.org/W2021564380","https://openalex.org/W2025090670","https://openalex.org/W2064759901","https://openalex.org/W2107517680","https://openalex.org/W2145056205","https://openalex.org/W2151556710","https://openalex.org/W2156493019","https://openalex.org/W2182112064","https://openalex.org/W2942537621","https://openalex.org/W4285719527","https://openalex.org/W6682555275"],"related_works":["https://openalex.org/W4244459148","https://openalex.org/W1495013735","https://openalex.org/W2309257974","https://openalex.org/W2372948577","https://openalex.org/W2563774527","https://openalex.org/W2532632059","https://openalex.org/W2349056567","https://openalex.org/W2354468370","https://openalex.org/W1588762023","https://openalex.org/W2310391951"],"abstract_inverted_index":{"Cyclic":[0],"redundancy":[1],"codes":[2],"(CRCs)":[3],"provide":[4,22],"a":[5,68,78],"first":[6],"line":[7],"of":[8,80,86],"defense":[9],"against":[10],"data":[11,106],"corruption":[12],"in":[13,90],"many":[14,17],"networks.":[15],"Unfortunately,":[16],"commonly":[18],"used":[19],"CRC":[20,39],"polynomials":[21,40,89,96],"significantly":[23],"less":[24],"error":[25],"detection":[26],"capability":[27],"than":[28],"they":[29],"might.":[30],"An":[31],"exhaustive":[32],"exploration":[33],"reveals":[34],"that":[35],"most":[36],"previously":[37,94],"published":[38,95],"are":[41,47],"either":[42],"inferior":[43],"to":[44,62,92,102,110],"alternatives":[45],"or":[46],"only":[48],"good":[49,81,98],"choices":[50],"for":[51,72,100,105],"particular":[52],"message":[53],"lengths.":[54],"Unfortunately":[55],"these":[56],"shortcomings":[57],"and":[58,76],"limitations":[59],"often":[60],"seem":[61],"be":[63],"overlooked.":[64],"This":[65],"paper":[66],"describes":[67],"polynomial":[69],"selection":[70],"process":[71],"embedded":[73],"network":[74],"applications":[75],"proposes":[77],"set":[79,85],"general-purpose":[82],"polynomials.":[83],"A":[84],"35":[87],"new":[88],"addition":[91],"13":[93],"provides":[97],"performance":[99],"3-":[101],"16-bit":[103],"CRCs":[104],"word":[107],"lengths":[108],"up":[109],"2048":[111],"bits.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":14},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":22},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":19},{"year":2018,"cited_by_count":28},{"year":2017,"cited_by_count":23},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":23},{"year":2014,"cited_by_count":26},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":17}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}