DocumentCode :
944340
Title :
Some properties of nonbinary error-correcting codes
Author :
Lee, C.Y.
Volume :
4
Issue :
2
fYear :
1958
fDate :
6/1/1958 12:00:00 AM
Firstpage :
77
Lastpage :
82
Abstract :
An error-correcting code may be thought of as a subset 
of points belonging to a set 
in which a metric is defined such that the distance between every pair of distinct points of is larger than some given number. In Hamming\´s original formulation, was taken to be the set of all 
-bit binary numbers and the distance between a pair of binary numbers 
and 
was taken to be the number of bits of which do not agree with the corresponding bits of . In this note we shall take to be the set of all -tuples in which each coordinate of an -tuple can assume one of 
integral values: 
, with 
. Properties of these nonbinary codes will be discussed.
of points belonging to a set in which a metric is defined such that the distance between every pair of distinct points of is larger than some given number. In Hamming\´s original formulation, was taken to be the set of all -bit binary numbers and the distance between a pair of binary numbers and was taken to be the number of bits of which do not agree with the corresponding bits of . In this note we shall take to be the set of all -tuples in which each coordinate of an -tuple can assume one of integral values: , with . Properties of these nonbinary codes will be discussed.Keywords :
Error-correcting codes; Binary codes; Counting circuits; Encoding; Error correction codes; Instruments; Personal communication networks; Telephony; Wheels;
fLanguage :
English
Journal_Title :
Information Theory, IRE Transactions on
Publisher :
ieee
ISSN :
0096-1000
Type :
jour
DOI :
10.1109/TIT.1958.1057446
Filename :
1057446
Link To Document :
