USING LINEAR GROUP CORRECTING CODES IN A PARALLEL TYPE TSVM (DIGITAL COMPUTER),
Abstract
The matrix method of code description is briefly considered; as the G'-matrix generates a code equivalent to one generated by the G-matrix, any linear group code can be represented in the form of a systematic code; the latter can be described by an H-matrix. Principal classes of linear group codes correcting independent errors are: the Hamming code; W. H. Kautz 'low-density' codes; Bose-Choudhuri cyclic codes; burst-error-correcting codes; Reed-Maller codes. The encoder comprises r multi-input modulo-2 summers whose outputs correspond to r check digits. The corrector (for a systematic n, k-code) comprises a scheme calculating the r-digit correction, a decoder, and a block of 2-input modulo-2 summers; the amount of equipment required is proportional to the number of 'ones' in the H-matrix. Hence, the optimal code has a matrix with the least number of ones and the best code representation. The functional reliability of a redundant system is considered.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 07, 1968
- Accession Number
- AD0681312
Entities
People
- Ya. A. Khetagurov
- Yu. P. Rudnev
Organizations
- National Air and Space Intelligence Center