跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+479新增论文
+361其中 AI 相关
+63已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 13:44各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 14:35 — 2026-11-16 14:35(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 13:44库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,827 已收录论文19,941 AI 相关6,921 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2611.10567

On Relative Greedy Weights

Olav Geil

原文摘要

Relative greedy weights were introduced by Li and Liu in [19] as a measure of information leakage in coordinated two-party wire-tap channels of type II when the adversary follows a greedy strategy. Their definition can be viewed as a relative version of the CEZ greedy weights, which are only locally greedy. In this paper, we revisit the concept of greediness and relative greediness introducing new measures, and we discuss other perhaps more relevant applications of relative greedy weights than the coordinated two-party wire-tap channel of type II. We pay special attention to bottom-up greedy weights, which correspond to an adversary with an ultimate greedy approach, and we present families of nested codes for which such weights are larger than the relative CEZ greedy weights.

cs.IT · cs.CR