Some Problems on Encoders and Channels in Information       Theory and Communications
{'Code': '05010700', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Dwight D. Fisher', 'PO_EMAI': None, 'PO_PHON': None}
The principal investigator (PI) proposes to examine two                    problems in the course of his research.  One of these                           problems involves determining the maximum amount of                             compression that can be achieved in a message so that it can                    be reliably transmitted over a communication system.  The                       research will focus on the little understood situation in                       which the characteristics of both the system and the message-                   generating device vary with time.                                                    The second problem that the PI proposes to explore                         involves determining the performance of procedures employing                    feedback for coding sequential data.  At present, the only                      general method for comparing two such procedures is to test                     to see which of them yields the smaller error.  Testing can                     be eliminated through the use of a formula for the error                        produced by a general feedback procedure.  The search for                       such a formula is included in the proposed investigation.                            More specifically, the principal investigator proposes                     to address communications problems including proving coding                     theorems for nonstationary communication channels having a                      variable-length structure, the calculation of the decoding                      error arising in linear filtering the output sequence of a                      feedback encoding scheme, and the determination of the                          optimal average rate at which a nonstationary information                       source can be encoded via a general class of variable-length                    source encoder.
{'FirstName': 'John', 'LastName': 'Kieffer', 'PI_MID_INIT': 'C', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'John C Kieffer', 'EmailAddress': 'kieffer@ece.umn.edu', 'NSF_ID': '000394915', 'StartDate': '09/15/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Minnesota-Twin Cities', 'CityName': 'MINNEAPOLIS', 'ZipCode': '554552009', 'PhoneNumber': '6126245599', 'StreetAddress': '200 OAK ST SE', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Minnesota', 'StateCode': 'MN', 'CONGRESSDISTRICT': '05', 'CONGRESS_DISTRICT_ORG': 'MN05', 'ORG_UEI_NUM': 'KABJZBBJ4B54', 'ORG_LGL_BUS_NAME': 'REGENTS OF THE UNIVERSITY OF MINNESOTA', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
[{'Code': '4096', 'Text': 'COMMUNICATIONS RESEARCH'}, {'Code': '9145', 'Text': 'SPECIAL PROGRAMS-RESERVE'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8702176.xml'}