RESEARCH IN MATHEMATICS AND COMPUTER SCIENCE: CALCULATION OF THE PROBABILITY OF UNDETECTED ERROR FOR CERTAIN ERROR DETECTION CODES

Award Information
Agency:
Department of Defense
Branch:
Air Force
Amount:
$157,761.00
Award Year:
1990
Program:
SBIR
Phase:
Phase II
Contract:
N/A
Agency Tracking Number:
9018
Solicitation Year:
N/A
Solicitation Topic Code:
N/A
Solicitation Number:
N/A
Small Business Information
Qualcomm Inc.
10555 Sorrento Valley Rd, San Diego, CA, 92121
Hubzone Owned:
N
Socially and Economically Disadvantaged:
N
Woman Owned:
N
Duns:
N/A
Principal Investigator
 Dr Andrew J Viterbi
 (619) 587-1121
Business Contact
Phone: () -
Research Institution
N/A
Abstract
BINARY CYCLIC REDUNDANCY CHECK CODES, KNOWN AS CRC CODES, ARE UTILIZED AS MESSAGE ERROR DETECTION CODES IN APPLICATIONS REQUIRING VERY HIGH CONFIDENCE THAT A MESSAGE IS RECEIVED ERROR FREE. OFTEN, IT IS ASSUMED THAT THE PROBABILITY OF UNDETECTED ERROR FOR THESE CODES IS UPPER BOUNDED BY 2(-R), WHERE R IS THE NUMBER OF REDUNDANT (PARITY) BITS. THIS UPPER BOUND IS NOT CORRECT FOR MANY CODES, HOWEVER, ESPECIALLY SHORTENED CYCLIC CODES. WE HAVE FOUND A NEW METHOD FOR DETERMINING AN EXACT EVALUATION OF THE PROBABILITY OF UNDETECTED ERROR FOR THE MOST COMMONLY UTILIZED CODES. WE PROPOSE TO INVESTIGATE HOW THIS METHOD CAN BE UTILIZED TO PRODUCE THE VERY BEST MESSAGE ERROR DETECTION CODES.

* information listed above is at the time of submission.

Agency Micro-sites

US Flag An Official Website of the United States Government