arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.01427cs.ITcs.CCmath.COmath.IT
收藏

Z信道编码

Codes for the Z-channel

Nikita Polyanskii, Yihan Zhang

AI总结:

本文研究了Z信道编码的组合性质,推导了在列表译码Plotkin点上下最大编码大小的上下界,并证明了在Plotkin点之上 $ε$ 范围内最大列表可译码的大小为 $Θ_L(ε^{-3/2})$。

摘要:

本文是关于Z信道编码组合性质的一系列结果汇总。错误率为 $τ$ 的Z信道接收长度为 $n$ 的二进制码字作为输入,并以对抗性方式注入多达 $nτ$ 个非对称错误,即仅将比特置零但不将0翻转为1的错误。已知,当 $τ$ 小于一个我们称之为 $(L-1)$-列表译码Plotkin点的临界值时,错误率为 $τ$ 的Z信道的最大 $(L-1)$-列表可译码具有指数级大小(关于 $n$);而若 $τ$ 大于该阈值,则其大小为常数。已知 $(L-1)$-列表译码Plotkin点为 $ L^{-\frac{1}{L-1}} - L^{-\frac{L}{L-1}} $,在 $ L-1=1 $ 的唯一译码情况下等于 $1/4$。本文推导了在列表译码Plotkin点之上和之下最大编码大小的各种结果。特别地,我们证明了,对于任意给定的足够小的正常数 $ ε>0 $,Plotkin点之上 $ε$ 范围内的最大 $(L-1)$-列表可译码,对于任意 $L-1\ge1$,其大小为 $Θ_L(ε^{-3/2})$。我们还为Plotkin点之下的编码的指数级大小设计了上下界。

英文摘要:

This paper is a collection of results on combinatorial properties of codes for the Z-channel. A Z-channel with error fraction $τ$ takes as input a length-$n$ binary codeword and injects in an adversarial manner up to $nτ$ asymmetric errors, i.e., errors that only zero out bits but do not flip $0$'s to $1$'s. It is known that the largest $(L-1)$-list-decodable code for the Z-channel with error fraction $τ$ has exponential size (in $n$) if $τ$ is less than a critical value that we call the $(L-1)$-list-decoding Plotkin point and has constant size if $τ$ is larger than the threshold. The $(L-1)$-list-decoding Plotkin point is known to be $ L^{-\frac{1}{L-1}} - L^{-\frac{L}{L-1}} $, which equals $1/4$ for unique-decoding with $ L-1=1 $. In this paper, we derive various results for the size of the largest codes above and below the list-decoding Plotkin point. In particular, we show that the largest $(L-1)$-list-decodable code $ε$-above the Plotkin point, {for any given sufficiently small positive constant $ ε>0 $,} has size $Θ_L(ε^{-3/2})$ for any $L-1\ge1$. We also devise upper and lower bounds on the exponential size of codes below the list-decoding Plotkin point.

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

↑