Eimear Byrne

Orcid: 0000-0002-1857-0365

According to our database1, Eimear Byrne authored at least 51 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Weighted Subspace Designs from <i>q</i>-Polymatroids.
J. Comb. Theory A, January, 2024

2023
Tensor Codes and Their Invariants.
SIAM J. Discret. Math., September, 2023

Bounds in the Lee metric and optimal codes.
Finite Fields Their Appl., March, 2023

Straggler- and Adversary-Tolerant Secure Distributed Matrix Multiplication Using Polynomial Codes.
Entropy, February, 2023

Constructions of new matroids and designs over ${\mathbb {F}}_q$.
Des. Codes Cryptogr., February, 2023

The Critical Theorem for q-Polymatroids.
CoRR, 2023

2022
Constructions of new <i>q</i>-cryptomorphisms.
J. Comb. Theory B, 2022

Saturating systems and the rank covering radius.
CoRR, 2022

The Cyclic Flats of a q-Matroid.
CoRR, 2022

2021
Fundamental Properties of Sum-Rank-Metric Codes.
IEEE Trans. Inf. Theory, 2021

Density of Free Modules over Finite Chain Rings.
CoRR, 2021

Bilinear Complexity of 3-Tensors Linked to Coding Theory.
CoRR, 2021

2020
Partition-balanced families of codes and asymptotic enumeration in coding theory.
J. Comb. Theory A, 2020

2019
An Assmus-Mattson Theorem for Rank Metric Codes.
SIAM J. Discret. Math., 2019

Tensor Representation of Rank-Metric Codes.
SIAM J. Appl. Algebra Geom., 2019

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

2018
Induced weights on quotient modules and an application to error correction in coherent networks.
Finite Fields Their Appl., 2018

Rank metric codes and zeta functions.
Des. Codes Cryptogr., 2018

Algebraic Coding Theory for Networks, Storage, and Security (Dagstuhl Seminar 18511).
Dagstuhl Reports, 2018

2017
Error Correction for Index Coding With Coded Side Information.
IEEE Trans. Inf. Theory, 2017

Covering Radius of Matrix Codes Endowed with the Rank Metric.
SIAM J. Discret. Math., 2017

Bounding the Optimal Rate of the ICSI and ICCSI problem.
SIAM J. Discret. Math., 2017

2016
Two-weight codes, graphs and orthogonal arrays.
Des. Codes Cryptogr., 2016

Coding Theory in the Time of Big Data (Dagstuhl Seminar 16321).
Dagstuhl Reports, 2016

A Graph Theoretical Analysis of Low-Power Coding Schemes for One-Hop Networks.
CoRR, 2016

2013
Algebraic decoding of negacyclic codes over $${\mathbb Z_4}$$.
Des. Codes Cryptogr., 2013

2012
Properties of codes with two homogeneous weights.
Finite Fields Their Appl., 2012

On coding schemes for wireless body area networks.
Proceedings of the International Symposium on Communications and Information Technologies, 2012

2011
On the equivalence of quadratic APN functions.
Des. Codes Cryptogr., 2011

Algebraic Decoding of Negacyclic Codes Over Z<sub>4</sub>
CoRR, 2011

A few more quadratic APN functions.
Cryptogr. Commun., 2011

On the weight distribution of codes over finite rings.
Adv. Math. Commun., 2011

A graph theoretical approach for network coding in wireless body area networks.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
New bounds for codes over finite Frobenius rings.
Des. Codes Cryptogr., 2010

2009
Linear-programming decoding of nonbinary linear codes.
IEEE Trans. Inf. Theory, 2009

Fourier Spectra of Binomial APN Functions.
SIAM J. Discret. Math., 2009

Gröbner Bases over Commutative Rings and Applications to Coding Theory.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
New families of quadratic almost perfect nonlinear trinomials and multinomials.
Finite Fields Their Appl., 2008

Ring geometries, two-weight codes, and strongly regular graphs.
Des. Codes Cryptogr., 2008

Polytope representations for linear-programming decoding of non-binary linear codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Quadratic Almost Perfect Nonlinear Functions With Many Terms.
IACR Cryptol. ePrint Arch., 2007

Errata for "The linear programming bound for codes over finite Frobenius rings".
Des. Codes Cryptogr., 2007

The linear programming bound for codes over finite Frobenius rings.
Des. Codes Cryptogr., 2007

Linear-programming Decoding of Non-binary Linear Codes
CoRR, 2007

On the Walsh Spectrum of a New APN Function.
Proceedings of the Cryptography and Coding, 2007

Determining the Nonlinearity of a New Family of APN Functions.
Proceedings of the Applied Algebra, 2007

2002
Hamming metric decoding of alternant codes over Galois rings.
IEEE Trans. Inf. Theory, 2002

Decoding a class of Lee metric codes over a Galois ring.
IEEE Trans. Inf. Theory, 2002

2001
Gröbner Bases over Galois Rings with an Application to Decoding Alternant Codes.
J. Symb. Comput., 2001

Decoding a Class of Alternant Codes for the Lee Metric.
Electron. Notes Discret. Math., 2001

Lifting Decoding Schemes over a Galois Ring.
Proceedings of the Applied Algebra, 2001


  Loading...