ISSN:

1930-5346

eISSN:

1930-5338

## Advances in Mathematics of Communications

August 2018 , Volume 12 , Issue 3

Select all articles

Export/Reference:

*+*[Abstract](452)

*+*[HTML](184)

*+*[PDF](543.19KB)

**Abstract:**

In the present study we consider two variants of Schnorr-Shevchenko method (SS) for solving hard knapsack problems, which are on average faster than the SS method. Furthermore, we study the compact knapsack problem i.e. the solution space is not {0, 1} as in knapsack problem but some larger set, and we present an algorithm to attack this problem. Finally, we provide a three move sound id-scheme based on the compact knapsack problem.

*+*[Abstract](288)

*+*[HTML](173)

*+*[PDF](377.03KB)

**Abstract:**

The hulls of linear and cyclic codes have been extensively studied due to their wide applications. The dimensions and average dimension of the Euclidean hull of linear and cyclic codes have been well-studied. In this paper, the average dimension of the Hermitian hull of constacyclic codes of length

*+*[Abstract](329)

*+*[HTML](178)

*+*[PDF](1343.62KB)

**Abstract:**

In large scale distributed storage systems (DSS) deployed in cloud computing, correlated failures resulting in simultaneous failure (or, unavailability) of blocks of nodes are common. In such scenarios, the stored data or a content of a failed node can only be reconstructed from the available live nodes belonging to the available blocks. To analyze the resilience of the system against such block failures, this work introduces the framework of Block Failure Resilient (BFR) codes, wherein the data (e.g., a file in DSS) can be decoded by reading out from a same number of codeword symbols (nodes) from a subset of available blocks of the underlying codeword. Further, repairable BFR codes are introduced, wherein any codeword symbol in a failed block can be repaired by contacting a subset of remaining blocks in the system. File size bounds for repairable BFR codes are derived, and the trade-off between per node storage and repair bandwidth is analyzed, and the corresponding minimum storage regenerating (BFR-MSR) and minimum bandwidth regenerating (BFR-MBR) points are derived. Explicit codes achieving the two operating points for a special case of parameters are constructed, wherein the underlying regenerating codewords are distributed to BFR codeword symbols according to combinatorial designs. Finally, BFR locally repairable codes (BFR-LRC) are introduced, an upper bound on the resilience is derived and optimal code construction are provided by a concatenation of Gabidulin and MDS codes. Repair efficiency of BFR-LRC is further studied via the use of BFR-MSR/MBR codes as local codes. Code constructions achieving optimal resilience for BFR-MSR/MBR-LRCs are provided for certain parameter regimes. Overall, this work introduces the framework of block failures along with optimal code constructions, and the study of architecture-aware coding for distributed storage systems.

*+*[Abstract](277)

*+*[HTML](120)

*+*[PDF](333.03KB)

**Abstract:**

We introduce a new measure of pseudorandomness, the (periodic) Hamming correlation of order

*+*[Abstract](279)

*+*[HTML](156)

*+*[PDF](325.8KB)

**Abstract:**

We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it generalizes that introduced by Paterson in 1999. Moreover, we discuss the fact that studying the group generated by the round functions of a block cipher may not be sufficient to guarantee security against these trapdoors for the cipher.

*+*[Abstract](253)

*+*[HTML](117)

*+*[PDF](398.94KB)

**Abstract:**

Let

*+*[Abstract](342)

*+*[HTML](187)

*+*[PDF](466.09KB)

**Abstract:**

In this paper, we propose a novel method for constructing new uncorrelated asymmetric zero correlation zone (UA-ZCZ) sequence sets by interleaving perfect sequences. As a type of ZCZ sequence set, an A-ZCZ sequence set consists of multiple sequence subsets. Different subsets are correlated in conventional A-ZCZ sequence set but uncorrelated in our scheme. In other words, the cross-correlation function (CCF) between two arbitrary sequences which belong to different subsets has quite a large zero cross-correlation zone (ZCCZ). Analytical results demonstrate that the UA-ZCZ sequence set proposed herein is optimal with respect to the upper bound of ZCZ sequence set. Specifically, our scheme enables the flexible selection of ZCZ length, which makes it extremely valuable for designing spreading sequences for quasi-synchronous code-division multiple-access (QS-CDMA) systems.

*+*[Abstract](384)

*+*[HTML](140)

*+*[PDF](442.57KB)

**Abstract:**

This text gives a first definition of the $θ$-duadic codes where

*+*[Abstract](371)

*+*[HTML](168)

*+*[PDF](401.15KB)

**Abstract:**

In this paper, we study LCD BCH codes over the finite field GF

*+*[Abstract](294)

*+*[HTML](130)

*+*[PDF](288.05KB)

**Abstract:**

In this work we focus on a connection between sumsets and covering codes in an arbitrary finite module. For this purpose, bounds on a new problem on sumsets are obtained from well-known results of additive number theory, namely, the Cauchy-Davenport theorem, the Vosper theorem and a theorem due to Hamidoune-Rødseth. As an application, the approach is able to extend the Blokhuis-Lam theorems and a construction of covering codes by Honkala to an arbitrary module.

*+*[Abstract](354)

*+*[HTML](294)

*+*[PDF](445.57KB)

**Abstract:**

A construction of designs acted on by simple primitive groups is used to find some 1-designs and associated self-orthogonal, decomposable and irreducible codes that admit the simple group

2017 Impact Factor: 0.564

## Readers

## Authors

## Editors

## Referees

## Librarians

## Email Alert

Add your name and e-mail address to receive news of forthcoming issues of this journal:

[Back to Top]