Search

Your search keyword '"Shimin SUN"' showing total 3 results
Start Over Author "Shimin SUN" Journal ieee access
3 results on '"Shimin SUN"'

1. Two New Classes of Codebooks Asymptotically Achieving the Welch Bound

Author

Shimin Sun, Li Han, Yang Yan, and Yao Yao

Subjects
Codebooks, asymptotic optimality, Welch bound, Galois rings, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
Abstract

Exponential sums over Galois rings have many applications in coding theory, cryptography and algebraic combinatorics. In this article, we employ additive characters and multiplicative characters over Galois rings to present two classes of codebooks, and prove that these codebooks asymptotically achieve the Welch bound. In addition, the resulting codebooks have new parameters.

Published
2021
Full Text
View/download PDF

2. A New Construction of Codebooks Meeting the Levenshtein Bound

Author

Li Han, Shimin Sun, Yang Yan, and Qiuyan Wang

Subjects
Codebook, asymptotic optimality, Levenshtein bound, character, finite field, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
Abstract

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.

Published
2020
Full Text
View/download PDF

3. A New Construction of Codebooks Meeting the Levenshtein Bound

Author

Qiuyan Wang, Yang Yan, Li Han, and Shimin Sun

Subjects
General Computer Science, Computer science, MIMO, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Levenshtein bound, Computer Science::Multimedia, 0202 electrical engineering, electronic engineering, information engineering, General Materials Science, Electrical and Electronic Engineering, finite field, Computer Science::Information Theory, Code division multiple access, General Engineering, Codebook, 020206 networking & telecommunications, Coherence (statistics), character, Compressed sensing, Finite field, Asymptotically optimal algorithm, 010201 computation theory & mathematics, Computer Science::Sound, Computer Science::Computer Vision and Pattern Recognition, asymptotic optimality, lcsh:Electrical engineering. Electronics. Nuclear engineering, Algorithm, lcsh:TK1-9971
Abstract

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.

Published
2020

Catalog

Books, media, physical & digital resources
See catalog results