Abstract
Described here is a linear code that has a maximum distance between codewords of k for a code of order 2k. Since the minimum-maximum distance is k for a code of order 2k, a class of minimum-maximum distance codes results. For an (n,k) linear code, k ≤ n ≤ k + k∣2 for k even and k ≤ n ≤ k + (k - 1)/2 for k odd. Maximum-distance codes are found useful in encoding the states of sequential circuits. © 1971, IEEE. All rights reserved.
Recommended Citation
G. K. Maki and J. H. Tracey, "Maximum-Distance Linear Codes," IEEE Transactions on Information Theory, vol. 17, no. 5, p. 632, Institute of Electrical and Electronics Engineers, Jan 1971.
The definitive version is available at https://doi.org/10.1109/TIT.1971.1054680
Department(s)
Electrical and Computer Engineering
International Standard Serial Number (ISSN)
1557-9654; 0018-9448
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2023 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Jan 1971
