Coding Theory and Cryptography Seminars
Coding Theory and Cryptography Seminars
Title
ID
Scheduling
Media Type
Media Owner
-
2 plays 0We propose the new rank-metric code-based cryptosystem LIGA which is based on the hardness of list decoding and interleaved decoding of Gabidulin codes. LIGA is an…
-
0 plays 0Questions on solutions of polynomial equations over finite fields have a long history and occupy an important place in number theory. In this talk we will be interested…
-
16 plays 0Quasi-cyclic (QC) linear codes over finite fields constitute an important class of linear block codes. They are a remarkable generalization of cyclic codes and, in…
-
0 plays 0Among the most studied invariants for linear block codes, there are the generalized weights. The interest in these invariants stems from the fact that they measure…
-
0 plays 0Reed-Solomon codes are a well-known technique to represent data in the form of vectors, such that the data can be recovered even if some vector coordinates are…
-
0 plays 0We present a novel approach to non-adaptive group testing by modelling it in terms of residuated pairs on partially ordered sets. The resulting efficient decision scheme…
-
2 plays 0Physical channels like the internet are highly used in the modern world. The impact of the corona pandemic and the current age of digitisation even increased this usage…
-
0 plays 0This talk presents an information-theoretic study of the rate-performance tradeoffs in distributed hypothesis testing, with a particular focus on systems with average…
-
0 plays 0In this talk, we present a unifying framework to construct low-density parity-check (LDPC) codes with associated Tanner graphs of desired girth. Towards this goal, we…
-
0 plays 0Packet channels are subject to packet losses and these can be modeled as packet erasures where we know the lost packet's location but not its content. Channel…
-
1 plays 0Linear sets are a natural generalization of projective subspaces and of subgeometries in a projective space over a finite field. They were introduced by Lunardon in 1999…
-
0 plays 0In this talk we study the dual and the algebraic dual of an evaluation code using standard monomials and indicator functions. We show that the dual of an evaluation code…
-
0 plays 0Binary asymmetric channels are channels over the binary alphabet {0,1}, in which the probability that a 0 becomes a 1 and the probability that a 1 becomes a 0 are…
-
0 plays 0Linearized Reed-Solomon (LRS) codes are sum-rank-metric codes that fulfill the Singleton bound with equality. In the two extreme cases of the sum-rank metric, they…
-
0 plays 0This talk is about algorithms for modular composition of univariate polynomials, and for computing minimal polynomials. For two univariate polynomials a and g over a…
-
2 plays 0There are several convenient ways to construct quantum codes from classical codes, the CSS and Hermitian construction are two popular among them. Here, we describe how…
-
0 plays 0With advancements in quantum computing, the search for efficient algorithms for synthesising gates (the building blocks of quantum algorithms) using cost-effective gate…
-
1 plays 0Cyclic orbit codes are a prominent class of subspace codes, generated by taking the orbit of a single subspace of the finite field $F_{q^n}$ under an action of a Singer…
-
0 plays 0Consider $C$, an $[n,k,d]$-linear code. Every projective codeword of minimum weight $d$ corresponds to a point in $\mathbb P^{k-1}$, and there are b connections between…
Search for ""
Public, Restricted
36
Media
4
Members