CaltechAUTHORS
Published June 2004 | Version public
Book Section - Chapter Metadata-only

Optimal t-Interleaving on Tori

Creators

  • 1. ROR icon California Institute of Technology

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

Identifiers

Eprint ID
24923
Resolver ID
CaltechAUTHORS:20110818-083929592

Funding

Caltech Lee Center for Advanced Networking
NSF
CCR-TC-0208975

Dates

Created
2011-09-16
Created from EPrint's datestamp field
Updated
2021-11-09
Created from EPrint's last_modified field

Caltech Custom Metadata

Other Numbering System Name
INSPEC Accession Number
Other Numbering System Identifier
8178520