TABLE OF ERROR CORRECTING AND ERROR DETECTING FIRE CODES THROUGH GENERATOR DEGREE 33,
Abstract
The binary fire codes are produced by a generator polynomial g(x) = p(x) (x squared - 1), where p(x) is of degree m. The codes are capable of correcting any single burst of errors of length b or less and of detecting any combination of two bursts of which the length of the shorter burst is no greater than m and the sum of the lengths is no greater than c + 1 as well as any single burst of length no greater than c + m, the number of check bits. The tables are formatted to facilitate selecting a particular code by listing in increasing order the burst correcting capability, increasing order of the irreducible polynomial exponent, and increasing magnitude of the check symbols, respectively. The power of the error burst detector, number of check symbols, code length, transmission efficiency, and order of the roots of the irreducible polynomial are listed.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 12, 1964
- Accession Number
- AD0622489
Entities
People
- Patrick T. Komiske
Organizations
- Johns Hopkins University Applied Physics Laboratory