Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets |
| |
| Authors: | Cunsheng Ding Mordecai Golin Torleiv Kløve |
| |
| Institution: | (1) Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China;(2) Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China (on leave from the University of Bergen, Norway |
| |
| Abstract: | The Welch lower bound on the total-squared-correlation (TSC) of binary signature sets is loose for binary signature sets whose length L is not a multiple of 4. Recently Karystinos and Pados 6,7] developed new bounds that are better than the Welch bound in those cases, and showed how to achieve the bounds with modified Hadamard matrices except in a couple of cases. In this paper, we study the open cases. |
| |
| Keywords: | binary sequences code division multiple access codes Welch bound Karystinos-Pados bound |
| 本文献已被 SpringerLink 等数据库收录！ |
|
