几乎瞬时定长到变长码的一般形式
General form of almost instantaneous fixed-to-variable-length codes
AI总结：
本文提出了允许有限解码延迟的几乎瞬时定长到变长（AIFV）码的一般类，通过多码树构造引入 $N$ 比特延迟 AIFV 码，证明其能表示任何唯一可编解码的变长码，并给出最小延迟多码树表示及可解码性约束的区间比较表述。
摘要：
本文提出了几乎瞬时定长到变长（AIFV）码的一般类，当允许有限比特的解码延迟时，该类包含我们能构造的所有可能的二进制码。本文的贡献如下：(i) 引入 $N$ 比特延迟 AIFV 码，通过多棵码树构造，比传统 AIFV 码具有更高的灵活性。(ii) 证明所提出的码能表示任何唯一可编码且唯一可解码的变长到变长码。(iii) 展示如何将码表示为具有最小解码延迟的多棵码树。(iv) 将可解码性约束表述为实数轴上区间的比较。本文的理论结果有望对 AIFV 码的进一步研究有用。
英文摘要：
A general class of the almost instantaneous fixed-to-variable-length (AIFV) codes is proposed, which contains every possible binary code we can make when allowing finite bits of decoding delay. The contribution of the paper lies in the following. (i) Introducing $N$-bit-delay AIFV codes, constructed by multiple code trees with higher flexibility than the conventional AIFV codes. (ii) Proving that the proposed codes can represent any uniquely-encodable and uniquely-decodable variable-to-variable length codes. (iii) Showing how to express codes as multiple code trees with minimum decoding delay. (iv) Formulating the constraints of decodability as the comparison of intervals in the real number line. The theoretical results in this paper are expected to be useful for further study on AIFV codes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
