Published June 2004
| public
Book Section - Chapter
Optimal t-Interleaving on Tori
Abstract
The number of integers needed to t-interleave a 2-dimensional torus has a sphere-packing lower bound. We present the necessary and sufficient conditions for tori to meet that lower bound. We prove that for tori sufficiently large in both dimensions, their t-interleaving numbers exceed the lower bound by at most 1. We then show upper bounds on t-interleaving numbers for other cases, completing a general picture for the problem of t-interleaving on 2-dimensional tori. Efficient t-interleaving algorithms are also presented.
Additional Information
© 2004 IEEE. Issue Date: 27 June-2 July 2004. Date of Current Version: 10 January 2005. This work was supported in part by the Lee Center for Advanced Networking at the California Institute of Technology, and by NSF grant CCR-TC-0208975.Additional details
- Eprint ID
- 24923
- Resolver ID
- CaltechAUTHORS:20110818-083929592
- Caltech Lee Center for Advanced Networking
- CCR-TC-0208975
- NSF
- Created
-
2011-09-16Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 8178520