4 March 2022 in IEEE Transactions on Information Theory
Linear codes over $\mathbb {Z}_{p^{s}}$ of length $n$ are subgroups of $\mathbb {Z}_{p^{s}}^{n}$ . These codes are also called $\mathbb {Z}_{p^{s}}$ -additive codes and can be seen as a generalization of linear codes over $\mathbb {Z}_{2}$ and $\mathbb {Z}_{4}$ . A $\mathbb {Z}_{p^{s}}$ -linear code is a code over $\mathbb {Z}_{p}$ , not necessarily linear, which is the generalized Gray map image of a $\mathbb {Z}_{p^{s}}$ -additive code. In 2015, a systematic encoding was found for $\mathbb {Z}_{4}$ -linear codes. Moreover, an alternative permutation decoding method, which is suitable for any binary code (not necessarily linear) with a systematic encoding, was established. In this paper, we generalize these results by presenting a systematic encoding for any $\mathbb {Z}_{p^{s}}$ -linear code with $s\geq 2$ and $p$ prime. We also describe a permutation decoding method for any systematic code over $\mathbb {Z}_{p}$ , not necessarily linear, and show some examples of how to use this systematic encoding in this decoding method.
5 October 2022 in Computers in Biology and Medicine
Embryo selection is a critical step in assisted reproduction: good selection criteria are expected to increase the probability of inducing a pregnancy. Machine learning techniques have been applied for implantation prediction or embryo quality assessment, which embryologists can use to make a decision about embryo selection. However, this is a highly uncertain real-world problem, and current proposals do not model always all the sources of uncertainty. We present a novel probabilistic graphical model that accounts for three different sources of uncertainty, the standard embryo and cycle viability, and a third one that represents any unknown factor that can drive a treatment to a failure in otherwise perfect conditions. We derive a parametric learning method based on the Expectation-Maximization strategy, which accounts for uncertainty issues. We empirically analyze the model within a real database consisting of 604 cycles (3125 embryos) carried out at Hospital Donostia (Spain). Embryologists followed the protocol of the Spanish Association for Reproduction Biology Studies (ASEBIR), based on morphological features, for embryo selection. Our model predictions are correlated with the ASEBIR protocol, which validates our model. The benefits of accounting for the different sources of uncertainty and the importance of the cycle characteristics are shown. Considering only transferred embryos, our model does not further discriminate them as implanted or failed, suggesting that the ASEBIR protocol could be understood as a thorough summary of the available morphological features.
18 March 2024 in IEEE Transactions on Information Theory
The $\mathbb {Z}_{p^{s}}$ -additive codes of length n are subgroups of $\mathbb {Z}_{p^{s}}^{n}$ , with p prime and $s\geq 1$ . They can be seen as a generalization of linear codes over $\mathbb {Z}_{2}$ , $\mathbb {Z}_{4}$ , or more general over $\mathbb {Z}_{2^{s}}$ . In this paper, we show two methods for computing a parity-check matrix of a $\mathbb {Z}_{p^{s}}$ -additive code from a generator matrix of the code in standard form. We also compare the performance of our results implemented in Magma with the current available function in Magma for linear codes over finite rings in general. Complementing this comparison, we also show a time complexity analysis of the algorithms. The rings $\mathbb {Z}_{p^{s}}$ belong to a more general class of rings: finite chain rings. Along the paper, we observe that the same results can be applied to any linear code over a finite commutative chain ring.
20 October 2023 in Finite Fields and Their Applications
22 August 2024 in IEEE Transactions on Information Theory
It is known that Z ps -linear codes, which are the Gray map image of Z ps -additive codes (linear codes over Z ps ), are systematic and a systematic encoding has been found. This makes Z ps -linear codes suitable to apply the permutation decoding method, based on the existence of r -PD-sets, which are subsets of the permutation automorphism group of the code. Some constructions of r -PD-sets of minimum size r +1 for Z ps -linear generalized Hadamard codes of type ( n ; t 1 , …, ts ) are known. In this paper, for these codes, we present new constructions of r -PD-sets of size r +1, which are suitable for all parameters t 1 , …, ts . These allow us to obtain new r -PD-sets for values of r closer to the theoretical upper bound, improving previous known results.