当前位置: X-MOL 学术arXiv.cs.IT › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Minimizing costs of communication with random constant weight codes
arXiv - CS - Information Theory Pub Date : 2021-05-06 , DOI: arxiv-2105.02504
Pau Vilimelis Aceituno

We present a framework for minimizing costs in constant weight codes while maintaining a certain amount of differentiable codewords. Our calculations are based on a combinatorial view of constant weight codes and relay on simple approximations.

中文翻译:

使用随机恒定权重代码将通信成本降至最低

我们提出了一个框架,用于在保持一定数量的可区分代码字的同时,将恒定权重代码的成本降至最低。我们的计算基于恒定权重代码的组合视图,并基于简单的近似值进行中继。
更新日期:2021-05-07
down
wechat
bug