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

推荐订阅源

WordPress大学
WordPress大学
B
Blog RSS Feed
The GitHub Blog
The GitHub Blog
爱范儿
爱范儿
博客园 - 司徒正美
J
Java Code Geeks
酷 壳 – CoolShell
酷 壳 – CoolShell
Engineering at Meta
Engineering at Meta
大猫的无限游戏
大猫的无限游戏
D
Docker
Blog — PlanetScale
Blog — PlanetScale
Recent Announcements
Recent Announcements
罗磊的独立博客
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - 聂微东
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
人人都是产品经理
人人都是产品经理
Stack Overflow Blog
Stack Overflow Blog
M
MIT News - Artificial intelligence
腾讯CDC
T
The Blog of Author Tim Ferriss
小众软件
小众软件
U
Unit 42
T
Tailwind CSS Blog

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
Polycyclic Codes over the Product Ring $\mathbb{F}_q^l$ a...
Akanksha, Ritumoni Sarma · 2024-12-26 · via cs.IT updates on arXiv.org

In this article, for the finite field $\mathbb{F}_q$, we show that the $\mathbb{F}_q$-algebra $\mathbb{F}_q[x]/\langle f(x) \rangle$ is isomorphic to the product ring $\mathbb{F}_q^{°f(x)}$ if and only if $f(x)$ splits over $\mathbb{F}_q$ into distinct factors. We generalize this result to the quotient of the polynomial algebra $\mathbb{F}_q[x_1, x_2,\dots, x_k]$ by the ideal $\langle f_1(x_1), f_2(x_2),\dots, f_k(x_k)\rangle.$ On the other hand, we establish that every finite-dimensional $\mathbb{F}_q$-algebra $\mathcal{S}$ has an orthogonal basis of idempotents with their sum equal to $1_{\mathcal{S}}$ if and only if $\mathcal{S}\cong\mathbb{F}_q^l$ as $\mathbb{F}_q$-algebras, where $l=\dim_{\mathbb{F}_q} \mathcal{S}$. Instead of studying polycyclic codes over $\mathbb{F}_q$-algebras $\mathbb{F}_q[x_1, x_2,\dots, x_k]/\langle f_1(x_1), f_2(x_2),\dots, f_k(x_k)\rangle$ where $f_i(x_i)$ splits into distinct linear factors over $\mathbb{F}_q,$ which is a subclass of $\mathbb{F}_q^l,$ we study polycyclic codes over $\mathbb{F}_q^l$ and obtain their unique decomposition into polycyclic codes over $\mathbb{F}_q$ for every such orthogonal basis of $\mathbb{F}_q^l$. We refer to it as an $\mathbb{F}_q$-decomposition. An $\mathbb{F}_q$-decomposition enables us to use results of polycyclic codes over $\mathbb{F}_q$ to study polycyclic codes over $\mathbb{F}_q^l$; for instance, we show that the annihilator dual of a polycyclic code over $\mathbb{F}_q^l$ is a polycyclic code over $\mathbb{F}_q^l$. Furthermore, with the help of different Gray maps, we produce a good number of examples of MDS or almost-MDS or/and optimal codes; some of them are LCD over $\mathbb{F}_q$. Finally, we study Gray maps from $(\mathbb{F}_q^l)^n$ to $\mathbb{F}_q^{nl},$ and use it to construct quantum codes with the help of CSS construction.