DocumentCode :
916163
Title :
Maximum-distance linear codes (Corresp.)
Author :
Maki, Gary ; Tracey, J.
Volume :
17
Issue :
5
fYear :
1971
fDate :
9/1/1971 12:00:00 AM
Firstpage :
632
Lastpage :
632
Abstract :
Described here is a linear code that has a maximum distance between codewords of k for a code of order 2^k . Since the minimum-maximum distance is k for a code of order 2^k , a class of minimum-maximum distance codes results. For an (n,k) linear code, k \\leq n \\leq k + k/2 for k even and k \\leq n \\leq k + (k - 1)/2 for k odd. Maximum-distance codes are found useful in encoding the states of sequential circuits.
Keywords :
Linear codes; Encoding; Hardware; Linear code; Sequential circuits;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1971.1054680
Filename :
1054680
Link To Document :
بازگشت