Best and Brouwer [Discrete Math. 17 (1977), 235– 245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length 2m − 4 and 2m − 3, respectively) are optimal. Properties of such codes are here studied, determining among other things parameters of certain subcodes. A utilization of these properties makes a computeraided classification of the optimal binary one-erro...

Analytical approximations of the Lyapunov exponent are derived for a random displacement model with equal potential barriers and random positions of the scatterers. Two asymptotic regions are considered corresponding to high and low reflectivity of the single scattering potential. The analytical results are in terms of a distribution functionW for certain phases of the transfer matrices. A func...

Abstract. Loops are the most frequent cause of non-termination in string rewriting. In the general case, non-terminating, non-looping string rewriting systems exist, and the uniform termination problem is undecidable. For rewriting with only one string rewriting rule, it is unknown whether non-terminating, non-looping systems exist and whether uniform termination is decidable. If in the one-rul...

In this paper we present an approach to compute the invariant vector of the N + 1 state Markov chain P presented in (Rogiest et al., Lecture Notes in Computer Science, NET-COOP 2007 Special Issue, pp. 4465:185-194) to determine the loss rate of an FDL buffer consisting of N lines, by solving a related Hessenberg system (i.e., a Markov chain skip-free in one direction). This system is obtained b...

In this article, a method for recommendation of music pieces according to human motions based on their kernel canonical correlation analysis (CCA)-based relationship is proposed. In order to perform the recommendation between different types of multimedia data, i.e., recommendation of music pieces from human motions, the proposed method tries to estimate their relationship. Specifically, the co...