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 c...Show MoreMetadata
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.
Published in: IEEE Transactions on Information Theory ( Volume: 46, Issue: 1, January 2000)
DOI: 10.1109/18.817530