DocumentCode :
915508
Title :
Graph theoretic 
-ary codes (Corresp.)
-ary codes (Corresp.)Author :
Hakimi, S.
Volume :
17
Issue :
2
fYear :
1971
fDate :
3/1/1971 12:00:00 AM
Firstpage :
215
Lastpage :
218
Abstract :
This correspondence formulates 
matrix descriptions for a class of weighted, directed graphs. As a result of this formulation, the concept of graph theoretic error-correcting codes is generalized to the -ary case. It is shown that graph theoretic -ary codes are completely orthogonalizable and, hence, one-step majority decodable. It is also seen that known techniques for the augmentation of circuit codes can he extended to the -ary case. The resulting codes remain easily decodable.
matrix descriptions for a class of weighted, directed graphs. As a result of this formulation, the concept of graph theoretic error-correcting codes is generalized to the -ary case. It is shown that graph theoretic -ary codes are completely orthogonalizable and, hence, one-step majority decodable. It is also seen that known techniques for the augmentation of circuit codes can he extended to the -ary case. The resulting codes remain easily decodable.Keywords :
Error-correcting codes; Graph theory; Threshold decoding; Binary codes; Circuits; Decoding; Error correction codes; Galois fields; Graph theory; Tree graphs;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1971.1054616
Filename :
1054616
Link To Document :
