Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping

DOI10.1109/TIT.2014.2314298zbMATH Open1360.94375MaRDI QIDQ2986361FDOQ2986361

Authors: Seokbeom Hong, Hosung Park, Jong-Seon No, Tor Helleseth, Young-Sik Kim 

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Cited In (13)

• Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
• Direct synthesis signal sets for multi-input system identification
• Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
• New constructions of codebooks nearly meeting the Welch bound
• Two classes of near-optimal codebooks with respect to the Welch bound
• Character sums over a non-chain ring and their applications
• Two constructions of asymptotically optimal codebooks
• Hybrid character sums and near-optimal partial Hadamard codebooks
• Two constructions of asymptotically optimal codebooks via the trace functions
• Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
• Six constructions of asymptotically optimal codebooks via the character sums
• Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
• More constructions of near optimal codebooks associated with binary sequences

This page was built for publication: Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986361)