On the Maximum Number of Codewords of X-Codes of Constant Weight Three
[article]
Yu Tsunoda, Yuichiro Fujiwara
<span title="2019-03-23">2019</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
In the context of circuit testing, an (m, n, d, x) X-code compresses n-bit output data R from the circuit under test into m bits, while allowing for detecting the existence of an up to d-bit-wise anomaly ...
This is the first result that shows the existence of an infinite sequence of X-codes whose compaction ratio tends to infinity for any fixed d under severe weight restrictions. ...
The simplest case is when x = 1, where the compactor is only required to tolerate a single X. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.09788v1">arXiv:1903.09788v1</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/o5ogdva5wjaknau6mwasfchyra">fatcat:o5ogdva5wjaknau6mwasfchyra</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191019182246/https://arxiv.org/pdf/1903.09788v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/c8/03/c8030c3a9bab00c7a8d2d96987b3ca33af765a47.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.09788v1" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>