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

推荐订阅源

T
Tailwind CSS Blog
博客园 - 【当耐特】
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园 - Franky
小众软件
小众软件
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 三生石上(FineUI控件)
B
Blog
有赞技术团队
有赞技术团队
J
Java Code Geeks
云风的 BLOG
云风的 BLOG
Recent Announcements
Recent Announcements
Jina AI
Jina AI
Vercel News
Vercel News
博客园 - 叶小钗
Hugging Face - Blog
Hugging Face - Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
F
Fortinet All Blogs
The Cloudflare Blog
V
V2EX
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园_首页
腾讯CDC

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
Constacyclic codes of length $4p^s$ over the Galois ring ...
Om Prakash, Habibul Islam, Ram Krishna Verma · 2019-11-08 · via cs.IT updates on arXiv.org

For prime $p$, $GR(p^a,m)$ represents the Galois ring of order $p^{am}$ and characterise $p$, where $a$ is any positive integer. In this article, we study the Type (1) $λ$-constacyclic codes of length $4p^s$ over the ring $GR(p^a,m)$, where $λ=ξ_0+pξ_1+p^2z$, $ξ_0,ξ_1\in T(p,m)$ are nonzero elements and $z\in GR(p^a,m)$. In first case, when $λ$ is a square, we show that any ideal of $\mathcal{R}_p(a,m,λ)=\frac{GR(p^a,m)[x]}{\langle x^{4p^s}-λ\rangle}$ is the direct sum of the ideals of $\frac{GR(p^a,m)[x]}{\langle x^{2p^s}-δ\rangle}$ and $\frac{GR(p^a,m)[x]}{\langle x^{2p^s}+δ\rangle}$. In second, when $λ$ is not a square, we show that $\mathcal{R}_p(a,m,λ)$ is a chain ring whose ideals are $\langle (x^4-α)^i\rangle\subseteq \mathcal{R}_p(a,m,λ)$, for $0\leq i\leq ap^s$ where $α^{p^s}=ξ_0$. Also, we prove the dual of the above code is $\langle (x^4-α^{-1})^{ap^s-i}\rangle\subseteq \mathcal{R}_p(a,m,λ^{-1})$ and present the necessary and sufficient condition for these codes to be self-orthogonal and self-dual, respectively. Moreover, the Rosenbloom-Tsfasman (RT) distance, Hamming distance and weight distribution of Type (1) $λ$-constacyclic codes of length $4p^s$ are obtained when $λ$ is not a square.