ON THE MINIMUM DISTANCE OF BOSE-CHAUDHURI-HOCQUENGHEM CODES,

reportActive / Technical Report | Accession Number: AD0644579 | Need Help?

Abstract:

In the paper the Mattson-Solomon algorithm is generalized in several directions. Based on the generalized algorithm, several classes of Bose-Chandhuri-Hocquenghem codes are given and shown to possess minimum distance of values greater than those given by the Bose-Chaudhuri-Hocquenghem bound. Author

Author(s):
Lum, Vincent ; Chien, R. T.
Author Organization(s):
ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB
Pagination:
0029

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
R-328
Contract/Grant Number(s):
DA-28-043-AMC-00073(E), NSF-GK-690
Project Number(s):
DA-20014501B31F
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*CODING, *ALGORITHMS), CORRECTIONS, ERRORS, DIGITAL SYSTEMS, RELIABILITY(ELECTRONICS), POLYNOMIALS, ALGEBRA, OPTIMIZATION
Field(s)/Group(s):
Cybernetics
Keyword(s):
BOSE CHAUDHURI HOCQUENGHEM CODES
Report Date:
1966 Nov 01