Cover Image

Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Heng, Ziling, Wang, Peng, Li, Chengju
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Self-Orthogonal Codes from Vectorial Dual-Bent Functions
by: Wang, Jiaxin, et al.
Published: (2024)

New constructions of asymptotically optimal periodic and aperiodic quasi-complementary sequence sets
by: Wang, Peng, et al.
Published: (2025)

More MDS codes of non-Reed-Solomon type
by: Wu, Yansheng, et al.
Published: (2024)

Large Sets of Quasi-Complementary Sequences From Polynomials over Finite Fields and Gaussian Sums
by: Heng, Ziling, et al.
Published: (2024)

On the Codebook Design for NOMA Schemes from Bent Functions
by: Li, Chunlei, et al.
Published: (2025)

Self-orthogonal codes from plateaued functions
by: Wang, Peng, et al.
Published: (2024)

Minimal Ternary Linear Codes from Vectorial Functions
by: Li, Yanjun, et al.
Published: (2024)

Construction of Complete Complementary Codes over Small Alphabet
by: Sarkar, Palash, et al.
Published: (2021)

The augmented codes of a family of linear codes with locality 2
by: Heng, Ziling, et al.
Published: (2024)

Two families of linear codes with desirable properties from some functions over finite fields
by: Heng, Ziling, et al.
Published: (2024)

A family of self-orthogonal divisible codes with locality 2
by: Heng, Ziling, et al.
Published: (2024)

The Coverage Depth Problem in DNA Storage Over Small Alphabets
by: Bertuzzo, Matteo, et al.
Published: (2025)

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes
by: Komech, Sergey, et al.
Published: (2025)

Asymptotically Optimal Repair of Reed-Solomon Codes with Small Sub-Packetization under Rack-Aware Model
by: Wang, Ke, et al.
Published: (2025)

Multiple Spectrally Null Constrained Complete Complementary Codes of Various Lengths Over Small Alphabet
by: Kumar, Rajen, et al.
Published: (2024)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

An Explicit Upper Bound of Generalized Quadratic Gauss Sums and Its Applications for Asymptotically Optimal Aperiodic Polyphase Sequence Design
by: Liu, Huaning, et al.
Published: (2026)

A Note on "Constructing Bent Functions Outside the Maiorana-McFarland Class Using a General Form of Rothaus"
by: Guo, Fei, et al.
Published: (2025)

About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment
by: Liu, Hongyang, et al.
Published: (2026)

Optimal and Suboptimal Decoders under Finite-Alphabet Interference: A Mismatched Decoding Perspective
by: Zhang, Sibo, et al.
Published: (2025)

Rate-distortion Theory with Lower Semi-continuous Distortion on Noncompact Alphabets
by: Zou, Jiayang, et al.
Published: (2026)

Finite Alphabet Fast List Decoders for Polar Codes
by: Shah, Syed Aizaz Ali, et al.
Published: (2024)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

Flexible XL-MIMO via Array Configuration Codebook: Codebook Design and Array Configuration Training
by: Lu, Haiquan, et al.
Published: (2025)

Zigzag Codes Revisited: From Optimal Rebuilding to Small Skip Cost and Small Fields
by: Zhang, Wenqin, et al.
Published: (2025)

Common Randomness Generation from Sources with Infinite Polish Alphabet
by: Labidi, Wafa, et al.
Published: (2024)

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

A Theoretically-Grounded Codebook for Digital Semantic Communications
by: Wang, Lingyi, et al.
Published: (2025)

Demand Private Coded Caching: Small Cache Size
by: Lu, Qinyi, et al.
Published: (2025)

Asymptotically Optimal Codes for $(t,s)$-Burst Error
by: Sun, Yubo, et al.
Published: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
by: Peng, Qingqing, et al.
Published: (2025)

Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes
by: Junnila, Ville, et al.
Published: (2025)

Explicit Constant-Alphabet Subspace Design Codes
by: Goyal, Rohan, et al.
Published: (2026)

LDPC Codes for Quantitative Group Testing with a Non-Binary Alphabet
by: Mashauri, Mgeni Makambi, et al.
Published: (2024)

Old and New Results on Alphabetic Codes
by: Bruno, Roberto, et al.
Published: (2025)

Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)

Quasi-Perfect and Distance-Optimal Codes Sum-Rank Codes
by: Chen, Hao
Published: (2024)

Systematic Construction of Golay Complementary Sets of Arbitrary Lengths and Alphabet Sizes
by: Roy, Abhishek, et al.
Published: (2024)

The Asymptotic Cost of Complexity
by: Cripps, Martin W
Published: (2024)