Accession Number : AD0774850

Title :   Error Correcting Codes for the English Alphabet and Generalizations,


Personal Author(s) : Solomon,G.

Report Date : 27 JUL 1972

Pagination or Media Count : 15

Abstract : A powerful set of systematic error correction codes over the English alphabet is presented here for words up to length 27. The codes have minimum distance equal to the number of parity checks, and are generated by shift registers using ternary addition and multiplication. The English alphabet codes belong to a new class of systematic codes over any alphabet of size (p sup q)-1 where p is a prime. This includes the ten decimal numbers from 0 to 9 and the 36 alpha-numerics A - Z, 0 - 9. These codes are specific non-linear subsets of Reed-Solomon codes and inherit their error-detection and correction syndromes along with a non-linear condition. In general, there exist systematic codes of dimension k and length (p sup q) with minimum distance d = (p sup q)-k over any alphabet of size (p sup q)-j, provided that jd < (p sup q). (Author)

Descriptors :   *Error correction codes, *English language, *Alphabets, Algorithms

Subject Categories : Linguistics

Distribution Statement : APPROVED FOR PUBLIC RELEASE