Improved bounds for constant-power and low-power error-correcting cooling codes
Abstract
Low-power error-correcting cooling (LPECC) codes and constant-power error-correcting cooling (CPECC) codes provide error correction while controlling power consumption and thermal effects in on-chip buses. In this paper, we study binary CPECC and LPECC codes with e=w−3. For CPECC codes, we extend the applicability of the upper bound previously obtained by Zhao and Zhang from the quadratic-order condition w≥ 2t(t+1)+2 to w≥ w0(t), where w0(t)∼ √2 t3/2. Using Steiner systems, we show that the CPECC bound is attainable and asymptotically tight for fixed t,w. For LPECC codes, we establish the new upper bound ⌊(binomn+23)/(binomw+t3)⌋ for w≥ μ(t), where μ(t)∼ √2 t3/2. This bound is strictly smaller than the previous bound of Zhao and Zhang whenever both apply, and is asymptotically tight for fixed t,w in the stated range.
Related
- Three Improved Lower Bounds for Binary Error-Correcting Codes
- Improved Bounds For The Lipschitz Retraction Constant In Classical Banach Spaces
- Data Protection in Function-Correcting Symbol-Pair Codes: Redundancy Bounds and Protection Profiles
- Generalized Function-Correcting Partition Codes: Bounds and constructions
- An Improved Lower Bound for the Complex Grothendieck Constant
BibTeX
@misc{tong2026improved,
title = {{Improved bounds for constant-power and low-power error-correcting cooling codes}},
author = {Tingting Tong and Sihuang Hu},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.35061},
eprint = {2609.35061},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.35061},
}
RIS
TY - UNPB
TI - Improved bounds for constant-power and low-power error-correcting cooling codes
AU - Tingting Tong
AU - Sihuang Hu
PY - 2026
DA - 2026/09/28
PB - arXiv
DO - 10.48550/arxiv.2609.35061
UR - https://arxiv.org/abs/2609.35061
AB - Low-power error-correcting cooling (LPECC) codes and constant-power error-correcting cooling (CPECC) codes provide error correction while controlling power consumption and thermal effects in on-chip buses. In this paper, we study binary CPECC and LPECC codes with e=w−3. For CPECC codes, we extend the applicability of the upper bound previously obtained by Zhao and Zhang from the quadratic-order condition w≥ 2t(t+1)+2 to w≥ w_0(t), where w_0(t)∼ √2 t^3/2. Using Steiner systems, we show that the CPECC bound is attainable and asymptotically tight for fixed t,w. For LPECC codes, we establish the new upper bound ⌊(binomn+23)/(binomw+t3)⌋ for w≥ μ(t), where μ(t)∼ √2 t^3/2. This bound is strictly smaller than the previous bound of Zhao and Zhang whenever both apply, and is asymptotically tight for fixed t,w in the stated range.
ER -