{"id":"https://openalex.org/W2514652824","doi":"https://doi.org/10.1109/isit.2016.7541470","title":"Long cyclic codes over GF(4) and GF(8) better than BCH codes in the high-rate region","display_name":"Long cyclic codes over GF(4) and GF(8) better than BCH codes in the high-rate region","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2514652824","doi":"https://doi.org/10.1109/isit.2016.7541470","mag":"2514652824"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541470","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","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/A5074098103","display_name":"Ron M. Roth","orcid":"https://orcid.org/0000-0003-4168-9505"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Ron M. Roth","raw_affiliation_strings":["Computer Science Department, Technion, Haifa 3200003, Israel","Computer Science Department, Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion, Haifa 3200003, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Science Department, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024013562","display_name":"Alexander Zeh","orcid":"https://orcid.org/0000-0002-5044-4940"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Alexander Zeh","raw_affiliation_strings":["Computer Science Department, Technion, Haifa 3200003, Israel","Computer Science Department, Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion, Haifa 3200003, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Science Department, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074098103"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.4443,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.7942312,"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":"1103","last_page":"1107"},"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.9983000159263611,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.9449094533920288},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5799996852874756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5708003044128418},{"id":"https://openalex.org/keywords/gf","display_name":"GF(2)","score":0.5503331422805786},{"id":"https://openalex.org/keywords/cyclic-redundancy-check","display_name":"Cyclic redundancy check","score":0.5217105746269226},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5084580183029175},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.49279192090034485},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.4528464078903198},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.44165655970573425},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4118972420692444},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4065386652946472},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.398414671421051},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.377195805311203},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24851959943771362},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.219701886177063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21545597910881042},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.19936296343803406}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.9449094533920288},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5799996852874756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5708003044128418},{"id":"https://openalex.org/C156350748","wikidata":"https://www.wikidata.org/wiki/Q5513324","display_name":"GF(2)","level":3,"score":0.5503331422805786},{"id":"https://openalex.org/C137627569","wikidata":"https://www.wikidata.org/wiki/Q245471","display_name":"Cyclic redundancy check","level":3,"score":0.5217105746269226},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5084580183029175},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.49279192090034485},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.4528464078903198},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.44165655970573425},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4118972420692444},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4065386652946472},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.398414671421051},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.377195805311203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24851959943771362},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.219701886177063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21545597910881042},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.19936296343803406},{"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/isit.2016.7541470","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1974822016","https://openalex.org/W2081931693","https://openalex.org/W2100852839","https://openalex.org/W2162249882","https://openalex.org/W2169449223"],"related_works":["https://openalex.org/W2131409472","https://openalex.org/W2141158404","https://openalex.org/W3175040360","https://openalex.org/W3094984211","https://openalex.org/W4243304385","https://openalex.org/W844466527","https://openalex.org/W2241204004","https://openalex.org/W4231317703","https://openalex.org/W2090721735","https://openalex.org/W2514652824"],"abstract_inverted_index":{"An":[0],"explicit":[1],"construction":[2],"of":[3,7,24,27],"an":[4],"infinite":[5],"family":[6],"cyclic":[8],"codes":[9,26,38,42],"is":[10,52],"presented":[11],"which,":[12],"over":[13],"GF(4)":[14],"(resp.,":[15,20],"GF(8)),":[16],"have":[17],"approximately":[18],"8/9":[19],"48/49)":[21],"the":[22,28,36,40,49,55],"redundancy":[23],"BCH":[25],"same":[29],"minimum":[30,50],"distance":[31,51],"and":[32,54],"length.":[33],"As":[34],"such,":[35],"new":[37],"are":[39],"best":[41],"currently":[43],"known":[44],"in":[45],"a":[46],"regime":[47],"where":[48],"fixed":[53],"code":[56],"length":[57],"goes":[58],"to":[59],"infinity.":[60]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}