Skip directly to content

Minimize RSR Award Detail

Research Spending & Results

Award Detail

Awardee:UNIVERSITY OF MARYLAND, COLLEGE PARK
Doing Business As Name:University of Maryland, College Park
PD/PI:
  • Alexander Barg
  • (301) 405-7135
  • abarg@umd.edu
Award Date:05/06/2021
Estimated Total Award Amount: $ 500,000
Funds Obligated to Date: $ 500,000
  • FY 2021=$500,000
Start Date:07/01/2021
End Date:06/30/2024
Transaction Type:Grant
Agency:NSF
Awarding Agency Code:4900
Funding Agency Code:4900
CFDA Number:47.070
Primary Program Source:040100 NSF RESEARCH & RELATED ACTIVIT
Award Title or Description:CIF: Small: Coding-theoretic methods in discrepancy and energy optimization, with applications
Federal Award ID Number:2104489
DUNS ID:790934285
Parent DUNS ID:003256088
Program:Comm & Information Foundations
Program Officer:
  • Scott Acton
  • (703) 292-2124
  • sacton@nsf.gov

Awardee Location

Street:3112 LEE BLDG 7809 Regents Drive
City:College Park
State:MD
ZIP:20742-5141
County:
Country:US
Awardee Cong. District:05

Primary Place of Performance

Organization Name:University of Maryland, College Park
Street:2361 A.V. Williams
City:College Park
State:MD
ZIP:20742-1000
County:College Park
Country:US
Cong. District:05

Abstract at Time of Award

The project studies properties of sequences of zeros and ones formed of n bits. Collections of such sequences, called codes, are used for representing data to be stored in computer memory or transmitted over an optical cable. In many applications in communications, statistics, and computer science it is beneficial to choose a code that is in some ways uniformly distributed over the set of all the possible binary sequences. These applications have led researchers to define a large group of problems in applied mathematics both on the theory side and in the domain of data processing procedures. The main topic of this project is investigation of uniformly distributed codes, including their construction, evaluation of the properties, a group of related geometric problems, as well and their uses in applied problems of algorithm design, computer vision, and economical representation of data. The project relies on ideas drawn from recent developments in computer science as well as certain classical methods in applied mathematics, and it aims at new characterizations and applications of uniformly distributed sets of binary sequences. The theory of uniform distributions has seen ongoing development through most of the last century, motivated primarily by problems of numerical integration of multivariable functions. In the context of point sets on the surface of the sphere in n dimensions, approximation to the uniform distribution is quantified by the quadratic discrepancy of the point set, measured as the average number of points of the set in a region of the surface of the sphere. Spherical point sets with small quadratic discrepancy approach uniformly distributed collections of points on the sphere. This project is devoted to an extension of this theory to binary codes that approximate the uniform distribution on the Hamming space. Ways of advancing the theory of such codes were suggested in recent works of the investigator, and they rely on Fourier analysis on the Boolean cube, the theory of positive-definite kernels, linear programming, and other tools from coding theory. Applications of this work include estimating the error probability of decoding, derandomization of algorithms, and some variants of the compressed sensing problem. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

For specific questions or comments about this information including the NSF Project Outcomes Report, contact us.