Copertina

An Explicit Upper Bound of Generalized Quadratic Gauss Sums and Its Applications for Asymptotically Optimal Aperiodic Polyphase Sequence Design

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Huaning, Liu, Zilong
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Information Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Five Constructions of Asymptotically Optimal Aperiodic Doppler Resilient Complementary Sequence Sets with New Parameters
di: Liu, Xuanyu, et al.
Pubblicazione: (2026)

Asymptotically Optimal Aperiodic Doppler Resilient Complementary Sequence Sets Via Generalized Quasi-Florentine Rectangles
di: Wang, Zheng, et al.
Pubblicazione: (2025)

Asymptotically Optimal Sequence Sets With Low/Zero Ambiguity Zone Properties
di: Tian, Liying, et al.
Pubblicazione: (2024)

Doppler Resilient Complementary Sequences: Tighter Aperiodic Ambiguity Function Bound and Optimal Constructions
di: Wang, Zheng, et al.
Pubblicazione: (2025)

New Constructions of Locally Perfect Nonlinear Functions and Their Application to Sequence Sets With Low Ambiguity Zone
di: Yang, Zhiye, et al.
Pubblicazione: (2025)

Asymptotically Optimal Aperiodic and Periodic Sequence Sets with Low Ambiguity Zone Through Locally Perfect Nonlinear Functions
di: Wang, Zheng, et al.
Pubblicazione: (2025)

Zak-Transform-Induced Optimal Sequences and Their Applications in OTFS
di: Peng, Xiuping, et al.
Pubblicazione: (2025)

Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions
di: Yunlong, Zhu, et al.
Pubblicazione: (2025)

Generalized Arlery-Tan-Rabaste-Levenshtein Lower Bounds on Ambiguity Function and Their Asymptotic Achievability
di: Meng, Lingsheng, et al.
Pubblicazione: (2024)

On the Scalability of Quasi-Complementary Sequence Sets: Quadratic and Cubic Laws
di: Liu, Huaning, et al.
Pubblicazione: (2026)

Set Size Bound for Aperiodic Z-Complementary Sets
di: Pai, Cheng-Yu, et al.
Pubblicazione: (2024)

Flag Sequence Set Design for Low-Complexity Delay-Doppler Estimation
di: Meng, Lingsheng, et al.
Pubblicazione: (2023)

On Efficient Polyphase Network Implementation Using Successive Vector Approximation
di: Coelho, Luiz F. da S., et al.
Pubblicazione: (2026)

Strong Singleton-Like Bounds, Quasi-Perfect Codes and Distance-Optimal Codes in the Sum-Rank Metric
di: Liu, Chao, et al.
Pubblicazione: (2026)

On the Asymptotic Rate of Optimal Codes that Correct Tandem Duplications for Nanopore Sequencing
di: Yu, Wenjun, et al.
Pubblicazione: (2024)

Non-Asymptotic Error Bounds for Causally Conditioned Directed Information Rates of Gaussian Sequences
di: Zheng, Yuping, et al.
Pubblicazione: (2025)

Random Modulation: Achieving Asymptotic Replica Optimality over Arbitrary Norm-Bounded and Spectrally Convergent Channel Matrices
di: Liu, Lei, et al.
Pubblicazione: (2025)

Over-the-Air Computation Systems: Optimal Design with Sum-Power Constraint
di: Zang, Xin, et al.
Pubblicazione: (2020)

Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
di: Heng, Ziling, et al.
Pubblicazione: (2025)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
di: Gabrić, Daniel, et al.
Pubblicazione: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
di: Yang, Junwen, et al.
Pubblicazione: (2024)

Shannon Bounds for Quadratic Rate-Distortion Problems
di: Gastpar, Michael, et al.
Pubblicazione: (2024)

Explicit Codes approaching Generalized Singleton Bound using Expanders
di: Jeronimo, Fernando Granha, et al.
Pubblicazione: (2025)

The Shannon Upper Bound for the Error Exponent
di: Tridenski, Sergey, et al.
Pubblicazione: (2025)

Sparse Zero Correlation Zone Arrays for Training Design in Spatial Modulation Systems
di: Pai, Cheng-Yu, et al.
Pubblicazione: (2024)

Asymptotically ideal Disjunctive Hierarchical Secret Sharing Scheme with an Explicit Construction
di: Ding, Jian, et al.
Pubblicazione: (2026)

A Computer Search of New OBZCPs of Lengths up to 49
di: Kazakov, Peter, et al.
Pubblicazione: (2024)

Explicit Representatives and Sizes of Cyclotomic Cosets and their Application to Cyclic Codes over Finite Fields
di: Zhu, Li, et al.
Pubblicazione: (2024)

New Correlation Bound and Construction of Quasi-Complementary Code Sets
di: Sarkar, Palash, et al.
Pubblicazione: (2022)

Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
di: Liu, Hai, et al.
Pubblicazione: (2026)

Error Rate Analysis and Low-Complexity Receiver Design for Zero-Padded AFDM
di: Yi, Qin, et al.
Pubblicazione: (2025)

Space Upper Bounds for $α$-Perfect Hashing
di: Song, Ryan, et al.
Pubblicazione: (2026)

New Upper Bounds for Noisy Permutation Channels
di: Feng, Lugaoze, et al.
Pubblicazione: (2024)

Phase Noise Resilient Codebook Design for Sparse Code Multiple Access
di: Liu, Haibo, et al.
Pubblicazione: (2025)

Asymptotic quadratic convergence of the Gauss-Newton method for complex phase retrieval
di: Huang, Meng
Pubblicazione: (2024)

Improved Capacity Outer Bound for Private Quadratic Monomial Computation
di: Dæhli, Karen M., et al.
Pubblicazione: (2024)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
di: Chen, Yeyuan, et al.
Pubblicazione: (2024)

Quadratic Message Passing for Generalized Quadratic Equations Model
di: Zhu, Huimin
Pubblicazione: (2024)

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
di: Li, Guokai, et al.
Pubblicazione: (2026)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
di: Brakensiek, Joshua, et al.
Pubblicazione: (2025)