{"id":"https://openalex.org/W2041674265","doi":"https://doi.org/10.1109/tit.1968.1054233","title":"Some lower bounds on the minimum weight of cyclic codes of composite length","display_name":"Some lower bounds on the minimum weight of cyclic codes of composite length","publication_year":1968,"publication_date":"1968-11-01","ids":{"openalex":"https://openalex.org/W2041674265","doi":"https://doi.org/10.1109/tit.1968.1054233","mag":"2041674265"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1968.1054233","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1968.1054233","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/A5108359594","display_name":"Tadao Kasami","orcid":null},"institutions":[{"id":"https://openalex.org/I4210111835","display_name":"Osaka Health Science University","ror":"https://ror.org/01tvqd679","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210111835"]},{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"T. Kasami","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering Science, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I4210111835","https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108359594"],"corresponding_institution_ids":["https://openalex.org/I4210111835","https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":1.6929,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87809813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"14","issue":"6","first_page":"814","last_page":"818"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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.9998000264167786,"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.9940000176429749,"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"}},{"id":"https://openalex.org/T13779","display_name":"Cancer Mechanisms and Therapy","score":0.9490000009536743,"subfield":{"id":"https://openalex.org/subfields/2734","display_name":"Pathology and Forensic Medicine"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.8528199791908264},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.5966229438781738},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5456394553184509},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5382492542266846},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4793158769607544},{"id":"https://openalex.org/keywords/prime-factor","display_name":"Prime factor","score":0.46375635266304016},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44783854484558105},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4181232452392578},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.411064475774765},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.28750360012054443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26587414741516113},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.12973862886428833}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.8528199791908264},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.5966229438781738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5456394553184509},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5382492542266846},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4793158769607544},{"id":"https://openalex.org/C30860621","wikidata":"https://www.wikidata.org/wiki/Q49008","display_name":"Prime factor","level":3,"score":0.46375635266304016},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44783854484558105},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4181232452392578},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.411064475774765},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.28750360012054443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26587414741516113},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.12973862886428833},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1968.1054233","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1968.1054233","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1998064108","https://openalex.org/W2003085969","https://openalex.org/W2048731540","https://openalex.org/W2068933160"],"related_works":["https://openalex.org/W2039750302","https://openalex.org/W2366009615","https://openalex.org/W2171753105","https://openalex.org/W2129090975","https://openalex.org/W75215367","https://openalex.org/W3127046705","https://openalex.org/W2164604678","https://openalex.org/W2346418928","https://openalex.org/W3122286719","https://openalex.org/W4390046738"],"abstract_inverted_index":{"An":[0],"extension":[1],"of":[2,10,36,63],"Goethals'":[3],"results":[4],"[3]":[5],"is":[6],"presented.":[7],"Cyclic":[8],"codes":[9],"composite":[11],"block":[12],"length":[13],"<tex":[14,20,24],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[15,21,25],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n":[16],"=":[17],"n_{1}n_{2}</tex>":[18],"with":[19],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n_{1}</tex>":[22],"and":[23],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n_{2}</tex>":[26],"relatively":[27],"prime":[28],"are":[29,48],"considered.":[30],"By":[31],"using":[32],"a":[33,60],"modified":[34],"form":[35],"the":[37,45,55],"Mattson-Solomon":[38],"formulation":[39],"[5],":[40],"some":[41],"lower":[42,51],"bounds":[43,52],"on":[44,54],"minimum":[46],"weight":[47],"obtained.":[49],"These":[50],"improve":[53],"BCH":[56,65],"bound":[57],"[4]":[58],"for":[59],"considerable":[61],"number":[62],"nonprimitive":[64],"codes.":[66]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}