DocumentCode :
1291148
Title :
New constructions of superimposed codes
Author :
Yachkov, Arkadii G D ; Macula, Anthony J., Jr. ; Rykov, Vyacheslav V.
Author_Institution :
Dept. of Probability Theory, Moscow State Univ., Russia
Volume :
46
Issue :
1
fYear :
2000
fDate :
1/1/2000 12:00:00 AM
Firstpage :
284
Lastpage :
290
Abstract :
Kautz-Singleton (1964) suggested a class of binary superimposed codes which are based on the q-ary Reed-Solomon codes (RS codes). Applying a concatenation of the binary constant-weight error-correcting codes and the shortened RS codes, we obtain new constructions of superimposed codes. Tables of their parameters are given. From the tables it follows that the rate of obtained codes exceeds the corresponding random coding bound
Keywords :
Reed-Solomon codes; binary codes; concatenated codes; error correction codes; binary constant-weight error-correcting codes; binary superimposed codes; code parameters; concatenated code; generalised Kautz-Singleton codes; q-ary Reed-Solomon codes; random coding bound; shortened RS codes; Arithmetic; Concatenated codes; Equations; Error correction codes; Frequency; Hamming weight; Mathematics;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.817530
Filename :
817530
Link To Document :
بازگشت