Abstract A G-design is said to be balanced if the degree of its vertices is constant. We say that a G-design is strongly balanced, if for every i = 1, 2, ..., h, there exists a constant Ci such that dAi(x) = Ci, for every vertex x, where Ai indicates an automorphism classes (orbits) of the automorphism group of G, on its vertex-set, and dAi(x) is the number of blocks containing x as an element ...

In this paper, we study a class of spatially coupled turbo codes, namely partially information- and parity-coupled codes. This codes enjoy several advantages such as flexible code rate adjustment by varying the coupling ratio encoding decoding architectures underlying component can remain unchanged. For work, first provide construction methods for with memory m corresponding graph models. We th...

Some new series of block designs with nested rows and columns have been constructed with some examples mainly from a combinatorial point of view. Two of the series are balanced (ternary), the others are partially balanced, based on rectangular and triangular association schemes.

A graph is balanced if its clique-matrix contains no edge-vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs ...

In this paper, we propose a novel balanced scorecard design based on fuzzy analytic network process and then conduct performance evaluation through a case study. After analyzing the related works about balanced scorecard design and the algorithm of fuzzy analytic network process, we illustrate the improved balanced scorecard design. Firstly, the basic concepts for the balanced scorecards are in...