DocumentCode
905053
Title
On a class of cyclically permutable error-correcting codes
Author
Neumann, Perter G.
Volume
10
Issue
1
fYear
1964
fDate
1/1/1964 12:00:00 AM
Firstpage
75
Lastpage
78
Abstract
Cyclically permutable codes have error-correcting properties which are invariant under arbitrary cyclic permutation of any of their code words. This paper summarizes the results of an empirical investigation of certain of these codes, which have parameters not covered by a previous paper of E. N. Gilbert.
These codes are thought to be nearly optimal. Estimates of the obtainable number of code words are given. The codes may be suitable for use in certain asynchronous multiplex communication systems.
These codes are thought to be nearly optimal. Estimates of the obtainable number of code words are given. The codes may be suitable for use in certain asynchronous multiplex communication systems.Keywords
Error-correcting codes; Permutation codes; Binary codes; Communication systems; Decoding; Error correction codes; Hamming distance; Laboratories; Pulse modulation; Telephony;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1964.1053647
Filename
1053647
Link To Document