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

推荐订阅源

Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
月光博客
月光博客
MyScale Blog
MyScale Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
爱范儿
爱范儿
P
Proofpoint News Feed
人人都是产品经理
人人都是产品经理
Last Week in AI
Last Week in AI
罗磊的独立博客
G
Google Developers Blog
Y
Y Combinator Blog
博客园 - 【当耐特】
WordPress大学
WordPress大学
大猫的无限游戏
大猫的无限游戏
博客园 - 叶小钗
J
Java Code Geeks
酷 壳 – CoolShell
酷 壳 – CoolShell
V
Visual Studio Blog
美团技术团队
宝玉的分享
宝玉的分享
Jina AI
Jina AI
小众软件
小众软件
T
Tailwind CSS Blog
A
About on SuperTechFans

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
On kernels and nuclei of rank metric codes
Guglielmo Lunardon, Rocco Trombetti, Yue Zhou · 2016-06-08 · via cs.IT updates on arXiv.org

For each rank metric code $\mathcal{C}\subseteq \mathbb{K}^{m\times n}$, we associate a translation structure, the kernel of which is shown to be invariant with respect to the equivalence on rank metric codes. When $\mathcal{C}$ is $\mathbb{K}$-linear, we also propose and investigate other two invariants called its middle nucleus and right nucleus. When $\mathbb{K}$ is a finite field $\mathbb{F}_q$ and $\mathcal{C}$ is a maximum rank distance code with minimum distance $d<\min\{m,n\}$ or $\gcd(m,n)=1$, the kernel of the associated translation structure is proved to be $\mathbb{F}_q$. Furthermore, we also show that the middle nucleus of a linear maximum rank distance code over $\mathbb{F}_q$ must be a finite field; its right nucleus also has to be a finite field under the condition $\max\{d,m-d+2\} \geqslant \left\lfloor \frac{n}{2} \right\rfloor +1$. Let $\mathcal{D}$ be the DHO-set associated with a bilinear dimensional dual hyperoval over $\mathbb{F}_2$. The set $\mathcal{D}$ gives rise to a linear rank metric code, and we show that its kernel and right nucleus are is isomorphic to $\mathbb{F}_2$. Also, its middle nucleus must be a finite field containing $\mathbb{F}_q$. Moreover, we also consider the kernel and the nuclei of $\mathcal{D}^k$ where $k$ is a Knuth operation.