Johannes Maucher

On the equivalence of generalized concatenated codes and generalized error location codes

We show that the generator matrix of a generalized concatenated code (GCC code) of order L consists of L submatrices, where the lth submatrix is the Kronecker product of the generator matrices of the lth inner code and the lth outer code. In a similar way we show that the parity-check matrix of a generalized error location code (GEL code) of order L consists of L submatrices, where the lth submatrix is the Gronecker product of the parity-check matrices of the lth inner code and the lth outer code. Then we use these defining matrices to show that for any GCC code there exists an equivalent GEL code and vice versa.

UMTS EASYCOPE: a tool for UMTS network and algorithm evaluation

For the UMTS radio access network, the problems of dimensioning/planning and algorithm evaluation/optimization is a challenging task, which requires methods and tools that are essentially different from the ones applied for 2nd generation systems. In order to generate reliable results for the highly flexible and dynamic UMTS, sophisticated simulation tools have to be applied. A UMTS model and its implementation is described. It allows an efficient evaluation of UMTS in terms of system performance figures such as capacity, coverage and QoS.

Some Results on Generalized Concatenation of Block Codes

We consider generalized concatenation of block codes. First we give a short introduction on the notion for concatenated and error-locating codes. Then an estimation of the hard decision error correcting capacity of concatenated codes beyond half the minimum distance is presented.

Heuristic algorithms for ordering a linear block code to reduce the number of nodes of the minimal trellis

We propose simple heuristic algorithms permuting the code positions of a linear block code to reduce the total number of nodes of the minimal trellis. Obtained results for some codes are presented.

Multi Dimensional Compartment Schemes

We define a multi dimensional compartment scheme, which is a secret sharing scheme where each participant acts not only as a member of one party, but as a representative of one party on each dimension. The secret can be reconstructed whenever on each dimension at least one representative of a predetermined number of distinct parties contribute its private share. It is also shown how a non-complete multi dimensional compartment scheme can be realized.

Rectangular Codes and Rectangular Algebra

We investigate general properties of rectangular codes. The class of rectangular codes includes all linear, group, and many nongroup codes. We define a basis of a rectangular code. This basis gives a universal description of a rectangular code. In this paper the rectangular algebra is defined. We show that all bases of a t-rectangular code have the same cardinality. Bounds on the cardinality of a basis of a rectangular code are given.

Hearthstone deck-construction with a utility system

Trading Card Games are turn-based games involving strategic planning, synergies and rather complex gameplay. An interesting aspect of this game domain is the strong influence of their metagame: in this particular case deck-construction. Before a game starts, players select which cards from a vast card pool they want to take into the current game session, defining their available options and a great deal of their strategy. We introduce an approach to do automatic deck construction for the digital Trading Card Game Hearthstone, based on a utility system utilizing several metrics to cover gameplay concepts such as cost effectiveness, the mana curve, synergies towards other cards, strategic parameters about a deck as well as data on how popular a card is within the community. The presented approach aims to provide useful information about a deck for a player-level AI playing the actual game session at runtime. Herein, the key use case is to store information on why cards were included and how they should be used in the context of the respective deck. Besides creating new decks from scratch, the algorithm is also capable of filling holes in existing deck skeletons, fitting an interesting use case for Human Hearthstone players: adapting a deck to their specific pool of available cards. After introducing the algorithms and describing the different utility sources used, we evaluate how the algorithm performs in a series of experiments filling holes in existing decks of the Hearthstone eSports scene.

Bases of rectangular codes

We investigate general properties of rectangular codes. The class of rectangular codes includes all linear, group, and many nongroup codes. We define a basis of a rectangular code. This basis gives a universal description of a rectangular code. The rectangular algebra is defined. We show that all bases of a length-2 rectangular code have the same cardinality. Bounds on cardinality of a basis of a rectangular code are given. We present a simple procedure to get rectangular basis of a linear code from its generator matrix.

Rectangular Basis of a Linear Code

A rectangular code is a code for which there exists an unique minimal trellis. Such a code can be considered to be an algebraically closed set under the rectangular complement operation. The notions of rectangular closure and basis were already defined. In this paper we represent a method to construct a rectangular basis of a linear code from a given linear basis.