A Direct Construction of 2D-CCC with Arbitrary Array Size and Flexible Set Size Using Multivariable Function
Fuente:
arXiv
Saved in:
| Main Authors: | Ghosh, Gobinda, Pathak, Sachin |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Construction of CCC and ZCCS Through Additive Characters Over Galois Field
by: Ghosh, Gobinda, et al.
Published: (2024)
by: Ghosh, Gobinda, et al.
Published: (2024)
Systematic Construction of Golay Complementary Sets of Arbitrary Lengths and Alphabet Sizes
by: Roy, Abhishek, et al.
Published: (2024)
by: Roy, Abhishek, et al.
Published: (2024)
On the Optimal Message Size in PIR Under Arbitrary Collusion Patterns
by: Dornadula, Guru S., et al.
Published: (2026)
by: Dornadula, Guru S., et al.
Published: (2026)
Set Size Bound for Aperiodic Z-Complementary Sets
by: Pai, Cheng-Yu, et al.
Published: (2024)
by: Pai, Cheng-Yu, et al.
Published: (2024)
Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods
by: Xiong, Haoran, et al.
Published: (2023)
by: Xiong, Haoran, et al.
Published: (2023)
On Low Field Size Constructions of Access-Optimal Convertible Codes
by: Chopra, Saransh, et al.
Published: (2024)
by: Chopra, Saransh, et al.
Published: (2024)
Construction of 2-D Z-Complementary Array Code Sets with Flexible Lengths for Different System Requirements
by: Roy, Abhishek
Published: (2021)
by: Roy, Abhishek
Published: (2021)
Flexible Field Sizes in Secure Distributed Matrix Multiplication via Efficient Interference Cancellation
by: Makkonen, Okko
Published: (2024)
by: Makkonen, Okko
Published: (2024)
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)
by: Peng, Qingqing, et al.
Published: (2025)
Vector Quantization with Error Uniformly Distributed over an Arbitrary Set
by: Ling, Chih Wei, et al.
Published: (2023)
by: Ling, Chih Wei, et al.
Published: (2023)
Novel Constructions of 2-D Golay Complementary Array Sets of Flexible Sizes
by: Zhang, Zhaoyu, et al.
Published: (2025)
by: Zhang, Zhaoyu, et al.
Published: (2025)
Gaussian Width of Convex Sets via Integral Decompositions, Projections, and the Distribution of Intrinsic Volumes
by: Pathak, Reese, et al.
Published: (2026)
by: Pathak, Reese, et al.
Published: (2026)
A Note on Function Correcting Codes for b-Symbol Read Channels
by: Sampath, Sachin, et al.
Published: (2025)
by: Sampath, Sachin, et al.
Published: (2025)
Flexible XL-MIMO via Array Configuration Codebook: Codebook Design and Array Configuration Training
by: Lu, Haiquan, et al.
Published: (2025)
by: Lu, Haiquan, et al.
Published: (2025)
Demand Private Coded Caching: Small Cache Size
by: Lu, Qinyi, et al.
Published: (2025)
by: Lu, Qinyi, et al.
Published: (2025)
On the Maximum Size of Codes Under the Damerau-Levenshtein Metric
by: Ye, Zuo, et al.
Published: (2025)
by: Ye, Zuo, et al.
Published: (2025)
On the Optimal Source Key Size of Secure Gradient Coding
by: Zhou, Yang, et al.
Published: (2025)
by: Zhou, Yang, et al.
Published: (2025)
Multivariate Partial Information Decomposition: Constructions, Inconsistencies, and Alternative Measures
by: Lyu, Aobo, et al.
Published: (2025)
by: Lyu, Aobo, et al.
Published: (2025)
Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
by: Heng, Ziling, et al.
Published: (2025)
by: Heng, Ziling, et al.
Published: (2025)
New Constructions of Locally Perfect Nonlinear Functions and Their Application to Sequence Sets With Low Ambiguity Zone
by: Yang, Zhiye, et al.
Published: (2025)
by: Yang, Zhiye, et al.
Published: (2025)
Improved Field Size Bounds for Higher Order MDS Codes
by: Brakensiek, Joshua, et al.
Published: (2022)
by: Brakensiek, Joshua, et al.
Published: (2022)
Flexible Coupler Array with Reconfigurable Pattern: Mechanical Beamforming and Digital Agent
by: Shao, Xiaodan, et al.
Published: (2026)
by: Shao, Xiaodan, et al.
Published: (2026)
Soft Robotics-Inspired Flexible Antenna Arrays
by: Faddoul, Elio, et al.
Published: (2025)
by: Faddoul, Elio, et al.
Published: (2025)
Directivity Enhancement of Movable Antenna Arrays with Mutual Coupling
by: Xu, Wei, et al.
Published: (2026)
by: Xu, Wei, et al.
Published: (2026)
Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size
by: Ron-Zewi, Noga, et al.
Published: (2024)
by: Ron-Zewi, Noga, et al.
Published: (2024)
Join Size Bounds using Lp-Norms on Degree Sequences
by: Khamis, Mahmoud Abo, et al.
Published: (2023)
by: Khamis, Mahmoud Abo, et al.
Published: (2023)
Support Size of $\varepsilon$-Capacity-Achieving Inputs for the Amplitude-Constrained AWGN Channel
by: Barletta, Luca, et al.
Published: (2026)
by: Barletta, Luca, et al.
Published: (2026)
An Information Theory of Compute-Optimal Size Scaling, Emergence, and Plateaus in Language Models
by: Nayak, Anuj K., et al.
Published: (2024)
by: Nayak, Anuj K., et al.
Published: (2024)
Research on the Construction of Maximum Distance Separable Codes via Arbitrary twisted Generalized Reed-Solomon Codes
by: Zhao, Chun'e, et al.
Published: (2024)
by: Zhao, Chun'e, et al.
Published: (2024)
Explicit Representatives and Sizes of Cyclotomic Cosets and their Application to Cyclic Codes over Finite Fields
by: Zhu, Li, et al.
Published: (2024)
by: Zhu, Li, et al.
Published: (2024)
On $(θ, Θ)$-cyclic codes and their applications in constructing QECCs
by: Shukla, Awadhesh Kumar, et al.
Published: (2024)
by: Shukla, Awadhesh Kumar, et al.
Published: (2024)
Reducing Ciphertext and Key Sizes for MLWE-Based Cryptosystems
by: Maringer, Georg, et al.
Published: (2025)
by: Maringer, Georg, et al.
Published: (2025)
Improved List Size for Folded Reed-Solomon Codes
by: Srivastava, Shashank
Published: (2024)
by: Srivastava, Shashank
Published: (2024)
A Study of an Information Retrieval Performance Measure: Expected Search Length as a Function of File Size and Organization.
by: Deutsch, Donald R., et al.
Published: (1974)
by: Deutsch, Donald R., et al.
Published: (1974)
Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)
Flexible Antenna Arrays for Wireless Communications: Modeling and Performance Evaluation
by: Yang, Songjie, et al.
Published: (2024)
by: Yang, Songjie, et al.
Published: (2024)
Softmax is not Enough (for Sharp Size Generalisation)
by: Veličković, Petar, et al.
Published: (2024)
by: Veličković, Petar, et al.
Published: (2024)
A Construction of Arbitrarily Large Type-II $Z$ Complementary Code Set
by: Kumar, Rajen, et al.
Published: (2023)
by: Kumar, Rajen, et al.
Published: (2023)
Data-dependent Generalization Bounds via Variable-Size Compressibility
by: Sefidgaran, Milad, et al.
Published: (2023)
by: Sefidgaran, Milad, et al.
Published: (2023)
Secure Decentralized Pliable Index Coding for Target Data Size
by: Padmanabhan, Anjali, et al.
Published: (2026)
by: Padmanabhan, Anjali, et al.
Published: (2026)
Similar Items
-
Construction of CCC and ZCCS Through Additive Characters Over Galois Field
by: Ghosh, Gobinda, et al.
Published: (2024) -
Systematic Construction of Golay Complementary Sets of Arbitrary Lengths and Alphabet Sizes
by: Roy, Abhishek, et al.
Published: (2024) -
On the Optimal Message Size in PIR Under Arbitrary Collusion Patterns
by: Dornadula, Guru S., et al.
Published: (2026) -
Set Size Bound for Aperiodic Z-Complementary Sets
by: Pai, Cheng-Yu, et al.
Published: (2024) -
Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods
by: Xiong, Haoran, et al.
Published: (2023)