惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

T
The Blog of Author Tim Ferriss
WordPress大学
WordPress大学
博客园 - Franky
The Cloudflare Blog
T
Tailwind CSS Blog
宝玉的分享
宝玉的分享
小众软件
小众软件
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Apple Machine Learning Research
Apple Machine Learning Research
月光博客
月光博客
B
Blog
Y
Y Combinator Blog
V
V2EX
有赞技术团队
有赞技术团队
M
MIT News - Artificial intelligence
博客园 - 司徒正美
IT之家
IT之家
G
Google Developers Blog
C
Check Point Blog
Engineering at Meta
Engineering at Meta
Microsoft Security Blog
Microsoft Security Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
GbyAI
GbyAI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
$\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-Additive Hadamard ...
Dipak K. Bhunia, Cristina Fernández-Córdoba, Mercè Villanueva · 2023-01-23 · via cs.IT updates on arXiv.org

The $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-additive codes are subgroups of $\mathbb{Z}_2^{α_1} \times \mathbb{Z}_4^{α_2} \times \mathbb{Z}_8^{α_3}$, and can be seen as linear codes over $\mathbb{Z}_2$ when $α_2=α_3=0$, $\mathbb{Z}_4$-additive or $\mathbb{Z}_8$-additive codes when $α_1=α_3=0$ or $α_1=α_2=0$, respectively, or $\mathbb{Z}_2\mathbb{Z}_4$-additive codes when $α_3=0$. A $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard code is a Hadamard code which is the Gray map image of a $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-additive code. In this paper, we generalize some known results for $\mathbb{Z}_2\mathbb{Z}_4$-linear Hadamard codes to $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes with $α_1 \neq 0$, $α_2 \neq 0$, and $α_3 \neq 0$. First, we give a recursive construction of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-additive Hadamard codes of type $(α_1,α_2, α_3;t_1,t_2, t_3)$ with $t_1\geq 1$, $t_2 \geq 0$, and $t_3\geq 1$. Then, we show that in general the $\mathbb{Z}_4$-linear, $\mathbb{Z}_8$-linear and $\mathbb{Z}_2\mathbb{Z}_4$-linear Hadamard codes are not included in the family of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes with $α_1 \neq 0$, $α_2 \neq 0$, and $α_3 \neq 0$. Actually, we point out that none of these nonlinear $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes of length $2^{11}$ is equivalent to a $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard code of any other type, a $\mathbb{Z}_2\mathbb{Z}_4$-linear Hadamard code, or a $\mathbb{Z}_{2^s}$-linear Hadamard code, with $s\geq 2$, of the same length $2^{11}$.