Marcus Greferath

Orcid: 0000-0002-3102-4350

Affiliations:
  • University College of Dublin, School of Mathematics and Statistics, Ireland


According to our database1, Marcus Greferath authored at least 46 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Almost perfect autocorrelation sequences with small number of pauses for applications in magnetic resonance.
Cryptogr. Commun., January, 2024

MacWilliams duality for rank metric codes over finite chain rings.
CoRR, 2024

Correcting adversarial errors with generalized regenerating codes.
Adv. Math. Commun., 2024

2022
Bounds for Coding Theory over Rings.
Entropy, 2022

Group testing via residuation and partial geometries.
CoRR, 2022

List Decoding of Quaternary Codes in the Lee Metric.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
On Bounds for Ring-Based Coding Theory.
CoRR, 2021

2020
Linear codes over finite rings are trace codes.
Discret. Math., 2020

On Decoding of Generalized Concatenated Codes and Matrix-Product Codes.
CoRR, 2020

2019
Improved user-private information retrieval via finite geometry.
Des. Codes Cryptogr., 2019

2018
Mosaics of combinatorial designs.
Des. Codes Cryptogr., 2018

Preface to the special issue on network coding and designs.
Des. Codes Cryptogr., 2018

The Double-Plane Algorithm: A simple algorithm for the closest vector problem.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
The Extension Theorem for Bi-invariant Weights over Frobenius Rings and Frobenius Bimodules.
CoRR, 2017

2014
MacWilliams' Extension Theorem for bi-invariant weights over finite principal ideal rings.
J. Comb. Theory A, 2014

New Results on the Pseudoredundancy.
CoRR, 2014

Notes on the pseudoredundancy.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Characteristics of invariant weights related to code equivalence over rings.
Des. Codes Cryptogr., 2013

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

2012
On the algebraic representation of selected optimal non-linear binary codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
On the algebraic representation of certain optimal non-linear binary codes
CoRR, 2011

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

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

Generalized Frobenius extensions of finite rings and trace functions.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

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

On coloured constant composition designs.
Discret. Math., 2009

An Introduction to Ring-Linear Coding Theory.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

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
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

Editorial.
Adv. Math. Commun., 2007

2005
On two doubly even self-dual binary codes of length 160 and minimum weight 24.
IEEE Trans. Inf. Theory, 2005

2004
On bounds for codes over Frobenius rings under homogeneous weights.
Discret. Math., 2004

Construction of good LDPC codes using dilation matrices.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2002
On the Cardinality of Intersection Sets in Inversive Planes.
J. Comb. Theory A, 2002

2001
A Z<sub>8</sub>-linear lift of the binary Golay code and a nonlinear Binary (96, 2<sup>37</sup>, 24)-code.
IEEE Trans. Inf. Theory, 2001

2000
Finite-Ring Combinatorics and MacWilliams' Equivalence Theorem.
J. Comb. Theory A, 2000

On the Optimal <sub>Integer 4</sub> Codes of Type II and Length 16.
J. Comb. Theory A, 2000

1999
On Z<sub>4</sub>- and Z<sub>9</sub>-linear lifts of the Golay codes.
IEEE Trans. Inf. Theory, 1999

Gray isometries for finite chain rings and a nonlinear ternary (36, 3<sup>12</sup>, 15) code.
IEEE Trans. Inf. Theory, 1999

Linear Codes and Rings of Matrices.
Proceedings of the Applied Algebra, 1999

1998
On the Extended Error-Correcting Capabilities of the Quaternary Preparata Codes.
IEEE Trans. Inf. Theory, 1998

Efficient Decoding of Z<sub>p<sup>k</sup></sub>-Linear Codes.
IEEE Trans. Inf. Theory, 1998

1997
Cyclic codes over finite rings.
Discret. Math., 1997


  Loading...