Abstract
In this paper, the value of Imax(C) for codebooks C = C(D) constructed by certain almost difference sets D in Fqx is determined and expressed in terms of Jacobi sums from which it shows that such codebooks nearly meet the Welch bound. This result is an answer of a question raised by C.Ding and T.Feng in [2]. We also present another series of codebooks which nearly meet the Welch bound, where the codebook is constructed by a subset R = Fq1 ⊕ Fq2. When q1 = q2, De is an almost difference set of R.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
