{"id":"https://openalex.org/W2039750302","doi":"https://doi.org/10.1109/tit.1980.1056189","title":"On the minimum distance of some BCH codes (Corresp.)","display_name":"On the minimum distance of some BCH codes (Corresp.)","publication_year":1980,"publication_date":"1980-05-01","ids":{"openalex":"https://openalex.org/W2039750302","doi":"https://doi.org/10.1109/tit.1980.1056189","mag":"2039750302"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1980.1056189","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1980.1056189","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/A5047867702","display_name":"G\u00e9rard Cohen","orcid":null},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"G. Cohen","raw_affiliation_strings":["Ecole Nationale Superieure des Telecommunications, Paris, France"],"affiliations":[{"raw_affiliation_string":"Ecole Nationale Superieure des Telecommunications, Paris, France","institution_ids":["https://openalex.org/I12356871"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047867702"],"corresponding_institution_ids":["https://openalex.org/I12356871"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.09608216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"26","issue":"3","first_page":"363","last_page":"363"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9977999925613403,"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.9977999925613403,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9824000000953674,"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.9909793138504028},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.8510048389434814},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5548320412635803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5165590047836304},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.46581387519836426},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4374949038028717},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42365384101867676},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4135130047798157},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.34590816497802734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33326393365859985},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.331093966960907},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.3205716013908386},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3052491843700409},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23029553890228271}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.9909793138504028},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.8510048389434814},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5548320412635803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5165590047836304},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.46581387519836426},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4374949038028717},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42365384101867676},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4135130047798157},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.34590816497802734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33326393365859985},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.331093966960907},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3205716013908386},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3052491843700409},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23029553890228271}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1980.1056189","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1980.1056189","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W2032078069","https://openalex.org/W2119995058","https://openalex.org/W2153848652","https://openalex.org/W2182112064"],"related_works":["https://openalex.org/W2126089770","https://openalex.org/W1992183350","https://openalex.org/W4244153028","https://openalex.org/W2128628822","https://openalex.org/W2361034356","https://openalex.org/W2039750302","https://openalex.org/W1995527419","https://openalex.org/W2109703172","https://openalex.org/W2604280504","https://openalex.org/W1976116479"],"abstract_inverted_index":{"Some":[0],"new":[1],"examples":[2],"of":[3,8],"binary":[4],"Bose-Chaudhuri-Hocquanghen":[5],"(BCH)":[6],"codes":[7],"length":[9],"255":[10],"are":[11],"found":[12],"for":[13],"which":[14],"the":[15],"minimum":[16],"distance":[17,20],"and":[18],"designed":[19],"agree.":[21]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}