activity
20072022
most citedLinear-Programming Decoding of Nonbinary Linear Codes

67 citations · 110 across the 23 of their papers we have counts for

collaborators
Showing cs.ITShow all

15 papers · 1 filter

cs.IT2021

Tensor Codes and their Invariants

Eimear Byrne, Giuseppe Cotardo

In 1991, Roth introduced a natural generalization of rank metric codes, namely tensor codes. The latter are defined to be subspaces of -tensors where the ambient space is endowe…

cs.IT2021

Bounds in the Lee Metric and Optimal Codes

Eimear Byrne, Violetta Weger

In this paper we investigate known Singleton-like bounds in the Lee metric and characterize optimal codes, which turn out to be very few. We then focus on Plotkin-like bounds in th…

cs.IT2021

Density of Free Modules over Finite Chain Rings

Eimear Byrne, Anna-Lena Horlemann, Karan Khathuria +1

In this paper we focus on modules over a finite chain ring of size . We compute the density of free modules of , where we separately treat the asy…

cs.IT2021

Bilinear Complexity of 3-Tensors Linked to Coding Theory

Eimear Byrne, Giuseppe Cotardo

A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a…

cs.IT2020

Fundamental Properties of Sum-Rank Metric Codes

Eimear Byrne, Heide Gluesing-Luerssen, Alberto Ravagnani

This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived…

cs.IT2019

Rank-Metric Codes, Generalized Binomial Moments and their Zeta Functions

Eimear Byrne, Giuseppe Cotardo, Alberto Ravagnani

In this paper we introduce a new class of extremal codes, namely the -BMD codes. We show that for this family several of the invariants are determined by the parameters of the u…