Interleaving schemes on circulant graphs with two offsets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interleaving schemes on circulant graphs with two offsets

Interleaving is used for error-correcting on a bursty noisy channel. Given a graph describing the topology of the channel, we label the vertices of so that each label-set is sufficiently sparse. Interleaving scheme corrects for any error burst of size at most ; it is a labeling where the distance between any two vertices in the same label-set is at least . We consider interleaving schemes on in...

متن کامل

Two-dimensional interleaving schemes with repetitions: Constructions and bounds

Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in applications such as optical recording and holographic storage. We assume that a cluster of errors may have an arbitrary shape, and is characterized solely by its area . Thus, an interleaving scheme ( ) of strength with repetiti...

متن کامل

On Embeddings of Circulant Graphs

A circulant of order n is a Cayley graph for the cyclic group Zn, and as such, admits a transitive action of Zn on its vertices. This paper concerns 2-cell embeddings of connected circulants on closed orientable surfaces. Embeddings on the sphere (the planar case) were classified by Heuberger (2003), and by a theorem of Thomassen (1991), there are only finitely many vertex-transitive graphs wit...

متن کامل

On Routing in Circulant Graphs

We investigate various problems related to circulant graphs { nding the shortest path between two vertices, nding the shortest loop, and computing the diameter. These problems are related to shortest vector problems in a special class of lattices. We give matching upper and lower bounds on the length of the shortest loop. We claim NPhardness results, and establish a worst-case/average-case conn...

متن کامل

On circulant and two-circulant weighing matrices

We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants. In particular, we construct W (148, 144), W (152, 144), W (156, 144) which are listed as open in the second edition of the Handbook of Combinatorial Designs. We also fill a missing entry in Strassler’s table with answer ”YES”, by constructing a circulant weighing matrix of orde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2009

ISSN: 0012-365X

DOI: 10.1016/j.disc.2009.01.020