2016 International Symposium on Information Theory and Its Applications (ISITA)
In this paper we propose a generalized concatenated code (GC code) construction based on shortened Reed-Solomon inner codes and nonbinary LDPC outer codes. We also propose a soft-input decoder for this construction that makes use of soft-input soft-output decoding of both inner and outer codes. We show that this construction gives significant coding gain. We also compared it to generalized error-location codes with Reed-Solomon component codes and hard-decision decoding. We believe that the proposed code could be used in modern and future radio communication systems.
This article uses case studies of visual art installations to elaborate an alternative view of the way art is experienced by museum and gallery visitors. In particular, it is argued that the orthodox and influential decoding perspective in the sociology of art overlooks the situated and experiential nature of art, especially when art takes the form of installations. In order to study experiences of art installations, this article draws on recent developments in cultural sociology and the sociology of music to reintroduce the idea of mediation into thinking about and with art. A focus on processes of mediation allows me to address the communications and interactions which emerged at the particular art installation under consideration here, a piece called PharmaConcert by Evgeniy Chertoplyasov that was displayed at the Winzavod Art Centre in Moscow in 2011. Detailed analysis of the forms of interactions at this exhibition shows that as audience members perceive artworks, they transform abstract expectations of artworks into a series of specific and situated actions. Simultaneously, other mediation processes reassemble the audiences through shared experience of contested meanings of an artwork. The paper challenges the orthodox sociological notion of what an ‘audience’ is and instead sees audiences as an emerging form of communication and interaction specific to a particular artwork / installation.
Separating codes have been used in many areas as diverse as automata synthesis, technical diagnosis and traitor tracing schemes. In this paper, we study a weak version of separating codes called almost separating codes. More precisely, we derive lower bounds on the rate of almost separating codes. From the main result it is seen that the lower bounds on the rate for almost separating codes are greater than the currently known lower bounds for ordinary separating codes. Moreover, we also show how almost separating codes can be used to construct a family of fingerprinting codes.
The paper discusses generalized error locating (GEL) codes over the same alpha- bet for both component codes. The algorithm for computing upper bound on decoding error probability under known input symbol error rate and code parameters. Is is used for construct- ing the algorithm of code parameters selection that maximizes code rate for given construction and input and output error probabilities. The lower bound on on decoding error probability is given. The examples of wrong decoding probability versus input symbol error rate are given and their behavior is described.
In this paper we propose a woven block code construction based on two convolutional outer codes and a single inner code. We proved lower and upper bounds on this construction's code distance. The lower bound is shown to be higher than the product of the free distances of inner and outer constituent codes. Since this construction uses well-developed convolutional constituent codes, we believe that it would be competitive to turbo codes in the future mobile communication systems.
A novel method for computing the discrete Fourier transform (DFT) over a finite field based on the Goertzel-Blahut algorithm is described. The novel method is currently the best one for computing the DFT over even extensions of the characteristic two finite field, in terms of multiplicative complexity.
The textbook contains necessary information about universal and classical algebras, systems of axioms for the basic algebraic structures (groupoid, monoid, semi-groups, groups, partial orders, rings, fields). The basic cryptographic algorithms are described. Error-correcting codes - linear, cyclic, BCH are considered. Algorithms for designing of such codes are given. Many examples are shown. It is put in a basis of the book long-term experience of teaching by authors the discipline «Discrete mathematics» at the business informatics faculty, at the computer science faculty of National research university Higher school of economics, and at the automatics and computer technique faculty of National research university Moscow power engineering institute. The book is intended for the students of a bachelor degree, trained at the computer science faculties in the directions 09.03.01 Informatics and computational technique, 09.03.02 Informational systems and technologies, 09.03.03 Applied informatics, 09.03.04 Software Engineering, and also for IT experts and developers of software products.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
Existing approaches suggest that IT strategy should be a reflection of business strategy. However, actually organisations do not often follow business strategy even if it is formally declared. In these conditions, IT strategy can be viewed not as a plan, but as an organisational shared view on the role of information systems. This approach generally reflects only a top-down perspective of IT strategy. So, it can be supplemented by a strategic behaviour pattern (i.e., more or less standard response to a changes that is formed as result of previous experience) to implement bottom-up approach. Two components that can help to establish effective reaction regarding new initiatives in IT are proposed here: model of IT-related decision making, and efficiency measurement metric to estimate maturity of business processes and appropriate IT. Usage of proposed tools is demonstrated in practical cases.