{"id":"https://openalex.org/W2090721735","doi":"https://doi.org/10.1109/isit.2013.6620201","title":"Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes","display_name":"Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2090721735","doi":"https://doi.org/10.1109/isit.2013.6620201","mag":"2090721735"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620201","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620201","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1301.6231","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024013562","display_name":"Alexander Zeh","orcid":"https://orcid.org/0000-0002-5044-4940"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Zeh","raw_affiliation_strings":["Institute of Communications Engineering, Ulm University, Ulm, Germany","Institute of Communication Engineering, Ulm University, Ulm, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Communications Engineering, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Institute of Communication Engineering, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041962883","display_name":"Antonia Wachter-Zeh","orcid":"https://orcid.org/0000-0002-5174-1947"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Antonia Wachter-Zeh","raw_affiliation_strings":["Institute of Communications Engineering, Ulm University, Ulm, Germany","Institute of Communication Engineering, Ulm University, Ulm, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Communications Engineering, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Institute of Communication Engineering, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037486046","display_name":"Maximilien Gadouleau","orcid":"https://orcid.org/0000-0003-4701-738X"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Maximilien Gadouleau","raw_affiliation_strings":["School of Engineering & Computing Sciences (ECS), Durham University, Durham, UK","Sch. of Eng. & Comput. Sci. (ECS), Durham Univ., Durham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering & Computing Sciences (ECS), Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"Sch. of Eng. & Comput. Sci. (ECS), Durham Univ., Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087480596","display_name":"Sergey Bezzateev","orcid":"https://orcid.org/0000-0002-0924-6221"},"institutions":[{"id":"https://openalex.org/I130523015","display_name":"Saint Petersburg State University of Aerospace and Instrumentation","ror":"https://ror.org/02rsxaa93","country_code":"RU","type":"education","lineage":["https://openalex.org/I130523015"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Sergey Bezzateev","raw_affiliation_strings":["Airspace Instrumentation, Saint Petersburg State University, Saint Petersburg, Russia","St. Petersburg State Univ. of Airspace Instrum., St. Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Airspace Instrumentation, Saint Petersburg State University, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I130523015"]},{"raw_affiliation_string":"St. Petersburg State Univ. of Airspace Instrum., St. Petersburg, Russia","institution_ids":["https://openalex.org/I130523015"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9208,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.91733661,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"126","last_page":"130"},"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.9969000220298767,"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/T10849","display_name":"Finite Group Theory Research","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.8212946653366089},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7156031727790833},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.6072281002998352},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.606021523475647},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5972546339035034},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5828314423561096},{"id":"https://openalex.org/keywords/cyclic-redundancy-check","display_name":"Cyclic redundancy check","score":0.55255526304245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5359545350074768},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.524089515209198},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46568670868873596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4130195379257202},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4116692841053009},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3368704915046692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31208473443984985},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.30529648065567017},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2086470127105713}],"concepts":[{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.8212946653366089},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7156031727790833},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6072281002998352},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.606021523475647},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5972546339035034},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5828314423561096},{"id":"https://openalex.org/C137627569","wikidata":"https://www.wikidata.org/wiki/Q245471","display_name":"Cyclic redundancy check","level":3,"score":0.55255526304245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5359545350074768},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.524089515209198},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46568670868873596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4130195379257202},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4116692841053009},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3368704915046692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31208473443984985},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.30529648065567017},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2086470127105713},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"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},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/isit.2013.6620201","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620201","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:16648","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/16648/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"(2013). International Symposium on Information Theory Proceedings (ISIT 2013), 7-12 July 2013, Istanbul, Turkey ; proceedings. New York, USA: IEEE, pp. 126-130, IEEE International Symposium on Information Theory","raw_type":"Book chapter"},{"id":"pmh:oai:arXiv.org:1301.6231","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1301.6231","pdf_url":"https://arxiv.org/pdf/1301.6231","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.759.7868","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.759.7868","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1206.4976.pdf","raw_type":"text"},{"id":"pmh:oai:durham-repository.worktribe.com:1156554","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1156554","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1301.6231","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1301.6231","pdf_url":"https://arxiv.org/pdf/1301.6231","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W287165575","https://openalex.org/W1606480398","https://openalex.org/W1966866380","https://openalex.org/W1995527419","https://openalex.org/W1998064108","https://openalex.org/W2002343488","https://openalex.org/W2004970940","https://openalex.org/W2016833807","https://openalex.org/W2034734223","https://openalex.org/W2039541047","https://openalex.org/W2065465262","https://openalex.org/W2071184318","https://openalex.org/W2073685531","https://openalex.org/W2083774980","https://openalex.org/W2096641276","https://openalex.org/W2130592450","https://openalex.org/W2138653745","https://openalex.org/W2143717559","https://openalex.org/W2152540005","https://openalex.org/W2158558186","https://openalex.org/W2162118201","https://openalex.org/W2162442687","https://openalex.org/W3216147140","https://openalex.org/W6804434002"],"related_works":["https://openalex.org/W3094984211","https://openalex.org/W1583363046","https://openalex.org/W4243304385","https://openalex.org/W1494826732","https://openalex.org/W2241204004","https://openalex.org/W2022735490","https://openalex.org/W1974822016","https://openalex.org/W1872160328","https://openalex.org/W2090721735","https://openalex.org/W2514652824"],"abstract_inverted_index":{"Two":[0],"generalizations":[1],"of":[2,11,67],"the":[3,8,24,60,69],"Hartmann-Tzeng":[4],"(HT)":[5],"bound":[6,42,56],"on":[7],"minimum":[9],"distance":[10],"q-ary":[12],"cyclic":[13,26,30,73],"codes":[14],"are":[15],"proposed.":[16],"The":[17,54],"first":[18],"one":[19],"is":[20,43,57,62],"proven":[21],"by":[22],"embedding":[23,68],"given":[25],"code":[27,70,75],"into":[28,71],"a":[29,48,72],"product":[31,74],"code.":[32],"Furthermore,":[33],"we":[34],"show":[35],"that":[36],"unique":[37],"decoding":[38,52],"up":[39],"to":[40,79],"this":[41],"always":[44],"possible":[45],"and":[46,59,83],"outline":[47],"quadratic-time":[49],"syndrome-based":[50],"error":[51],"algorithm.":[53],"second":[55],"stronger":[58],"proof":[61],"more":[63],"involved.":[64],"Our":[65],"technique":[66],"can":[76],"be":[77],"applied":[78],"other":[80],"bounds,":[81],"too":[82],"therefore":[84],"generalizes":[85],"them.":[86]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}