4 citations · 6 across the 7 of their papers we have counts for
6 papers · 1 filter
Decoding of Subspace Codes, a Problem of Schubert Calculus over Finite Fields
Joachim Rosenthal, Anna-Lena Trautmann
Schubert calculus provides algebraic tools to solve enumerative problems. There have been several applied problems in systems theory, linear algebra and physics which were studied…
Efficient evaluation of polynomials over finite fields
Davide Schipani, Michele Elia, Joachim Rosenthal
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be low…
Decoding of MDP Convolutional Codes over the Erasure Channel
Virtudes Tomás, Joachim Rosenthal, Roxana Smarandache
This paper studies the decoding capabilities of maximum distance profile (MDP) convolutional codes over the erasure channel and compares them with the decoding capabilities of MDS…
Efficient recovering of operation tables of black box groups and rings
Jens Zumbragel, Gerard Maze, Joachim Rosenthal
People have been studying the following problem: Given a finite set S with a hidden (black box) binary operation * on S which might come from a group law, and suppose you have acce…
Zig-zag and Replacement Product Graphs and LDPC Codes
Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal
The performance of codes defined from graphs depends on the expansion property of the underlying graph in a crucial way. Graph products, such as the zig-zag product and replacement…
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights
Christine Kelley, Deepak Sridhara, Joachim Rosenthal
We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decodin…