A Caltech Library Service

Interleaving Schemes on Circulant Graphs

Slivkins, Aleksandrs and Bruck, Jehoshua (2002) Interleaving Schemes on Circulant Graphs. California Institute of Technology . (Unpublished)

See Usage Policy.

See Usage Policy.


Use this Persistent URL to link to this item:


Interleaving schemes are used for error-correcting on a noisy channel. We consider interleaving schemes on infinite circulant graphs with two offsets 1 and d, with a goal to minimize the interleaving degree. Our constructions are minimal covers of the graph by copies of some subgraph S that can be labeled by a single label. We focus on minimizing the index of S - an inverse of its density rounded up. We establish lower bounds and prove that our constructions are optimal or almost optimal, both for the index of S and for the interleaving degree. We identify related combinatorial questions and advance conjectures.

Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:2002.ETR046
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26076
Deposited By: Imported from CaltechPARADISE
Deposited On:18 Nov 2002
Last Modified:26 Dec 2012 13:53

Repository Staff Only: item control page