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

推荐订阅源

J
Java Code Geeks
小众软件
小众软件
博客园 - 叶小钗
宝玉的分享
宝玉的分享
博客园_首页
Hugging Face - Blog
Hugging Face - Blog
人人都是产品经理
人人都是产品经理
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
S
SegmentFault 最新的问题
B
Blog RSS Feed
Engineering at Meta
Engineering at Meta
N
Netflix TechBlog - Medium
Google DeepMind News
Google DeepMind News
U
Unit 42
F
Fortinet All Blogs
IT之家
IT之家
Y
Y Combinator Blog
Martin Fowler
Martin Fowler
T
The Blog of Author Tim Ferriss
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
The GitHub Blog
The GitHub Blog
Stack Overflow Blog
Stack Overflow Blog
Blog — PlanetScale
Blog — PlanetScale
酷 壳 – CoolShell
酷 壳 – CoolShell

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
A class of twisted generalized Reed-Solomon codes
Jun Zhang, Zhengchun Zhou, Chunming Tang · 2022-02-18 · via cs.IT updates on arXiv.org

Let $\mathbb{F}_q$ be a finite field of size $q$ and $\mathbb{F}_q^*$ the set of non-zero elements of $\mathbb{F}_q$. In this paper, we study a class of twisted generalized Reed-Solomon code $C_\ell(D, k, η, \vec{v})\subset \mathbb{F}_q^n$ generated by the following matrix \[ \left(\begin{array}{cccc} v_{1} & v_{2} & \cdots & v_{n} \\ v_{1} α_{1} & v_{2} α_{2} & \cdots & v_{n} α_{n} \\ \vdots & \vdots & \ddots & \vdots \\ v_{1} α_{1}^{\ell-1} & v_{2} α_{2}^{\ell-1} & \cdots & v_{n} α_{n}^{\ell-1} \\ v_{1} α_{1}^{\ell+1} & v_{2} α_{2}^{\ell+1} & \cdots & v_{n} α_{n}^{\ell+1} \\ \vdots & \vdots & \ddots & \vdots \\ v_{1} α_{1}^{k-1} & v_{2} α_{2}^{k-1} & \cdots & v_{n} α_{n}^{k-1} \\ v_{1}\left(α_{1}^{\ell}+ηα_{1}^{q-{2}}\right) & v_{2}\left(α_{2}^{\ell}+ ηα_{2}^{q-2}\right) &\cdots & v_{n}\left(α_{n}^{\ell}+ηα_{n}^{q-2}\right) \end{array}\right) \] where $0\leq \ell\leq k-1,$ the evaluation set $D=\{α_{1},α_{2},\cdots, α_{n}\}\subseteq \mathbb{F}_q^*$, scaling vector $\vec{v}=(v_1,v_2,\cdots,v_n)\in (\mathbb{F}_q^*)^n$ and $η\in\mathbb{F}_q^*$. The minimum distance and dual code of $C_\ell(D, k, η, \vec{v})$ will be determined. For the special case $\ell=k-1,$ a sufficient and necessary condition for $C_{k-1}(D, k, η, \vec{v})$ to be self-dual will be given. We will also show that the code is MDS or near-MDS. Moreover, a complete classification when the code is near-MDS or MDS will be presented.