{"id":"https://openalex.org/W2157875630","doi":"https://doi.org/10.1109/tit.1966.1053879","title":"A coding scheme for additive noise channels with feedback--I: No bandwidth constraint","display_name":"A coding scheme for additive noise channels with feedback--I: No bandwidth constraint","publication_year":1966,"publication_date":"1966-04-01","ids":{"openalex":"https://openalex.org/W2157875630","doi":"https://doi.org/10.1109/tit.1966.1053879","mag":"2157875630"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1966.1053879","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1966.1053879","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://pure.tue.nl/ws/files/4377013/716777.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010046653","display_name":"J. Schalkwijk","orcid":null},"institutions":[{"id":"https://openalex.org/I4388482701","display_name":"Applied Research Laboratory at the University of Hawai\u2018i","ror":"https://ror.org/046s2rf49","country_code":null,"type":"facility","lineage":["https://openalex.org/I4388482701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Schalkwijk","raw_affiliation_strings":["Applied Research Laboratory, Sylvania Electronic Products, Inc.orporated, Waltham, MA, USA","[Applied Research Laboratory, Sylvania Electronic Products, Inc.orporated, Waltham, MA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Applied Research Laboratory, Sylvania Electronic Products, Inc.orporated, Waltham, MA, USA","institution_ids":["https://openalex.org/I4388482701"]},{"raw_affiliation_string":"[Applied Research Laboratory, Sylvania Electronic Products, Inc.orporated, Waltham, MA, USA]","institution_ids":["https://openalex.org/I4388482701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014088470","display_name":"T. Kailath","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Kailath","raw_affiliation_strings":["Department of Electrical Engineering, University of Stanford, Stanford, CA, USA","Department of Electrical Engineering, University of Stanford, Stanford, CA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Stanford, Stanford, CA, USA]","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.6122,"has_fulltext":true,"cited_by_count":561,"citation_normalized_percentile":{"value":0.98600545,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"12","issue":"2","first_page":"172","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.32690000534057617,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.32690000534057617,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.16619999706745148,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.12110000103712082,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6278342008590698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6135515570640564},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.5864465236663818},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.5593461990356445},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5339998006820679},{"id":"https://openalex.org/keywords/shannon\u2013hartley-theorem","display_name":"Shannon\u2013Hartley theorem","score":0.5240340828895569},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5013401508331299},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.500058650970459},{"id":"https://openalex.org/keywords/gaussian-noise","display_name":"Gaussian noise","score":0.42750829458236694},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39960822463035583},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37630099058151245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3334226608276367},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.33093708753585815},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.2685701549053192}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6278342008590698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6135515570640564},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.5864465236663818},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.5593461990356445},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5339998006820679},{"id":"https://openalex.org/C180137035","wikidata":"https://www.wikidata.org/wiki/Q1756194","display_name":"Shannon\u2013Hartley theorem","level":4,"score":0.5240340828895569},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5013401508331299},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.500058650970459},{"id":"https://openalex.org/C4199805","wikidata":"https://www.wikidata.org/wiki/Q2725903","display_name":"Gaussian noise","level":2,"score":0.42750829458236694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39960822463035583},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37630099058151245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3334226608276367},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33093708753585815},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.2685701549053192},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.1966.1053879","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1966.1053879","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:pure.tue.nl:publications/58d16c09-b362-41b0-ba9a-8d263c7368d4","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/58d16c09-b362-41b0-ba9a-8d263c7368d4","pdf_url":"https://pure.tue.nl/ws/files/4377013/716777.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Schalkwijk, J P M & Kailath, T 1968, 'A coding scheme for additive noise channels with feedback, Part I: No bandwith constraint', IEEE Transactions on Information Theory, vol. IT-12, no. 2, pp. 172-182. https://doi.org/10.1109/TIT.1966.1053879","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/58d16c09-b362-41b0-ba9a-8d263c7368d4","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/58d16c09-b362-41b0-ba9a-8d263c7368d4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory, IT-12(2), 172 - 182. Institute of Electrical and Electronics Engineers","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:publications/58d16c09-b362-41b0-ba9a-8d263c7368d4","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/58d16c09-b362-41b0-ba9a-8d263c7368d4","pdf_url":"https://pure.tue.nl/ws/files/4377013/716777.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Schalkwijk, J P M & Kailath, T 1968, 'A coding scheme for additive noise channels with feedback, Part I: No bandwith constraint', IEEE Transactions on Information Theory, vol. IT-12, no. 2, pp. 172-182. https://doi.org/10.1109/TIT.1966.1053879","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2157875630.pdf","grobid_xml":"https://content.openalex.org/works/W2157875630.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1969330449","https://openalex.org/W1980386196","https://openalex.org/W1994616650","https://openalex.org/W1995875735","https://openalex.org/W2020002360","https://openalex.org/W2040877654","https://openalex.org/W2044180609","https://openalex.org/W2162746441","https://openalex.org/W2164684058","https://openalex.org/W4300906761","https://openalex.org/W6631615302"],"related_works":["https://openalex.org/W2136142136","https://openalex.org/W2011915004","https://openalex.org/W2165991268","https://openalex.org/W1976783796","https://openalex.org/W2127082964","https://openalex.org/W3090071501","https://openalex.org/W1631214639","https://openalex.org/W2039465699","https://openalex.org/W2144405147","https://openalex.org/W2799464078"],"abstract_inverted_index":{"In":[0,27],"some":[1],"communication":[2],"problems,":[3],"it":[4,70],"is":[5,37,50,144,148,166],"a":[6,80,87,169],"good":[7],"assumption":[8],"that":[9,52,90],"the":[10,40,53,56,61,65,74,92,114,120,129,141,158],"channel":[11,62],"consists":[12],"of":[13,55,64,83,157],"an":[14,22],"additive":[15,142],"white":[16],"Gaussian":[17,146],"noise":[18,143],"forward":[19,67],"link":[20,58],"and":[21,100,103],"essentially":[23],"noiseless":[24],"feedback":[25,57,93],"link.":[26],"this":[28],"paper,":[29],"we":[30],"study":[31],"channels":[32,44,139,161],"where":[33,140],"no":[34],"bandwidth":[35,165],"constraint":[36],"placed":[38],"on":[39],"transmitted":[41],"signals.":[42],"Such":[43],"arise":[45],"in":[46,98,168],"space":[47],"communications.":[48],"It":[49],"known":[51,116],"availability":[54],"cannot":[59],"increase":[60],"capacity":[63],"noisy":[66],"link,":[68],"but":[69,147],"can":[71,134],"considerably":[72],"reduce":[73],"coding":[75,88,99],"effort":[76],"required":[77],"to":[78,94,153],"achieve":[79,95],"given":[81],"level":[82],"performance.":[84],"We":[85],"present":[86],"scheme":[89,159],"exploits":[91],"considerable":[96],"reductions":[97],"decoding":[101],"complexity":[102],"delay":[104],"over":[105,138],"what":[106],"would":[107],"be":[108,136],"needed":[109],"for":[110,119,160],"comparable":[111],"performance":[112],"with":[113,162],"best":[115],"(simplex)":[117],"codes":[118],"one-way":[121],"channel.":[122],"Our":[123],"scheme,":[124],"which":[125],"was":[126],"motivated":[127],"by":[128],"Robbins-Monro":[130],"stochastic":[131],"approximation":[132],"technique,":[133],"also":[135],"used":[137],"not":[145],"still":[149],"independent":[150],"from":[151],"instant":[152],"instant.":[154],"An":[155],"extension":[156],"limited":[163],"signal":[164],"presented":[167],"companion":[170],"paper":[171],"(Part":[172],"II).":[173]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":24},{"year":2024,"cited_by_count":28},{"year":2023,"cited_by_count":28},{"year":2022,"cited_by_count":24},{"year":2021,"cited_by_count":28},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":25},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":24},{"year":2014,"cited_by_count":21},{"year":2013,"cited_by_count":22},{"year":2012,"cited_by_count":18}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}