IEEE Transactions on Information Theory · 2000 · 71 citations · 13 references
EngineeringComputer ScienceMathematicsCryptographyInformation TheoryNumber TheoryChannel CodingCoding TheoryError Control CodingError-correcting CodesBinary CodesBounds On CodesConstant-weight CodesReed-solomon CodesReed-solomon Coding
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.
13
The theory of error-correcting codes
James L. Massey · Proceedings of the IEEE · 1980 · 684 citations
R. C. Singleton · IEEE Transactions on Information Theory · 1964 · 536 citations
A new table of constant weight codes
A.E. Brouwer, James B. Shearer, N. J. A. Sloane et al. · IEEE Transactions on Information Theory · 1990 · 434 citations