当前位置:
X-MOL 学术
›
Moscow Univ. Math. Bull.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Frames as Continuous Redundant Codes
Moscow University Mathematics Bulletin ( IF 0.2 ) Pub Date : 2021-07-23 , DOI: 10.3103/s002713222102008x Al. R. Valiullin 1 , Ar. R. Valiullin 1 , V. V. Galatenko 1
中文翻译:
作为连续冗余码的帧
更新日期:2021-07-23
Moscow University Mathematics Bulletin ( IF 0.2 ) Pub Date : 2021-07-23 , DOI: 10.3103/s002713222102008x Al. R. Valiullin 1 , Ar. R. Valiullin 1 , V. V. Galatenko 1
Affiliation
Abstract
Expansions in a finite frame are considered as a continuous linear redundant coding. It is shown that coding of an element from an \(N\)-dimensional space with a frame consisting of \((N+M)\) elements allows detecting up to \(M\) errors and correcting up to \(\left\lfloor\dfrac{M}{2}\right\rfloor\) errors. It is also pointed out that these results are sharp. The results are direct continuous analogs of the classical statements from the discrete coding theory.
中文翻译:
作为连续冗余码的帧
摘要
有限帧中的扩展被视为连续线性冗余编码。结果表明,使用由\((N+M)\) 个元素组成的框架对\(N\)维空间中的元素进行编码允许检测多达\(M\) 个错误并纠正多达\(\左\lfloor\dfrac{M}{2}\right\rfloor\)错误。还指出这些结果是尖锐的。结果是离散编码理论中经典陈述的直接连续模拟。