Sylvia Encheva

A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents

Let C be a code of length n over an alphabet of q letters. An n-word y is called a descendant of a set of t codewords x1, . . . ,xt if

On binary constructions of quantum codes

y_i\in\{x^1_i,\dots,x^t_i\}

Codes satisfying the chain condition

for all i=1, . . . ,n. A code is said to have the t-identifying parent property if for any n-word that is a descendant of at most t parents it is possible to identify at least one of them. We prove that for any

Partner Selection for Interfirm Collaboration in Ship Design

t\le q-1

Constructions of intersecting codes

there exist sequences of such codes with asymptotically nonvanishing rate.

Antichain Codes

Recently, Steane (1998) proposed an enlargement of the Calderbank-Shor-Steane construction. Here we further improve on the parameters obtained from his construction, present examples of new codes, and analyze asymptotical non-constructive bounds.

More on (2,2)-separating systems

The authors considered weight hierarchies of codes satisfying the chain condition, they called these chain-good. First, they gave a set of simple necessary conditions for a sequence to be chain-good. They proved that given one chain-good sequence, there is an infinite set of chain-good sequences that can be constructed from this one sequence. Finally, they used this result to completely describe the sets of chain-good sequences of dimensions up to 5. >

Copyright protection for digital data

Purpose – The purpose of this study is to apply a mathematical method of formal concept analysis (FCA) to facilitate evaluation of potential partners, and to select the most appropriate partner for horizontal strategic alliances. Horizontal collaboration between ship design firms is important in relation to business cyclicality in the industry. The workload in ship design firms drops during the troughs of the shipbuilding cycle and increases dramatically during the peaks of the cycle.Design/methodology/approach – The proposed method of partnership selection applies FCA, which is based on mathematical lattice theory. FCA allows firms to evaluate and select the best suitable partners for horizontal interfirm cooperation from several possible candidate firms. Utilization of FCA allows a firm to visually analyze a potential partner for a horizontal strategic alliance.Findings – The contribution of this study to the literature is twofold. First, it contributes to the literature on the application of FCA in management field. Second, this study contributes to the partner selection literature. The contribution of the study is an alternative quantitative method for partner selection based on FCA. FCA compliments qualitative approaches in the process of alternatives evaluation and decision-making regarding partner selection for horizontal collaboration.Practical implications – Practitioners from ship design firms can use the FCA tool to facilitate decision-making relating to the screening of potential partners for horizontal cooperation with regard to pre-specified selected criteria.Originality/value – FCA has been marginally applied to aid managerial decision making. The FCA tool is valuable for practitioners from ship design firms to manage the selection of partners for horizontal collaboration. The FCA tool is associated with numerous advantages, notably, relative simplicity and versatility of visual analysis when compared with other mathematical approaches such as the AHP, the ANP, optimization modeling, and fuzzy set logic.

Synthesis of intelligent decision support systems for transport logistics

New constructions of binary linear intersecting codes are presented. Some codes with high distances are shown to be intersecting.

On binary linear codes which satisfy the two-way chain condition

We show that almost all codes satisfy an antichain condition. This states that the minimum length of a two dimensional subcode of a code C increases if the subcode is constrained to contain a minimum weight codeword. In particular, almost no code satisfies the chain condition. In passing, we study the typical behaviour of codes with respect to generalized distances and show that almost all lie on a generalized Varshamov-Gilbert bound.