Zobrazeno 1 - 10
of 2 593
pro vyhledávání: '"Zeh, P."'
The sum-rank metric generalizes the Hamming and rank metric by partitioning vectors into blocks and defining the total weight as the sum of the rank weights of these blocks, based on their matrix representation. In this work, we explore support-guess
Externí odkaz:
http://arxiv.org/abs/2410.15806
Autor:
Banerjee, Anisha, Welter, Lorenz, Amat, Alexandre Graell i, Wachter-Zeh, Antonia, Rosnes, Eirik
Standard decoding approaches for convolutional codes, such as the Viterbi and BCJR algorithms, entail significant complexity when correcting synchronization errors. The situation worsens when multiple received sequences should be jointly decoded, as
Externí odkaz:
http://arxiv.org/abs/2410.07120
We present a simple 4-approximation algorithm for computing a maximum agreement forest of multiple unrooted binary trees. This algorithm applies LP rounding to an extension of a recent ILP formulation of the maximum agreement forest problem on two tr
Externí odkaz:
http://arxiv.org/abs/2409.08440
Orchards are a biologically relevant class of phylogenetic networks as they can describe treelike evolutionary histories augmented with horizontal transfer events. Moreover, the class has attractive mathematical characterizations that can be exploite
Externí odkaz:
http://arxiv.org/abs/2408.10769
Federated edge learning (FEEL) has emerged as a core paradigm for large-scale optimization. However, FEEL still suffers from a communication bottleneck due to the transmission of high-dimensional model updates from the clients to the federator. Over-
Externí odkaz:
http://arxiv.org/abs/2407.11807
Consider the setting of multiple random walks (RWs) on a graph executing a certain computational task. For instance, in decentralized learning via RWs, a model is updated at each iteration based on the local data of the visited node and then passed t
Externí odkaz:
http://arxiv.org/abs/2407.11762
Motivated by communication systems with constrained complexity, we consider the problem of input symbol selection for discrete memoryless channels (DMCs). Given a DMC, the goal is to find a subset of its input alphabet, so that the optimal input dist
Externí odkaz:
http://arxiv.org/abs/2407.01263
Autor:
Welter, Lorenz, Sokolovskii, Roman, Heinis, Thomas, Wachter-Zeh, Antonia, Rosnes, Eirik, Amat, Alexandre Graell i
We consider error-correcting coding for deoxyribonucleic acid (DNA)-based storage using nanopore sequencing. We model the DNA storage channel as a sampling noise channel where the input data is chunked into $M$ short DNA strands, which are copied a r
Externí odkaz:
http://arxiv.org/abs/2406.12955
Composite DNA is a recent method to increase the base alphabet size in DNA-based data storage.This paper models synthesizing and sequencing of composite DNA and introduces coding techniques to correct substitutions, losses of entire strands, and symb
Externí odkaz:
http://arxiv.org/abs/2404.12868
Owing to its several merits over other DNA sequencing technologies, nanopore sequencers hold an immense potential to revolutionize the efficiency of DNA storage systems. However, their higher error rates necessitate further research to devise practic
Externí odkaz:
http://arxiv.org/abs/2401.15939