arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.28820cs.ITmath.COmath.IT
收藏

线性码中随机接入的拟阵框架

A Matroidal Framework for Random Access in Linear Codes

Universität Zürich(苏黎世大学);Technion—Israel Institute of Technology(以色列理工学院);Virginia Tech(弗吉尼亚理工大学)

Daniella Bar-Lev, Hiram H. López, Gretchen L. Matthews, Flavio Salizzoni

AI总结:

该研究提出线性码随机接入的拟阵框架,证实线性码与其对偶码的恢复平衡性等价,还定义任意拟阵的恢复平衡并证明几乎所有稀疏铺路拟阵不具该性质。

摘要:

我们研究线性码中的随机接入问题,其中码字符号是独立且有放回均匀采样的。若恢复一个码字坐标所需的期望样本数对每个坐标都相同,则称该码是恢复平衡的。我们用相关拟阵表示恢复期望,并推导了一个坐标恒等式,将码及其对偶码的这些值关联起来。这证明了线性码是恢复平衡的当且仅当其对偶码也是恢复平衡的,从而证实了Gruica等人的猜想。我们进一步为任意拟阵定义了恢复平衡,并证明渐近几乎所有稀疏铺路拟阵都不是恢复平衡的。

英文摘要:

We study random access in linear codes when codeword symbols are sampled independently and uniformly with replacement. A code is recovery balanced if the expected number of samples required to recover a codeword coordinate is the same for every coordinate. We express the recovery expectations in terms of the associated matroid and derive a coordinatewise identity relating these values for a code and its dual. This proves that a linear code is recovery balanced if and only if its dual is recovery balanced, establishing a conjecture of Gruica et al. We further define the recovery balance for arbitrary matroids and show that asymptotically almost every sparse paving matroid is not recovery balanced.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑