{"id":"https://openalex.org/W2140393911","doi":"https://doi.org/10.1109/tit.1969.1054337","title":"A construction technique for random-error-correcting convolutional codes","display_name":"A construction technique for random-error-correcting convolutional codes","publication_year":1969,"publication_date":"1969-09-01","ids":{"openalex":"https://openalex.org/W2140393911","doi":"https://doi.org/10.1109/tit.1969.1054337","mag":"2140393911"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1969.1054337","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054337","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":true,"oa_status":"green","oa_url":"https://ntrs.nasa.gov/api/citations/19680017756/downloads/19680017756.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089062454","display_name":"Daniel J. Costello","orcid":"https://orcid.org/0000-0002-4387-116X"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daniel J. Costello","raw_affiliation_strings":["University of Notre Dame, Notre Dame, IN, USA","University of Notre Dame, Notre Dame, IN USA"],"affiliations":[{"raw_affiliation_string":"University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"University of Notre Dame, Notre Dame, IN USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089062454"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":9.5897,"has_fulltext":true,"cited_by_count":71,"citation_normalized_percentile":{"value":0.97741141,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"5","first_page":"631","last_page":"636"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.996999979019165,"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/T11269","display_name":"Algorithms and Data Compression","score":0.996999979019165,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9936000108718872,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9922000169754028,"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/convolutional-code","display_name":"Convolutional code","score":0.8545579314231873},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7501205801963806},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.7086805701255798},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.7075925469398499},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.6275108456611633},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6123456358909607},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6004290580749512},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.55961674451828},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5362282395362854},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5084239840507507},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.498917818069458},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.45804235339164734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4314407706260681},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.42836347222328186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42658424377441406}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.8545579314231873},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7501205801963806},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.7086805701255798},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.7075925469398499},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.6275108456611633},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6123456358909607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6004290580749512},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.55961674451828},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5362282395362854},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5084239840507507},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.498917818069458},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.45804235339164734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4314407706260681},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.42836347222328186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42658424377441406},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.1969.1054337","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054337","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"},{"id":"pmh:oai:casi.ntrs.nasa.gov:19680017756","is_oa":true,"landing_page_url":"http://hdl.handle.net/2060/19680017756","pdf_url":"https://ntrs.nasa.gov/api/citations/19680017756/downloads/19680017756.pdf","source":{"id":"https://openalex.org/S4306402118","display_name":"NASA Technical Reports Server (NASA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1305493378","host_organization_name":"NASA Headquarters","host_organization_lineage":["https://openalex.org/I1305493378"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CASI","raw_type":"NASA-CR-95142"}],"best_oa_location":{"id":"pmh:oai:casi.ntrs.nasa.gov:19680017756","is_oa":true,"landing_page_url":"http://hdl.handle.net/2060/19680017756","pdf_url":"https://ntrs.nasa.gov/api/citations/19680017756/downloads/19680017756.pdf","source":{"id":"https://openalex.org/S4306402118","display_name":"NASA Technical Reports Server (NASA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1305493378","host_organization_name":"NASA Headquarters","host_organization_lineage":["https://openalex.org/I1305493378"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CASI","raw_type":"NASA-CR-95142"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2140393911.pdf","grobid_xml":"https://content.openalex.org/works/W2140393911.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W27679391","https://openalex.org/W1999621872","https://openalex.org/W2001705110","https://openalex.org/W2137264294","https://openalex.org/W6601128693"],"related_works":["https://openalex.org/W2134727924","https://openalex.org/W99853930","https://openalex.org/W1520296533","https://openalex.org/W1848770611","https://openalex.org/W2010879611","https://openalex.org/W2992200486","https://openalex.org/W190540493","https://openalex.org/W2383546851","https://openalex.org/W2127950068","https://openalex.org/W2114200087"],"abstract_inverted_index":{"A":[0,22,78],"simple":[1],"algorithm":[2,66],"is":[3,36,40,61,87],"presented":[4],"for":[5,29],"finding":[6],"rate":[7],"1/n":[8],"random-error-correcting":[9],"convolutional":[10,30],"codes.":[11],"Good":[12],"codes":[13,73,94],"considerably":[14],"longer":[15],"than":[16],"any":[17],"now":[18],"known":[19,75,92],"are":[20,52],"obtained.":[21],"discussion":[23],"of":[24,80,82,95],"a":[25,56],"new":[26],"distance":[27,39],"measure":[28],"codes,":[31],"called":[32],"the":[33,64,90],"free":[34,76],"distance,":[35],"included.":[37],"Free":[38],"particularly":[41],"useful":[42],"when":[43],"considering":[44],"decoding":[45,86],"schemes,":[46],"such":[47],"as":[48],"sequential":[49,85],"decoding,":[50],"which":[51],"not":[53],"restricted":[54],"to":[55,71],"fixed":[57],"constraint":[58,96],"length.":[59],"It":[60],"shown":[62],"how":[63],"above":[65],"can":[67],"be":[68],"modified":[69],"slightly":[70],"produce":[72],"with":[74,84],"distance.":[77],"comparison":[79],"probability":[81],"error":[83],"made":[88],"among":[89],"best":[91],"constructive":[93],"length":[97],"36.":[98]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}