{"id":"https://openalex.org/W2091486852","doi":"https://doi.org/10.1109/isita.2010.5649592","title":"An algorithm for new lower bound of minimum distance by DFT for cyclic codes","display_name":"An algorithm for new lower bound of minimum distance by DFT for cyclic codes","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2091486852","doi":"https://doi.org/10.1109/isita.2010.5649592","mag":"2091486852"},"language":"en","primary_location":{"id":"doi:10.1109/isita.2010.5649592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isita.2010.5649592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Symposium On Information Theory & Its Applications","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/A5101352781","display_name":"Junru Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I165830163","display_name":"Kyushu Women's University","ror":"https://ror.org/03m60k875","country_code":"JP","type":"education","lineage":["https://openalex.org/I165830163"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Junru Zheng","raw_affiliation_strings":["Faculty of Humanities, Kyushu Women's University, Fukuoka, Japan","Faculty of Humanities, Kyushu Women's University, Kitakyushu, Fukuoka, 807-8586 Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Humanities, Kyushu Women's University, Fukuoka, Japan","institution_ids":["https://openalex.org/I165830163"]},{"raw_affiliation_string":"Faculty of Humanities, Kyushu Women's University, Kitakyushu, Fukuoka, 807-8586 Japan","institution_ids":["https://openalex.org/I165830163"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052575018","display_name":"Takayasu Kaida","orcid":null},"institutions":[{"id":"https://openalex.org/I916559398","display_name":"Kindai University","ror":"https://ror.org/05kt9ap64","country_code":"JP","type":"education","lineage":["https://openalex.org/I916559398"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takayasu Kaida","raw_affiliation_strings":["Faculty of Humanity-Oriented Science and Engineering, Kinki University, Fukuoka, Japan","Faculty of Humanity-Oriented Science and Engineering, Kinki University, Iizuka, Fukuoka, 820-8555 Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Humanity-Oriented Science and Engineering, Kinki University, Fukuoka, Japan","institution_ids":["https://openalex.org/I916559398"]},{"raw_affiliation_string":"Faculty of Humanity-Oriented Science and Engineering, Kinki University, Iizuka, Fukuoka, 820-8555 Japan","institution_ids":["https://openalex.org/I916559398"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101352781"],"corresponding_institution_ids":["https://openalex.org/I165830163"],"apc_list":null,"apc_paid":null,"fwci":2.7063,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90964408,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"846","last_page":"849"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9976999759674072,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6423991918563843},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5925277471542358},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5900949239730835},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.5275347232818604},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5094648003578186},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5003581047058105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4852454662322998},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.4619904160499573},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.4251527786254883},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4137304425239563},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41365617513656616},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3763827085494995},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3597243130207062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3253953456878662},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.3245307207107544},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.32138723134994507},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.1664581298828125},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12251549959182739},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.07392764091491699}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6423991918563843},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5925277471542358},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5900949239730835},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.5275347232818604},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5094648003578186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5003581047058105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4852454662322998},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.4619904160499573},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.4251527786254883},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4137304425239563},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41365617513656616},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3763827085494995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3597243130207062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3253953456878662},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.3245307207107544},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.32138723134994507},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.1664581298828125},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12251549959182739},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.07392764091491699},{"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/isita.2010.5649592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isita.2010.5649592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Symposium On Information Theory & Its Applications","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":12,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1984592100","https://openalex.org/W1990284793","https://openalex.org/W2004970940","https://openalex.org/W2039541047","https://openalex.org/W2105996438","https://openalex.org/W2112416059","https://openalex.org/W2114987882","https://openalex.org/W2131393783","https://openalex.org/W2162118201","https://openalex.org/W2186989661","https://openalex.org/W6636396655"],"related_works":["https://openalex.org/W1998728561","https://openalex.org/W645598334","https://openalex.org/W2135099985","https://openalex.org/W2161553934","https://openalex.org/W3042543385","https://openalex.org/W1992135520","https://openalex.org/W2183278822","https://openalex.org/W4214485061","https://openalex.org/W2044522076","https://openalex.org/W2115550046"],"abstract_inverted_index":{"For":[0],"cyclic":[1,34,58,85],"codes":[2,37,59,86],"some":[3,8,81],"well-known":[4],"lower":[5,27],"bounds":[6,17],"and":[7,38,65],"decoding":[9],"methods":[10],"up":[11],"to":[12],"the":[13,16,21,30,43,47,70,74],"half":[14],"of":[15,29,46,69,83],"are":[18,87],"suggested.":[19],"Particularly,":[20],"shift":[22,48],"bound":[23,28,49],"is":[24,50,78],"a":[25,66],"good":[26],"minimum":[31,71],"distance":[32,72],"for":[33],"codes,":[35],"Reed-Muller":[36],"geometric":[39],"Goppa":[40],"codes.":[41],"However,":[42],"computational":[44],"complexity":[45],"very":[51],"large.":[52],"In":[53],"this":[54],"paper":[55],"we":[56],"consider":[57],"defined":[60],"by":[61],"their":[62],"defining":[63],"set,":[64],"new":[67],"method":[68],"using":[73],"discrete":[75],"Fourier":[76],"transform(DFT)":[77],"shown.":[79],"Moreover":[80],"examples":[82],"binary":[84],"given.":[88]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}