{"id":"https://openalex.org/W1994883201","doi":"https://doi.org/10.1109/tit.1970.1054517","title":"On the minimum distance of certain reversible cyclic codes (Corresp.)","display_name":"On the minimum distance of certain reversible cyclic codes (Corresp.)","publication_year":1970,"publication_date":"1970-09-01","ids":{"openalex":"https://openalex.org/W1994883201","doi":"https://doi.org/10.1109/tit.1970.1054517","mag":"1994883201"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1970.1054517","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1970.1054517","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":["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/A5075016140","display_name":"K.K. Tzeng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. Tzeng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111947581","display_name":"C. Hartmann","orcid":"https://orcid.org/0009-0007-5067-589X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Hartmann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.2784,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.95981477,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"16","issue":"5","first_page":"644","last_page":"646"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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":0.9998999834060669,"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/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.9943000078201294,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9941999912261963,"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/bch-code","display_name":"BCH code","score":0.821564793586731},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.6007978320121765},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5958841443061829},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5939770936965942},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5489287376403809},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.540183961391449},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.4898364245891571},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48122289776802063},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.45022836327552795},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.4375465512275696},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.3979331851005554},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3918485641479492},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3254242539405823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30512601137161255},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.29636722803115845},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2578734755516052}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.821564793586731},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.6007978320121765},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5958841443061829},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5939770936965942},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5489287376403809},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.540183961391449},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.4898364245891571},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48122289776802063},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.45022836327552795},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.4375465512275696},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3979331851005554},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3918485641479492},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3254242539405823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30512601137161255},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.29636722803115845},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2578734755516052},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1970.1054517","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1970.1054517","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2050276241","https://openalex.org/W2064759901","https://openalex.org/W2125384099","https://openalex.org/W2142453868","https://openalex.org/W4212825216"],"related_works":["https://openalex.org/W2129090975","https://openalex.org/W4251417368","https://openalex.org/W1798117689","https://openalex.org/W1976052006","https://openalex.org/W3088883112","https://openalex.org/W2293846540","https://openalex.org/W2129012564","https://openalex.org/W2041319252","https://openalex.org/W2029212810","https://openalex.org/W3085073875"],"abstract_inverted_index":{"The":[0],"minimum":[1],"distance":[2],"of":[3,6,30,35,40,47],"a":[4],"class":[5,29,34,46],"reversible":[7],"cyclic":[8],"codes":[9,31,39,51],"has":[10],"been":[11],"proved":[12],"to":[13],"be":[14],"greater":[15],"than":[16],"that":[17,27],"given":[18],"by":[19,53],"the":[20,33,45],"BCH":[21],"bound.":[22],"It":[23],"is":[24],"also":[25],"noted":[26],"this":[28],"includes":[32],"primitive":[36],"double-error-correcting":[37,49],"binary":[38,50],"Melas":[41],"as":[42,44,55],"well":[43],"nonprimitive":[48],"discovered":[52],"Zetterberg":[54],"special":[56],"cases.":[57]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":1},{"year":2015,"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"}