A New Construction of Codebooks Meeting the Levenshtein Bound
Codebooks with low coherence have extensive applications in many fileds such as code division multiple access (CDMA) communication systems, MIMO communications, compressed sensing and so on. In this paper, based on additive characters over finite fields, we propose a construction of optimal codebook...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9075233/ |
| _version_ | 1828406786988703744 |
|---|---|
| author | Li Han Shimin Sun Yang Yan Qiuyan Wang |
| author_facet | Li Han Shimin Sun Yang Yan Qiuyan Wang |
| author_sort | Li Han |
| collection | DOAJ |
| description | Codebooks with low coherence have extensive applications in many fileds such as code division multiple access (CDMA) communication systems, MIMO communications, compressed sensing and so on. In this paper, based on additive characters over finite fields, we propose a construction of optimal codebook with respect to the Levenshtein bound and verify that it is a new construction. By shortening the length of the optimal codebooks, we present a construction of codebooks asymptotically meeting the Levenshtein bound. To the best of our knowledge, the parameters of the asymptotically optimal codebooks are new. |
| first_indexed | 2024-12-10T11:16:46Z |
| format | Article |
| id | doaj.art-6365488b95254d6ab22d1b1f075cf54f |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-10T11:16:46Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-6365488b95254d6ab22d1b1f075cf54f2022-12-22T01:51:09ZengIEEEIEEE Access2169-35362020-01-018775987760310.1109/ACCESS.2020.29893609075233A New Construction of Codebooks Meeting the Levenshtein BoundLi Han0Shimin Sun1Yang Yan2Qiuyan Wang3https://orcid.org/0000-0001-9826-8272School of Computer Science and Engineering, Tianjin University of Technology, Tianjin, ChinaSchool of Computer Science and Technology, Tiangong University, Tianjin, ChinaSchool of Information Technology and Engineering, Tianjin University of Technology and Education, Tianjin, ChinaSchool of Computer Science and Technology, Tiangong University, Tianjin, ChinaCodebooks with low coherence have extensive applications in many fileds such as code division multiple access (CDMA) communication systems, MIMO communications, compressed sensing and so on. In this paper, based on additive characters over finite fields, we propose a construction of optimal codebook with respect to the Levenshtein bound and verify that it is a new construction. By shortening the length of the optimal codebooks, we present a construction of codebooks asymptotically meeting the Levenshtein bound. To the best of our knowledge, the parameters of the asymptotically optimal codebooks are new.https://ieeexplore.ieee.org/document/9075233/Codebookasymptotic optimalityLevenshtein boundcharacterfinite field |
| spellingShingle | Li Han Shimin Sun Yang Yan Qiuyan Wang A New Construction of Codebooks Meeting the Levenshtein Bound IEEE Access Codebook asymptotic optimality Levenshtein bound character finite field |
| title | A New Construction of Codebooks Meeting the Levenshtein Bound |
| title_full | A New Construction of Codebooks Meeting the Levenshtein Bound |
| title_fullStr | A New Construction of Codebooks Meeting the Levenshtein Bound |
| title_full_unstemmed | A New Construction of Codebooks Meeting the Levenshtein Bound |
| title_short | A New Construction of Codebooks Meeting the Levenshtein Bound |
| title_sort | new construction of codebooks meeting the levenshtein bound |
| topic | Codebook asymptotic optimality Levenshtein bound character finite field |
| url | https://ieeexplore.ieee.org/document/9075233/ |
| work_keys_str_mv | AT lihan anewconstructionofcodebooksmeetingthelevenshteinbound AT shiminsun anewconstructionofcodebooksmeetingthelevenshteinbound AT yangyan anewconstructionofcodebooksmeetingthelevenshteinbound AT qiuyanwang anewconstructionofcodebooksmeetingthelevenshteinbound AT lihan newconstructionofcodebooksmeetingthelevenshteinbound AT shiminsun newconstructionofcodebooksmeetingthelevenshteinbound AT yangyan newconstructionofcodebooksmeetingthelevenshteinbound AT qiuyanwang newconstructionofcodebooksmeetingthelevenshteinbound |