OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of l(1) nodes as well as all the repair traffic entering a second disjoint set of l(2) nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l(2) <= d - k +1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

A spectral element for wave propagation in honeycomb sandwich construction considering core flexibility

Spectral elements are found to be extremely resourceful to study the wave propagation characteristics of structures at high frequencies. Most of the aerospace structures use honeycomb sandwich constructions. The existing spectral elements use single layer theories for a sandwich construction wherein the two face sheets vibrate together and this model is sufficient for low frequency excitations. At high frequencies, the two face sheets vibrate independently. The Extended Higher order SAndwich Plate theory (EHSaPT) is suitable for representing the independent motion of the face sheets. A 1D spectral element based on EHSaPT is developed in this work. The wave number and the wave speed characteristics are obtained using the developed spectral element. It is shown that the developed spectral element is capable of representing independent wave motions of the face sheets. The propagation speeds of a high frequency modulated pulse in the face sheets and the core of a honeycomb sandwich are demonstrated. Responses of a typical honeycomb sandwich beam to high frequency shock loads are obtained using the developed spectral element and the response match very well with the finite element results. It is shown that the developed spectral element is able to represent the flexibility of the core resulting into independent wave motions in the face sheets, for which a finite element method needs huge degrees of freedom. (C) 2015 Elsevier Ltd. All rights reserved.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

Explicit and Unique Construction of Tetrablock Unitary Dilation in a Certain Case

Consider the domain E in defined by This is called the tetrablock. This paper constructs explicit boundary normal dilation for a triple (A, B, P) of commuting bounded operators which has as a spectral set. We show that the dilation is minimal and unique under a certain natural condition. As is well-known, uniqueness of minimal dilation usually does not hold good in several variables, e.g., Ando's dilation is known to be not unique, see Li and Timotin (J Funct Anal 154:1-16, 1998). However, in the case of the tetrablock, the third component of the dilation can be chosen in such a way as to ensure uniqueness.