Jiang, Anxiao (Andrew) and Cook, Matthew and Bruck, Jehoshua (2004) Optimal t-Interleaving on Tori. In: 2004 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ , p. 22. ISBN 0-7803-8280-3 http://resolver.caltech.edu/CaltechAUTHORS:20110818-083929592
Full text not available from this repository.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20110818-083929592
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.
|Item Type:||Book Section|
|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.|
|Other Numbering System:|
|Official Citation:||Jiang, A.; Cook, M.; Bruck, J.; , "Optimal t-interleaving on tori," Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on , vol., no., pp. 22, 27 June-2 July 2004 doi: 10.1109/ISIT.2004.1365060 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1365060&isnumber=29909|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||16 Sep 2011 17:53|
|Last Modified:||16 Sep 2011 17:53|
Repository Staff Only: item control page