Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Harout Aydinian"'
Autor:
Harout Aydinian
Publikováno v:
Discrete Applied Mathematics. 216:513-517
In this short note we consider the following problem stated in the paper Ahlswede etźal. (2003). Let E n = { 0 , 1 } n ź R n and let E r n ź E n be the vectors of weight r . How many k -subspaces of R n are needed to cover the elements of E r n ?
Publikováno v:
WCNC
We consider transmissions of secure messages over a burst erasure wiretap channel under decoding delay constraint. For block codes we introduce and study delay optimal secure burst erasure correcting (DO-SBE) codes that provide perfect security and r
Autor:
Harout Aydinian, Holger Boche
Publikováno v:
ITW
Fractional repetition (FR) codes is a class of codes which were recently introduced for distributed storage systems. These codes are intended for exact uncoded repair of node failures, by downloading symbols from a suitable subset of surviving nodes.
Publikováno v:
WCNC Workshops
In this paper we consider a wiretap channel II with an active eavesdropper. Aggarwal et al (2009) were the first who studied the Ozarow-Wyner's binary wiretap channel II in the presence of an active eavesdropper. They derived achievable secrecy rates
This volume is dedicated to the memory of Rudolf Ahlswede, who passed away in December 2010. The Festschrift contains 36 thoroughly refereed research papers from a memorial symposium, which took place in July 2011. The four macro-topics of this work
Autor:
Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian
This book collects 63 revised, full-papers contributed to a research project on the'General Theory of Information Transfer and Combinatorics'that was hosted from 2001-2004 at the Center for Interdisciplinary Research (ZIF) of Bielefeld University and
Autor:
HAROUT AYDINIAN, P?TER L. ERD?S
Publikováno v:
Combinatorics, Probability & Computing; Jul2007, Vol. 16 Issue 4, p553-555, 3p