BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Buket Özkaya (Nanyang Technological University (Singapore))
DTSTART:20200506T070000Z
DTEND:20200506T080000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/1
DESCRIPTION:Title: Good Stabilizer Codes from Quasi-Cyclic Codes\nby Buket
Özkaya (Nanyang Technological University (Singapore)) as part of Universi
ty of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbstract
\nLisonek and Singh proposed an interesting modification to the constructi
on of qubit stabilizer codes by relaxing the Hermitian self-orthogonality
requirement. Their framework\, inspired by Construction X in the classical
setup\, yielded a number of better qubit codes than the previous best-kno
wn. These better codes came from applying their construction to specifical
ly chosen quaternary cyclic codes. Construction X for qubit codes generali
zes naturally to q-ary quantum codes.\nThis work uses self-orthogonal or n
early self-orthogonal quasi-cyclic codes over F4 and F9 as ingredients in
the quantum Construction X to derive good qubit and qutrit (3-ary quantum)
codes. We consider quasi-cyclic codes with large Hermitian hulls\, which
can be easily produced using their Chinese Remainder Theorem decomposition
. Such codes have a good chance to be implemented in actual quantum proces
sors. We exhibit quantum codes with parameters that strictly improve on th
e currently best-known ones and list those that match the best-known ones
in performance.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Madhu Sudan (Harvard University (Cambridge\, Massachusetts))
DTSTART:20200506T130000Z
DTEND:20200506T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/2
DESCRIPTION:Title: Codes for correcting editing errors\nby Madhu Sudan (Har
vard University (Cambridge\, Massachusetts)) as part of University of Zuri
ch (joint with Neuchatel) applied algebra seminars\n\n\nAbstract\nThe "edi
t distance''\, also known as the Levenstein distance\, between two strings
X\, Y over some alphabet Sigma\, is the minimum number of insertions and
deletions in X that will transform it to Y. For example if X = 01010101010
1 and Y = 101010101010\, then their Hamming distance is 12 while the edit
distance is 2 - since you can delete the first 0 in X and insert a 0 in th
e last position to get Y. In this talk we will consider the task of correc
ting editing errors\, i.e.\, the task of recovering X\, given a string Y o
btained from the transmission of X followed by a "few" editing errors.\nCo
ding theory has traditionally focussed mostly on correcting Hamming errors
and till recently the theory of coding for editing errors was far behind.
A recent series of works by Haeupler and Shaharasbi (with varying sets of
authors) has completely transformed this picture\, and brought us to the
stage where the results subsume what we know for the Hamming setting\, at
least for large constant sized alphabets! (Of course the proofs also use t
he state of the art results in the Hamming setting to get there.)\nIn this
talk\, I will use a recent theorem (from a paper with Haeupler and Shahra
sbi) as an excuse to talk about these developments. Our theorem shows that
for every delta < 1\, gamma < infinity and epsilon > 0\, there is an cons
tant q and an infinite family of q-ary codes of rate 1 - delta - epsilon w
hich can be list decoded in polynomial time from delta fraction deletions
and gamma "fraction" insertions. (Note that gamma\, the fraction of insert
ions can be much larger than 1!) Depending on availability of time we will
speak about the two main ingredients in this result: (1) The correspondin
g result in the Hamming setting (where we allow delta fraction deletions\,
but only allow same number of insertions in the same locations) which com
es from the Folded-Reed-Solomon-Codes of Guruswami and Rudra and the many
followups. (2) Synchronization strings\, which are magical ingredients int
roduced by Haeupler and Shahrasbi that convert codes for Hamming settings
into codes for editing errors.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kristin Lauter (Microsoft Research (Redmond\, Washington))
DTSTART:20200513T180000Z
DTEND:20200513T190000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/3
DESCRIPTION:Title: Supersingular Isogeny Graphs in Cryptography\nby Kristin
Lauter (Microsoft Research (Redmond\, Washington)) as part of University
of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbstract\nA
s we move towards a world which includes quantum computers which exist at
scale\, we are forced to consider the question of what hard problems in ma
thematics our next generation of cryptographic systems will be based on.
Supersingular Isogeny Graphs were proposed for use in cryptography in 2006
by Charles\, Goren\, and Lauter. Supersingular Isogeny Graphs are exampl
es of Ramanujan graphs\, which are optimal expander graphs. These graphs
have the property that relatively short walks on the graph approximate the
uniform distribution\, and for this reason\, walks on expander graphs are
often used as a good source of randomness in computer science. But the r
eason these graphs are important for cryptography is that finding paths in
these graphs\, i.e. routing\, is hard: there are no known subexponential
algorithms to solve this problem\, either classically or on a quantum comp
uter. For this reason\, cryptosystems based on the hardness of problems o
n Supersingular Isogeny Graphs are currently under consideration for stand
ardization in the NIST Post-Quantum Cryptography (PQC) Competition. This
talk will introduce these graphs\, the cryptographic applications\, and th
e various algorithmic approaches which have been tried to attack these sys
tems.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gretchen Mathews (Virginia Tech (Blacksburg\, VA))
DTSTART:20200527T140000Z
DTEND:20200527T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/4
DESCRIPTION:Title: Coding for local recovery\nby Gretchen Mathews (Virginia
Tech (Blacksburg\, VA)) as part of University of Zurich (joint with Neuch
atel) applied algebra seminars\n\n\nAbstract\nCodes with locality are desi
gned to recover erased symbols by accessing only a few others. Such codes
are useful in settings such as distributed storage where servers may routi
nely go offline for maintenance but users still need to access their infor
mation. This situation suggests that it is also desirable to have a variet
y of ways in which to recover a single symbol\, leading to the concept of
availability. In this talk\, we share recent work on codes from curves whi
ch provide locality and availability.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel Cabarcas Jaramillo (Universidad Nacional de Colombia (Bogot
a\, Kolumbien))
DTSTART:20200603T140000Z
DTEND:20200603T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/6
DESCRIPTION:Title: From Minrank Attack to generic Bilinear\nby Daniel Cabar
cas Jaramillo (Universidad Nacional de Colombia (Bogota\, Kolumbien)) as p
art of University of Zurich (joint with Neuchatel) applied algebra seminar
s\n\n\nAbstract\nThe Minrank (MR) problem is a computational problem close
ly related to attacks on code- and multivariate-based schemes. MR can be r
educed to a bilinear system of polynomial equations. In the quest to bette
r estimate the complexity of this approach\, we developed a more general t
heory for generic bilinear systems. In this presentation\, we show some of
the latest results for the complexity of MR and then\, we present some ge
neral results about bilinear systems.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Antonia Wachter-Zeh (TU Munich (Munich))
DTSTART:20200617T130000Z
DTEND:20200617T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/7
DESCRIPTION:Title: LIGA: A cryptosystem based on the hardness of rank-metric li
st and interleaved decoding.\nby Antonia Wachter-Zeh (TU Munich (Munic
h)) as part of University of Zurich (joint with Neuchatel) applied algebra
seminars\n\n\nAbstract\nWe propose the new rank-metric code-based cryptos
ystem LIGA which is based on the hardness of list decoding and interleaved
decoding of Gabidulin codes. LIGA is an improved variant of the Faure-Loi
dreau (FL) system\, which was broken in a structural attack by Gaborit\, O
tmani\, and Talé Kalachi (GOT\, 2018). We keep the FL encryption and decr
yption algorithms\, but modify the insecure key generation algorithm. Our
crucial observation is that the GOT attack is equivalent to decoding an in
terleaved Gabidulin code. The new key generation algorithm constructs publ
ic keys for which all polynomial-time interleaved decoders fail---hence LI
GA resists the GOT attack. We also prove that the public-key encryption ve
rsion of LIGA is IND-CPA secure in the standard model and the KEM version
is IND-CCA2 secure in the random oracle model\, both under hardness assump
tions of formally defined problems related to list decoding and interleave
d decoding of Gabidulin codes. We propose and analyze various exponential-
time attacks on these problems\, calculate their work factors\, and compar
e the resulting parameters to NIST proposals. The strengths of LIGA are sh
ort ciphertext sizes and (relatively) small key sizes. Further\, LIGA guar
antees correct decryption and has no decryption failure rate. It is not ba
sed on hiding the structure of a code. Since there are efficient and const
ant-time algorithms for encoding and decoding Gabidulin codes\, timing att
acks on the encryption and decryption algorithms can be easily prevented.\
n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Luca De Feo (IBM Research Zürich (Zürich))
DTSTART:20200429T140000Z
DTEND:20200429T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/8
DESCRIPTION:Title: Faster Evaluation of Isogenies of Large Prime Degree\nby
Luca De Feo (IBM Research Zürich (Zürich)) as part of University of Zur
ich (joint with Neuchatel) applied algebra seminars\n\n\nAbstract\nAn isog
eny is a non-zero morphism of elliptic curves. The isogeny evaluation prob
lem asks\, given a description of an isogeny φ:E→E' and of a point P∈
E\, to compute φ(P). It is a fundamental algorithmic problem in computati
onal number theory and has gained a fair amount of interest thanks to the
recent developments in isogeny-based cryptography.\nThe "atomic" case for
isogeny evaluation is that of isogenies of prime degree\, on top of which
algorithms for isogenies of any degree are easily constructed. For the pri
me degree case\, the classic solution is based on Vélu's formulas or any
of their optimized variants. Vélu's formulas take as input the kernel of
the isogeny\, e.g.\, as a list of points\, and output the isogeny as a pai
r of rational functions\, which are then used to evaluate the isogeny at t
he point. This algorithm can be implemented in time linear in the isogeny
degree\, which is asymptotically optimal in general\; however in the funda
mental case where the kernel can be described by a single generator over t
he base field\, one could hope to find a more efficient algorithm which si
desteps the computation of the rational functions.\nThis is exactly what I
will present in this talk: starting from a very simple idea\, already use
d by Pollard\, Strassen\, and Chudnovsky²\, among others\, I will present
a baby-step/giant-step algorithm that solves the isogeny evaluation probl
em in time and space proportional to the square root of the degree. I will
explain why this is important for isogeny-based cryptography\, and highli
ght several applications where the new algorithm produces practical speedu
ps ranging from the unimpressive to the spectacular.\nThis is joint work w
ith D.J. Bernstein\, A. Leroux and B. Smith\, the preprint can be found at
https://ia.cr/2020/341.\n(**This talk will be live streamed at https://de
feo.lu/tube/**)\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Markus Grassl (International Centre for Theory of Quantum Technolo
gies)
DTSTART:20200610T140000Z
DTEND:20200610T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/9
DESCRIPTION:Title: On Quantum MDS Codes\nby Markus Grassl (International Ce
ntre for Theory of Quantum Technologies) as part of University of Zurich (
joint with Neuchatel) applied algebra seminars\n\n\nAbstract\nA quantum er
ror-correcting code (QECC)\, denoted by ((n\,K\,d))q\, is a K-dimensional
subspace of the complex vector space Cq⊗n that is able to correct up do
d-1 erasures. A quantum MDS (QMDS) code is a code of maximal possible dime
nsion meeting the quantum Singleton bound logqK ≤ n+2-2d. Most known QMD
S codes are based on Hermitian self-orthogonal classical MDS codes. It has
recently been shown [3] that regardless of the underlying construction\,
QMDS codes share many (but not all) properties with their classical counte
rparts. The QMDS conjecture states that the length of nontrivial codes is
bounded by q2+1 (or q2+2 in special cases). While QMDS codes of maximal le
ngth are known for many cases\, it appears to be difficult to find codes o
f distance d > q+1 (see [1\,2]).\nThe talk addresses the question of findi
ng QMDS codes in general and presents a couple of related open questions i
n algebraic coding theory.\n\n[1] Ball\, Simeon\, "Some constructions of q
uantum MDS codes''\, preprint arXiv:1907.04391\, (2019).\n[2] Grassl\, Mar
kus and Roetteler\, Martin\, "Quantum MDS Codes over Small Fields''\, Proc
eedings 2015 IEEE International Symposium on Information Theory (ISIT 2015
)\, pp. 1104--1108\, (2015). DOI: 10.1109/ISIT.2015.7282626\, preprint arX
iv:1502.05267.\n[3] Huber\, Felix and Grassl\, Markus\, "Quantum Codes of
Maximal Distance and Highly Entangled Subspaces''\, preprint arXiv:1907.07
733\, (2019).\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alain Couvreur (Ecole polytechnique (Palaiseau\, France))
DTSTART:20200520T130000Z
DTEND:20200520T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/10
DESCRIPTION:Title: On the code equivalence problem in rank metric\nby Alai
n Couvreur (Ecole polytechnique (Palaiseau\, France)) as part of Universit
y of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbstract\
nThe code equivalence problem can roughly be stated as follows : "Given tw
o codes \\(C_1\\)\, \\(C_2\\)\, is there an isometry \\(\\phi\\) of the am
bient space such that \\(\\phi(C_1) = C_2\\)?" In Hamming metric\, this pr
oblem has been intensively studied in the last decades\, with in particula
r the {\\it support splitting algorithm} by N. Sendrier which solves this
problem in the generic case when the isometry \\(\\phi\\) is a permutation
. On the rank metric side\, the linear isometries of the ambient space are
classified and various algebraic invariants related to a given matrix spa
ce have been identified. In this talk\, we will focus on the algorithmic a
spects of the code equivalence problem in rank metric by focusing on three
versions: 1. \\(\\mathbb{F}_{q^m}\\)--linear codes with a vector represen
tation 2. \\(\\mathbb{F}_{q^m}\\)--linear codes with a matrix representati
on 3. Non structured matrix spaces. We propose efficient algorithms to sol
ve versions (1) and (2) of the problem. Then we prove that (3) is at least
as hard as the monomial equivalence problem in Hamming metric. This is a
work in progress in collaboration with Thomas Debris-Alazard (Royal Hollow
ay\, London) and Philippe Gaborit (University of Limoges).\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alfred Wassermann (University of Bayreuth (Bayreuth\, Germany))
DTSTART:20200701T140000Z
DTEND:20200701T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/11
DESCRIPTION:Title: Designs\, subspace designs and their codes\nby Alfred W
assermann (University of Bayreuth (Bayreuth\, Germany)) as part of Univers
ity of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbstrac
t\nIn this talk\, we give an overview of combinatorial designs\, their q-a
nalogues and related structures. Design theory has a venerable history sta
rting in the 1830s. The connection between combinatorial designs and linea
r error correcting codes is well studied. In recent years\, subspace desig
ns - also called q-analogues of designs - regained interest because of the
ir application as subspace codes in random network coding\, which led to m
any new results on structural properties of the subspace designs. Moreover
\, it turns out that also the linear codes spanned by the rows of the inci
dence matrix of subspace designs are interesting. Another important class
of subspaces codes is lifted MRD codes. Surprisingly\, lifted MRD codes ca
n be regarded as transversal designs and the resulting linear codes can be
studied\, too. These codes may be useful as so called PIR codes for priva
te information retrieval.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel Panario (Carleton University)
DTSTART:20200729T140000Z
DTEND:20200729T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/13
DESCRIPTION:Title: Analytic and Probabilistic Combinatorics for Polynomials ov
er Finite Fields\nby Daniel Panario (Carleton University) as part of U
niversity of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nA
bstract\nThe central objects of this talk are univariate polynomials over
finite fields. We survey methods and results to count polynomials satisfyi
ng certain properties\, and to understand their random behaviour.\nWe firs
t comment on a methodology from analytic combinatorics that allows the stu
dy of the decomposition of polynomials into irreducible factors\, the deri
vation of algorithmic properties\, and the estimation of average-case anal
ysis of algorithms. This methodology can be naturally used to provide prec
ise information on the factorization of polynomials into its irreducible f
actors similar to the classical problem of the decomposition of integers i
nto primes. Examples of these results are provided. The shape of a random
univariate polynomial over a finite field is also given. As an example of
the methodology\, periodicity properties of the iterations of random polyn
omials over finite fields\, related to Pollard rho method\, are commented.
\nThen\, if time allows\, we briefly show several results for random polyn
omials over finite fields that were obtained using other methodologies bas
ed on probabilistic combinatorics. We conclude providing open problems for
polynomials over finite fields related to number theory.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marc Newman (Master thesis defense)
DTSTART:20200826T130000Z
DTEND:20200826T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/17
DESCRIPTION:Title: A Study of Mathematical and Practical Aspects of SIDH and C
SIDH\nby Marc Newman (Master thesis defense) as part of University of
Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbstract\nIn t
his thesis\, we consider two different supersingular isogeny-based Diffie-
Hellman schemes: SIDH and CSIDH. We review the fundamental definitions und
erpinning isogeny-based cryptography including Diffie-Hellman key exchange
\, elliptic curves\, algebraic number theory\, and graph theory providing
various examples supported by SageMath. We cover the mathematical bases\,
protocols\, and hardness assumptions of SIDH and CSIDH as well as surveyin
g some numerical analysis of the practical uses of the schemes from the li
terature. We review additional cryptographic schemes and applications whic
h also utilize isogenies and offer a brief direct comparison between SIDH
and CSIDH. Finally\, we state certain open questions pertaining to approac
hes to better understanding isogeny-based cryptography using related branc
hes of mathematics.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Amin Shokrollahi (EPFL (Switzerland))
DTSTART:20201021T130000Z
DTEND:20201021T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/18
DESCRIPTION:Title: Chord Signaling\nby Amin Shokrollahi (EPFL (Switzerland
)) as part of University of Zurich (joint with Neuchatel) applied algebra
seminars\n\n\nAbstract\nCommunication of data on electrical wires between
chips is fast gaining prominence in the electronics industry. Because most
of the components of the transmitter and the receiver of such links are a
nalog\, rather than digital\, they don’t benefit as much from Moore’s
law. On the other hand\, the need to transmit data ever faster calls for h
igher rates of transmission over existing electrical wires. Since in this
type of communication\, noise is highly frequency dependent\, higher trans
mission rates lead to much higher noise\, and therefore a much higher grow
th of power consumption than linear. The industry has long recognised this
problem as the “Interconnect bottleneck”. Fundamental solutions to th
is important problem have remained elusive\, however. A look at the capaci
ty of these channels reveals that today we are only transmitting at anywhe
re between 1% to 4% of the capacity. Therefore\, at least on the surface\,
there is a lot to be gained by applying methods from communication theory
to this problem. However\, unlike many other systems such as wireless\, D
SL\, satellite\, or optical communication\, the constraints on the chip-to
-chip communication system are very different: transmission rates are typi
cally 1000 times those encountered in wireless communication. On the other
hand\, the energy consumed for the transmission and recovery of each bit
is about 1000 times less than what is customary in wireless. Also\, latenc
y requirements are extremely stringent\, allowing only latencies up to ver
y few nanoseconds. Therefore\, it is not possible to use fancy processing
methods. In this talk I will introduce a new modulation scheme for chip-to
-chip communication which we call chordal codes. These codes are somewhat
reminiscent of spatial MIMO systems\, and provide a first step towards a b
etter utilisation of the available communication bandwidth between chips.
Current implementations of systems based on these codes show a large reduc
tion of total power of the communication PHY and a large increase of the c
ommunication speed compared to other classical systems.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michel Lavrauw (Sabanci University)
DTSTART:20201118T140000Z
DTEND:20201118T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/19
DESCRIPTION:Title: Tensors in Finite Geometry\nby Michel Lavrauw (Sabanci
University) as part of University of Zurich (joint with Neuchatel) applied
algebra seminars\n\n\nAbstract\nThe concept of tensor products is ubiquit
ous in the scientific literature. In this talk\, we restrict our attention
to the tensor product of a finite number of finite-dimensional vector spa
ces. The bulk of the research on such tensor products assumes the underlyi
ng field to be the real numbers or the complex numbers.\nWith the advancem
ent of our knowledge and technology\, the need for efficient algorithms to
verify certain properties or compute numerical data from a given tensor h
as become a very popular research topic. In the first part of this talk\,
we will give a short introduction explaining the main concepts and researc
h problems.\nIn the second part\, we will focus on the case where the unde
rlying field is finite.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Amin Sakzad (Monash University (Melbourne\, Australia))
DTSTART:20201125T090000Z
DTEND:20201125T100000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/20
DESCRIPTION:Title: Middle-product learning with errors (MP-LWE): foundations\,
applications\, and implementations\nby Amin Sakzad (Monash University
(Melbourne\, Australia)) as part of University of Zurich (joint with Neuc
hatel) applied algebra seminars\n\n\nAbstract\nIn this talk\, I will intro
duce a new variant\, MP-LWE\, of the Learning With Errors problem (LWE) ma
king use of the Middle Product between polynomials modulo an integer q. We
exhibit a reduction from the Polynomial-LWE problem (PLWE) parametrized b
y a polynomial f\, to MP-LWE\, which is defined independently of any such
f. We also explore some applications of different variants of MP-LWE into
Titanium\, a public-key encryption (PKE) scheme and MPSign\, a digital sig
nature scheme proven secure in the quantum random oracle model (QROM). If
time allows\, I will introduce FACCT\, a fast\, compact and constant-time
implementation technique in lattice-based crypto with applications to well
-established PKE and DS schemes.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sabrina Sewer (University of Zurich)
DTSTART:20201125T140000Z
DTEND:20201125T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/21
DESCRIPTION:Title: Post-Quantum Cryptosystem FrodoPKE Based on the Learning wi
th Errors Problem (Masters thesis defense)\nby Sabrina Sewer (Universi
ty of Zurich) as part of University of Zurich (joint with Neuchatel) appli
ed algebra seminars\n\n\nAbstract\nIn view of the ongoing research on quan
tum computers\, which will be able to break many of the cryptographic syst
ems in use today\, the National Institute of Standardization and Technolog
y (NIST) has initiated a process to evaluate and standardize one or more q
uantum-resistant public-key encryption schemes. In this thesis\, we consid
er one of the submitted proposals\, the lattice-based encryption scheme Fr
odoPKE\, which is based on the learning with errors problem (LWE). LWE has
been extensively studied and cryptanalyzed by countless works. It is conj
ectured to be hard to solve based on assumptions about the worst-case hard
ness of standard lattice problems like GapSVP or SIVP. After an overview o
n the various hardness results on LWE and its versatility\, we closely exa
mine the design of FrodoPKE and its implementation. Finally\, we derive th
e optimal parameters and show the impact of a single parameter on the secu
rity.In view of the ongoing research on quantum computers\, which will be
able to break many of the cryptographic systems in use today\, the Nationa
l Institute of Standardization and Technology (NIST) has initiated a proce
ss to evaluate and standardize one or more quantum-resistant public-key en
cryption schemes. In this thesis\, we consider one of the submitted propos
als\, the lattice-based encryption scheme FrodoPKE\, which is based on the
learning with errors problem (LWE). LWE has been extensively studied and
cryptanalyzed by countless works. It is conjectured to be hard to solve ba
sed on assumptions about the worst-case hardness of standard lattice probl
ems like GapSVP or SIVP. After an overview on the various hardness results
on LWE and its versatility\, we closely examine the design of FrodoPKE an
d its implementation. Finally\, we derive the optimal parameters and show
the impact of a single parameter on the security.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Francesco Pavese (POLYTECHNIC OF BARI (Italy))
DTSTART:20201202T140000Z
DTEND:20201202T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/22
DESCRIPTION:Title: On cutting blocking sets and their codes\nby Francesco
Pavese (POLYTECHNIC OF BARI (Italy)) as part of University of Zurich (join
t with Neuchatel) applied algebra seminars\n\n\nAbstract\nLet PG(r\, q) be
the r-dimensional projective space over the \nfinite fi\neld GF(q). A set
Χ of points of PG(r\, q) is a cutting blocking set if for each hyperplan
e Π of PG(r\, q) the set Π ∩ Χ spans Π. Cutting blocking sets give
rise to saturating sets and minimal linear codes. Of particular interest
are those having a size as small as possible. In this talk\, I will discus
s known constructions of cutting blocking sets\, from which there arise mi
nimal linear codes whose length grows linearly with respect to their dimen
sion. I will also present two new constructions of cutting blocking sets w
hose sizes are smaller than the known ones.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eduardo Camps (University of Neuchâtel (Neuchâtel))
DTSTART:20201209T140000Z
DTEND:20201209T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/23
DESCRIPTION:Title: Monomial Decreasing Codes\nby Eduardo Camps (University
of Neuchâtel (Neuchâtel)) as part of University of Zurich (joint with N
euchatel) applied algebra seminars\n\n\nAbstract\nIn this talk\, beginning
with the original construction of polar codes\, we explore the monomial d
ecreasing codes as a generalization of those in channels with strong symme
try. We analyze their parameters and their relation with other well-known
families of codes.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Martino Borello (Université de Paris 8 (Paris))
DTSTART:20201216T140000Z
DTEND:20201216T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/24
DESCRIPTION:Title: Asymptotic performance of G-codes and uncertainty principle
.\nby Martino Borello (Université de Paris 8 (Paris)) as part of Univ
ersity of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbst
ract\nThe uncertainty principle is a very famous inequality in Physics\, S
ignal Processing\, and Harmonic Analysis. It compares the supports of func
tions and of their complex-valued Fourier transforms. In a recent paper by
Evra\, Kowalski\, and Lubotzky a connection between the uncertainty princ
iple and the asymptotic performance of cyclic codes was pointed out. Note
that the existence of an asymptotically good family of cyclic codes is a p
roblem open for more than half a century. In the first part of the talk\,
we will present some recent results about the asymptotic performance of gr
oup codes\, which are a generalization of cyclic codes. In the second part
\, we will give an overview of conjectural and proved results about the un
certainty principle over finite fields. A naive version of this principle\
, which is verified by any finite field\, implies that there exist sequenc
es of cyclic codes of length n\, arbitrary rate\, and minimum distance Ω(
n^α) for all 0 < α < 1/2.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Katerina Mitrokotsa (University of St. Gallen)
DTSTART:20210217T140000Z
DTEND:20210217T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/25
DESCRIPTION:Title: Outsourcing computations to a cloud that you don't trust\nby Katerina Mitrokotsa (University of St. Gallen) as part of University
of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbstract\n
In this talk\, we discuss the problem of outsourcing computations to untru
sted servers in multiple settings (i.e.\, multiple clients\, multiple serv
ers). More precisely\, we discuss three new cryptographic primitives\, ver
ifiable homomorphic secret sharing\, homomorphic multi-key authenticators
and homomorphic signcryption. The first two can be used when multiple clie
nts want to outsource joint computations\, while the third when both verif
iability and proof of the data's authenticity need to be provided. We prov
ide highlights on the proposed cryptographic constructions and discuss the
main challenges that are overcome when we employ them.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andreia Venzin (University of Zurich)
DTSTART:20210224T140000Z
DTEND:20210224T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/26
DESCRIPTION:Title: Castelnuovo-Mumford Regularity and the Complexity of Gröbn
er Basis Algorithms (Master's thesis defense)\nby Andreia Venzin (Univ
ersity of Zurich) as part of University of Zurich (joint with Neuchatel) a
pplied algebra seminars\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sebastian Heri ((Solothurn))
DTSTART:20210303T140000Z
DTEND:20210303T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/27
DESCRIPTION:Title: Classification and Construction of Self-Dual Convolutional
Codes (Master's thesis defense)\nby Sebastian Heri ((Solothurn)) as pa
rt of University of Zurich (joint with Neuchatel) applied algebra seminars
\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Magali Bardet (University of Rouen (DIR) (Rouen))
DTSTART:20210310T140000Z
DTEND:20210310T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/28
DESCRIPTION:Title: Algebraic Attacks for solving the Rank Decoding and Minrank
problems\nby Magali Bardet (University of Rouen (DIR) (Rouen)) as par
t of University of Zurich (joint with Neuchatel) applied algebra seminars\
n\n\nAbstract\nIn this talk\, I will present the recent improvements in al
gebraic techniques for solving the MinRank problem\, which is ubiquitous i
n multivariate and rank metric code based cryptography. Algebraic attacks
now outperform the combinatorial ones that were considered state of the ar
t up until now. In the particular case of Fqm-linear codes in rank metric\
, for solving the Rank Decoding problem\, the attack is even more efficien
t\, and completely break the parameters of various schemes submitted to th
e NIST-PQC standardisation process for quantum-resistant public key crypto
graphy.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/28/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Umberto Martinez-Penas (University of Neuchâtel (Switzerland))
DTSTART:20210317T140000Z
DTEND:20210317T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/29
DESCRIPTION:Title: Constructions of Codes in the Sum-Rank Metric\nby Umber
to Martinez-Penas (University of Neuchâtel (Switzerland)) as part of Univ
ersity of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbst
ract\nThe sum-rank metric simultaneously extends the Hamming metric and th
e rank metric. Thus it provides a general theory that includes both classi
cal and rank-metric codes. In this talk\, we will present several construc
tions of Maximum Sum-Rank Distance (MSRD) codes. Each of these codes outpe
rforms all possible MRD codes in the applications\, as they require polyno
mial field sizes (in contrast with exponential field sizes for MRD codes).
Our constructions include our previous construction of linearized Reed-So
lomon codes\, which simultaneously generalize Reed-Solomon codes and Gabid
ulin codes. At the end\, we will present Sum-Rank BCH codes\, a family of
subfield subcodes of linearized Reed-Solomon codes with small field sizes
and good parameters\, and which extend classical BCH codes.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alberto Ravagnani (Eindhoven University of Technology (Eindhoven))
DTSTART:20210324T140000Z
DTEND:20210324T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/30
DESCRIPTION:Title: The Sparseness of MRD Codes\nby Alberto Ravagnani (Eind
hoven University of Technology (Eindhoven)) as part of University of Zuric
h (joint with Neuchatel) applied algebra seminars\n\n\nAbstract\nAn open q
uestion in coding theory asks whether or not MRD codes with the rank metri
c are dense as the field size tends to infinity. In this talk\, I will bri
efly survey this problem and its connections with the theory of spectrum-f
ree matrices and semifields. I will then describe a new combinatorial meth
od to obtain upper and lower bounds for the number of codes of prescribed
parameters\, based on the interpretation of optimal codes as the common co
mplements of a family of linear spaces. In particular\, I will answer the
above question in the negative\, showing that MRD codes are almost always
(very) sparse as the field size grows. The approach offers an explanation
for the strong divergence in the behaviour of MDS and MRD codes with respe
ct to density properties. I will also present partial results on the spars
eness of MRD codes as their column length tends to infinity. The new resul
ts in this talk are joint work with A. Gruica.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/30/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Stefan Tohaneanu (University of Idaho (Idaho))
DTSTART:20210331T140000Z
DTEND:20210331T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/31
DESCRIPTION:Title: Linear codes with prescribed projective codewords of minimu
m weight\nby Stefan Tohaneanu (University of Idaho (Idaho)) as part of
University of Zurich (joint with Neuchatel) applied algebra seminars\n\n\
nAbstract\nConsider $C$\, an $[n\,k\,d]$-linear code. Every projective cod
eword of minimum weight $d$ corresponds to a point in $\\mathbb P^{k-1}$\,
and there are strong connections between the algebraic and geometric prop
erties of these points and the parameters of $C$\, especially with the min
imum distance $d$. The most non-trivial connection is the fact that the Ca
stelnuovo-Mumford regularity of the coordinate ring of these points is a l
ower bound for $d$. Conversely\, given a finite set of points $X$ in $\\ma
thbb P^{k-1}$\, it is possible to construct linear codes with projective c
odewords of minimum weight corresponding to $X$. We will discuss about the
se constructions\, and we will also look at the particular case when the c
onstructed linear code has minimum distance equal to the regularity.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/31/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hunter Lehmann (University of Kentucky (Kentucky))
DTSTART:20210421T130000Z
DTEND:20210421T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/32
DESCRIPTION:Title: Automorphisms of Cyclic Orbit Codes\nby Hunter Lehmann
(University of Kentucky (Kentucky)) as part of University of Zurich (joint
with Neuchatel) applied algebra seminars\n\n\nAbstract\nCyclic orbit code
s 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 Si
nger subgroup. We are interested in classifying the isometry classes of th
ese codes for various parameters. In order to do this\, we show that the a
utomorphism group of a cyclic orbit code is heavily related to the smalles
t subfield of the ambient field which contains a generating subspace for t
he code. When there is no proper subgroup of the ambient field containing
a generator for the code\, we see that any possible isometry is an element
of the normalizer of the Singer subgroup.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/32/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Romy Minko (University of Oxford (Oxford\, UK))
DTSTART:20210428T130000Z
DTEND:20210428T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/33
DESCRIPTION:Title: Connections between cryptography and quantum gate synthesis
\nby Romy Minko (University of Oxford (Oxford\, UK)) as part of Univer
sity of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbstra
ct\nWith advancements in quantum computing\, the search for efficient algo
rithms for synthesising gates (the building blocks of quantum algorithms)
using cost-effective gate sets has become an important area of research. I
nterestingly\, the problems underlying gate synthesis have a number of con
nections with cryptography. The first half of this talk will cover the his
tory of research in this area and an overview of the main concepts. In the
second half\, I will present recent advancements in quantum gate synthesi
s\, which adapt path-finding results from cryptography. This talk is aimed
at researchers without a background in quantum computing\, so will be fai
rly introductory.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/33/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Igor Semaev (University of Bergen (Norway))
DTSTART:20210505T130000Z
DTEND:20210505T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/34
DESCRIPTION:Title: EHT public-key crypto-system and digital signatures\nby
Igor Semaev (University of Bergen (Norway)) as part of University of Zuri
ch (joint with Neuchatel) applied algebra seminars\n\n\nAbstract\nTwo work
s will be surveyed: "New Public-Key Crypto-System EHT" (A.Budroni\, I.Sema
ev) and "EHT Digital Signature Algorithm" (I.Semaev). The LWE (Learning wi
th Errors) problem was introduced by Regev in 2005\, where an LWE based pu
blic-key encryption was described. The problem was there proved to be hard
assuming the hardness of computing shortest non-zero vectors in general l
attices. Since then several lattice-based public-key crypto-systems were i
nvented. The NIST Post-Quantum Standardisation Process stimulated interest
in developing new quantum computer resistant public-key protocols. A numb
er of submissions to this competition are LWE or Ring LWE based. In the fi
rst work\, an LWE problem with a hidden trapdoor is introduced. It is used
to construct a new efficient public-key crypto-system EHT. The new system
may be used as a KEM (Key Encapsulating Mechanism) too. It is significant
ly different from LWE based NIST public-key encryption candidates\, e.g.\,
FrodoKEM. The performance of EHT compares favourably with FrodoKEM. In th
e second work\, a similar idea is used to construct a new digital signatur
e algorithm. It is significantly different from NIST digital signature can
didates. Forging EHT signatures may be reduced to solving Closest Vector P
roblem for a specific lattice with a small approximation factor. The param
eters of the new system are comparable to those of the NIST candidates.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/34/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Habibul Islam (Indian Institute of Technology Patna (Bihar\, India
))
DTSTART:20210512T110000Z
DTEND:20210512T120000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/35
DESCRIPTION:Title: Construction of Quantum Codes using Constacyclic Codes\
nby Habibul Islam (Indian Institute of Technology Patna (Bihar\, India)) a
s part of University of Zurich (joint with Neuchatel) applied algebra semi
nars\n\n\nAbstract\nThere are several convenient ways to construct quantum
codes from classical codes\, the CSS and Hermitian construction are two p
opular among them. Here\, we describe how classical (particularly\, consta
cyclic) codes have been successfully producing new and better quantum code
s under these constructions. First\, we implement the idea over finite fie
lds and then extend to non-commutative rings followed by commutative rings
. From an application point of view\, many quantum codes outperforming the
best-known codes are constructed.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/35/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vincent Neiger (Université de Limoges (France))
DTSTART:20210519T130000Z
DTEND:20210519T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/36
DESCRIPTION:Title: Faster modular composition of polynomials\nby Vincent N
eiger (Université de Limoges (France)) as part of University of Zurich (j
oint with Neuchatel) applied algebra seminars\n\n\nAbstract\nThis talk is
about algorithms for modular composition of univariate polynomials\, and f
or computing minimal polynomials. For two univariate polynomials a and g o
ver a commutative field\, modular composition asks to compute h(a) mod g f
or some given h\, while the minimal polynomial problem is to compute h of
minimal degree such that h(a) = 0 mod g. We propose algorithms whose compl
exity bound improves upon previous algorithms and in particular upon Brent
and Kung's approach (1978)\; the new complexity bound is subquadratic in
the degree of g and a even when using cubic-time matrix multiplication. Ou
r improvement comes from the fast computation of specific bases of bivaria
te ideals\, and from efficient operations with these bases thanks to fast
univariate polynomial matrix algorithms. We report on preliminary experime
ntal results using our new Polynomial Matrix Library ( https://github.com/
vneiger/pml ). Contains joint work with Seung Gyu Hyun\, Bruno Salvy\, Eri
c Schost\, Gilles Villard.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/36/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sven Puchinger (Technische Universität München (München))
DTSTART:20210526T130000Z
DTEND:20210526T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/37
DESCRIPTION:by Sven Puchinger (Technische Universität München (München)
) as part of University of Zurich (joint with Neuchatel) applied algebra s
eminars\n\n\nAbstract\nLinearized Reed-Solomon (LRS) codes are sum-rank-me
tric codes that fulfill the Singleton bound with equality. In the two extr
eme cases of the sum-rank metric\, they coincide with Reed–Solomon codes
(Hamming metric) and Gabidulin codes (rank metric). List decoding in thes
e extreme cases is well-studied\, and the two code classes behave very dif
ferently in terms of list size\, but nothing is known for the general case
. In this talk\, we derive a lower bound on the list size for LRS codes\,
which is\, for a large class of LRS codes\, exponential directly above the
Johnson radius. Furthermore\, we show that some families of linearized Re
ed–Solomon codes with constant numbers of blocks cannot be list decoded
beyond the unique decoding radius. The results are joint work with Johan R
osenkilde.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/37/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Giuseppe Cotardo (University College Dublin (Dublin\, Ireland))
DTSTART:20211006T130000Z
DTEND:20211006T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/38
DESCRIPTION:Title: Parameters of Codes for the Binary Asymmetric Channel\n
by Giuseppe Cotardo (University College Dublin (Dublin\, Ireland)) as part
of University of Zurich (joint with Neuchatel) applied algebra seminars\n
\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/38/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hiram Lopez Valdez (Cleveland State University (Ohio))
DTSTART:20211013T130000Z
DTEND:20211013T140000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/39
DESCRIPTION:Title: The dual of an evaluation code\nby Hiram Lopez Valdez (
Cleveland State University (Ohio)) as part of University of Zurich (joint
with Neuchatel) applied algebra seminars\n\n\nAbstract\nIn this talk we st
udy the dual and the algebraic dual of an evaluation code using standard m
onomials and indicator functions. We show that the dual of an evaluation c
ode is the evaluation code of the algebraic dual. Given linear codes C1 an
d C2 spanned by standard monomials\, we describe a combinatorial condition
to determine if C2 is monomially equivalent to the dual of C1. Moreover\,
we give an explicit description of a generator matrix of the dual of C_1
in terms of that of C_1 and coefficients of indicator functions. This is a
joint work with Ivan Soprunov and Rafael H. Villarreal.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/39/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ferdinando Zullo (Università degli Studi della Campania "Luigi Va
nvitelli" (Italy))
DTSTART:20211103T140000Z
DTEND:20211103T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/40
DESCRIPTION:Title: Linear sets in coding theory\nby Ferdinando Zullo (Univ
ersità degli Studi della Campania "Luigi Vanvitelli" (Italy)) as part of
University of Zurich (joint with Neuchatel) applied algebra seminars\n\n\n
Abstract\nLinear 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 to construct some examples of blocking set
s\, which are now known as linear blocking sets. In recent years\, they ha
ve been intensively used to construct\, to classify and to characterize ma
ny different geometrical and algebraic objects like two-intersection sets\
, complete caps\, translation spreads of the Cayley Generalized Hexagon\,
translation ovoids of polar spaces\, semifield flocks\, finite semifields
and linear codes. In this talk we will explore how the geometry of linear
sets can give constructions and classification results in coding theory.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/40/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Margreta Kuijper (The University of Melbourne (Melbourne\, Austral
ia))
DTSTART:20211110T090000Z
DTEND:20211110T100000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/41
DESCRIPTION:Title: Coding for packet erasure channels\nby Margreta Kuijper
(The University of Melbourne (Melbourne\, Australia)) as part of Universi
ty of Zurich (joint with Neuchatel) applied algebra seminars\n\n\nAbstract
\nPacket 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 cont
ent. Channel coding provides a way to recover much of this content and thu
s protect against the impact of packet losses. The straightforward choice
is then for MDS block codes. When coding against burst erasure patterns\,
a larger playing field is provided by the class of convolutional codes and
it has been shown that these can also be optimal. In many modern interact
ive applications\, such as interactive video and telesurgery\, there are r
equirements to optimize latency\, throughput and error rate. Since 2004 tw
o different approaches to the coding of packets have emerged in the litera
ture. In this talk I review some of the results obtained in each of these
approaches. In all of the approaches the decoding delay time is explicitly
involved. This area currently attracts attention because of its relevance
to ULLC\, ultra-reliable low-latency communications.\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/41/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Roxana Smarandache (University of Notre Dame (Indiana USA))
DTSTART:20211117T140000Z
DTEND:20211117T150000Z
DTSTAMP:20260404T110744Z
UID:AppliedAlgebra/42
DESCRIPTION:by Roxana Smarandache (University of Notre Dame (Indiana USA))
as part of University of Zurich (joint with Neuchatel) applied algebra se
minars\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/AppliedAlgebra/42/
END:VEVENT
END:VCALENDAR