Sequence reconstruction for Grassmann graphs and permutations

Eitan Yaakobi, Moshe Schwartz, Michael Langberg, Jehoshua Bruck

نتاج البحث: فصل من :كتاب / تقرير / مؤتمرمنشور من مؤتمرمراجعة النظراء

ملخص

The sequence-reconstruction problem was first proposed by Levenshtein in 2001. This problem studies the model where the same word is transmitted over multiple channels. If the transmitted word belongs to some code of minimum distance d and there are at most r errors in every channel, then the minimum number of channels that guarantees a successful decoder (under the assumption that all channel outputs are distinct) has to be greater than the largest intersection of two balls of radius r and with distance at least d between their centers. This paper studies the combinatorial problem of computing the largest intersection of two balls for two cases. In the first part we solve this problem in the Grassmann graph for all values of d and r. In the second part we derive similar results for permutations under Kendall's τ-metric for some special cases of d and r.

اللغة الأصليةالإنجليزيّة
عنوان منشور المضيف2013 IEEE International Symposium on Information Theory, ISIT 2013
الصفحات874-878
عدد الصفحات5
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 2013
الحدث2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, تركيا
المدة: ٧ يوليو ٢٠١٣١٢ يوليو ٢٠١٣

سلسلة المنشورات

الاسمIEEE International Symposium on Information Theory - Proceedings
رقم المعيار الدولي للدوريات (المطبوع)2157-8095

!!Conference

!!Conference2013 IEEE International Symposium on Information Theory, ISIT 2013
الدولة/الإقليمتركيا
المدينةIstanbul
المدة٧/٠٧/١٣١٢/٠٧/١٣

بصمة

أدرس بدقة موضوعات البحث “Sequence reconstruction for Grassmann graphs and permutations'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا