{"id":"https://openalex.org/W4401692896","doi":"https://doi.org/10.1109/isit57864.2024.10619624","title":"Algorithms for Computing the Free Distance of Convolutional Codes","display_name":"Algorithms for Computing the Free Distance of Convolutional Codes","publication_year":2024,"publication_date":"2024-07-07","ids":{"openalex":"https://openalex.org/W4401692896","doi":"https://doi.org/10.1109/isit57864.2024.10619624"},"language":"en","primary_location":{"id":"doi:10.1109/isit57864.2024.10619624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","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/A5092097474","display_name":"Zita Abreu","orcid":null},"institutions":[{"id":"https://openalex.org/I60858718","display_name":"University of Aveiro","ror":"https://ror.org/00nt41z93","country_code":"PT","type":"education","lineage":["https://openalex.org/I60858718"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Zita Abreu","raw_affiliation_strings":["University of Aveiro,Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Aveiro,Portugal","institution_ids":["https://openalex.org/I60858718"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021424383","display_name":"Joachim Rosenthal","orcid":"https://orcid.org/0000-0003-4545-3559"},"institutions":[{"id":"https://openalex.org/I202697423","display_name":"University of Zurich","ror":"https://ror.org/02crff812","country_code":"CH","type":"education","lineage":["https://openalex.org/I202697423"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Joachim Rosenthal","raw_affiliation_strings":["University of Zurich,Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Zurich,Switzerland","institution_ids":["https://openalex.org/I202697423"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063721388","display_name":"Michael Schaller","orcid":"https://orcid.org/0000-0002-1149-9252"},"institutions":[{"id":"https://openalex.org/I202697423","display_name":"University of Zurich","ror":"https://ror.org/02crff812","country_code":"CH","type":"education","lineage":["https://openalex.org/I202697423"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Michael Schaller","raw_affiliation_strings":["University of Zurich,Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Zurich,Switzerland","institution_ids":["https://openalex.org/I202697423"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11570342,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1764","last_page":"1769"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9850999712944031,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9836999773979187,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7429932355880737},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.7224908471107483},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.46076324582099915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41773489117622375},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3388116955757141},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.18085142970085144}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7429932355880737},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7224908471107483},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.46076324582099915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41773489117622375},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3388116955757141},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.18085142970085144}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit57864.2024.10619624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2714368781","display_name":null,"funder_award_id":"UI/BD/151186/2021","funder_id":"https://openalex.org/F4320337197","funder_display_name":"Nuclear Fuel Cycle and Supply Chain"},{"id":"https://openalex.org/G6034721786","display_name":null,"funder_award_id":"212865","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320337197","display_name":"Nuclear Fuel Cycle and Supply Chain","ror":"https://ror.org/05tj7dm33"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1955434783","https://openalex.org/W1974991315","https://openalex.org/W1997329149","https://openalex.org/W1997512561","https://openalex.org/W2078502698","https://openalex.org/W2088596571","https://openalex.org/W2112984436","https://openalex.org/W2140393911","https://openalex.org/W3171262658","https://openalex.org/W4242536966"],"related_works":["https://openalex.org/W2159911483","https://openalex.org/W2358415454","https://openalex.org/W2158222171","https://openalex.org/W2092269370","https://openalex.org/W2088295822","https://openalex.org/W2148668421","https://openalex.org/W2970575518","https://openalex.org/W2108627014","https://openalex.org/W2123852807","https://openalex.org/W2068423227"],"abstract_inverted_index":{"The":[0],"free":[1,32],"distance":[2,33],"of":[3,11,42],"a":[4,8],"convolutional":[5,40],"code":[6],"is":[7,17,56,62],"reliable":[9],"indicator":[10],"its":[12,15],"performance.":[13],"However":[14],"computation":[16],"not":[18],"an":[19,53],"easy":[20],"task.":[21],"In":[22],"this":[23],"paper,":[24],"we":[25,50],"present":[26],"some":[27],"algorithms":[28],"to":[29,58],"compute":[30],"the":[31],"with":[34],"good":[35],"efficiency":[36],"that":[37],"work":[38],"for":[39],"codes":[41],"all":[43],"rates":[44],"and":[45],"over":[46],"any":[47],"field.":[48],"Furthermore":[49],"discuss":[51],"why":[52],"algorithm":[54],"which":[55],"claimed":[57],"be":[59],"very":[60],"efficient":[61],"incorrect.":[63]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}