Exact and Approximate Expressions for the Probability of Undetected Error of Varshamov-Tenengol'ts Codes

Computation of the undetected error probability for error correcting codes over the Z-channel is an important issue, explored only in part in previous literature. In this paper we consider the case of Varshamov-Tenengol'ts codes, by presenting some analytical, numerical, and heuristic methods for unveiling this additional feature. Possible comparisons with Hamming codes are also shown and discussed.Comment: 33 pages, 9 figures, 1 table. Submitted to the IEEE Transactions on Information Theor

A class of punctured simplex codes which are proper for error detection

Binary linear [n,k] codes that are proper for error detection are known for many combinations of n and k. For the remaining combinations, existence of proper codes is conjectured. In this paper, a particular class of [n,k] codes is studied in detail. In particular, it is shown that these codes are proper for many combinations of n and k which were previously unsettled

The modular n-queen problem II

AbstractWe study classes of solutions to the modular n-queen problem. The main part of the paper is concerned with symmetric solutions (solutions invariant under 90° rotation). In the last section we study maximal partial solutions for those values of n for which no solutions exist

Estimation of temporal and spatial variations in groundwater recharge in unconfined sand aquifers using Scots pine inventories

Acknowledgements. This study was made possible through funding from the EU 7th Framework programme GENESIS (contract number 226536), AQVI project (no. 128377) in Academy of Finland AKVA research programme, the Renlund Foundation, VALUE doctoral school and Maa- ja vesitekniikan tuki ry. We would like to express our gratitude to Geological survey of Finland, Finnish Forest Administration (Metsähallitus) and Finnish Forest Centre (Metsäkeskus), Finnish meteorological institute, Finnish environmental administration and National land survey of Finland for providing data sets and expert knowledge that made this study possible in its current extent. To reproduce the research in the paper, data from above-mentioned agencies can be made available for purchase on request from the corresponding agency, other data can be provided by the corresponding author upon request. We thank Per-Erik Jansson for his assistance with the CoupModel and Jarkko Okkonen (GTK), anonymous reviewer, and Angelo Basile for their critical comments that significantly improved the manuscript.Peer reviewedPublisher PD

Disjoint sets of distinct sum sets

AbstractAn (h, J)-distinct sum set is a set of J integers such that all sums of h elements (repetitions allowed) are distinct. An (h, I, J)-set of disjoint distinct sum sets is a set of I disjoint (h, J)-distinct sum sets with positive elements. A number of constructions of such sets are given

Disjoint sets of distinct sum sets

AbstractAn (h, J)-distinct sum set is a set of J integers such that all sums of h elements (repetitions allowed) are distinct. An (h, I, J)-set of disjoint distinct sum sets is a set of I disjoint (h, J)-distinct sum sets with positive elements. A number of constructions of such sets are given