The maximum size of an (n,t,w,e)-LPECC code is determined asymptotically, with new tight bounds when the error-correction strength is e=w-2 and a new exact formula for (n,t,3,1) under divisibility conditions on n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
On low-power error-correcting cooling codes with large distances
The maximum size of an (n,t,w,e)-LPECC code is determined asymptotically, with new tight bounds when the error-correction strength is e=w-2 and a new exact formula for (n,t,3,1) under divisibility conditions on n.