default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcus Greferath
Person information
- affiliation: University College of Dublin, School of Mathematics and Statistics, Ireland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Negin Karimi
, Ahmad Yousefian Darani, Marcus Greferath:
Correcting adversarial errors with generalized regenerating codes. Adv. Math. Commun. 18(1): 128-140 (2024)- [j28]Eda Tekin, Oliver Wilhelm Gnilke, Ferruh Özbudak, Bernhard Blümich, Marcus Greferath:
Almost perfect autocorrelation sequences with small number of pauses for applications in magnetic resonance. Cryptogr. Commun. 16(1): 109-127 (2024) - [i16]Iván Blanco-Chacón, Alberto F. Boix, Marcus Greferath, Erik Hieta-aho:
MacWilliams duality for rank metric codes over finite chain rings. CoRR abs/2408.03237 (2024) - 2022
- [j27]Niklas Gassner, Marcus Greferath, Joachim Rosenthal, Violetta Weger:
Bounds for Coding Theory over Rings. Entropy 24(10): 1473 (2022) - [c8]Marcus Greferath, Jens Zumbrägel:
List Decoding of Quaternary Codes in the Lee Metric. ISIT 2022: 2333-2337 - [i15]Marcus Greferath, Jens Zumbrägel:
List Decoding of Quaternary Codes in the Lee Metric. CoRR abs/2202.03977 (2022) - [i14]Marcus Greferath, Cornelia Rößing:
Group testing via residuation and partial geometries. CoRR abs/2202.05876 (2022) - 2021
- [i13]Niklas Gassner, Marcus Greferath, Joachim Rosenthal, Violetta Weger:
On Bounds for Ring-Based Coding Theory. CoRR abs/2103.07749 (2021) - 2020
- [j26]Yaqi Lu, Minjia Shi, Marcus Greferath, Patrick Solé:
Linear codes over finite rings are trace codes. Discret. Math. 343(8): 111919 (2020) - [i12]Ferdinand Blomqvist, Oliver W. Gnilke, Marcus Greferath:
On Decoding of Generalized Concatenated Codes and Matrix-Product Codes. CoRR abs/2004.03538 (2020)
2010 – 2019
- 2019
- [j25]Oliver W. Gnilke, Marcus Greferath, Camilla Hollanti, Guillermo Nuñez Ponasso, Padraig Ó Catháin, Eric Swartz:
Improved user-private information retrieval via finite geometry. Des. Codes Cryptogr. 87(2-3): 665-677 (2019) - 2018
- [j24]Oliver Wilhelm Gnilke, Marcus Greferath, Mario-Osvin Pavcevic:
Mosaics of combinatorial designs. Des. Codes Cryptogr. 86(1): 85-95 (2018) - [j23]Simon R. Blackburn, Marcus Greferath, Camilla Hollanti, Mario-Osvin Pavcevic, Joachim Rosenthal, Leo Storme, Ángeles Vázquez-Castro, Alfred Wassermann:
Preface to the special issue on network coding and designs. Des. Codes Cryptogr. 86(2): 237-238 (2018) - [c7]Ferdinand Blomqvist, Marcus Greferath:
The Double-Plane Algorithm: A simple algorithm for the closest vector problem. ISITA 2018: 193-197 - 2017
- [i11]Oliver W. Gnilke, Marcus Greferath, Camilla Hollanti, Guillermo Nuñez Ponasso, Padraig Ó Catháin, Eric Swartz:
Improved User-Private Information Retrieval via Finite Geometry. CoRR abs/1707.01551 (2017) - [i10]Oliver W. Gnilke, Marcus Greferath, Thomas Honold, Jay A. Wood, Jens Zumbrägel:
The Extension Theorem for Bi-invariant Weights over Frobenius Rings and Frobenius Bimodules. CoRR abs/1711.09939 (2017) - 2015
- [i9]Oliver W. Gnilke, Marcus Greferath, Mario-Osvin Pavcevic:
Mosaics of Combinatorial Designs. CoRR abs/1503.01643 (2015) - 2014
- [j22]Marcus Greferath, Thomas Honold, Cathy Mc Fadden, Jay A. Wood, Jens Zumbrägel:
MacWilliams' Extension Theorem for bi-invariant weights over finite principal ideal rings. J. Comb. Theory A 125: 177-193 (2014) - [c6]Zihui Liu, Jens Zumbrägel, Marcus Greferath, Xin-Wen Wu:
Notes on the pseudoredundancy. ISIT 2014: 2789-2793 - [i8]Zihui Liu, Jens Zumbrägel, Marcus Greferath, Xin-Wen Wu:
New Results on the Pseudoredundancy. CoRR abs/1410.1627 (2014) - 2013
- [j21]Marcus Greferath:
Editorial. Adv. Math. Commun. 7(1): i (2013) - [j20]Eimear Byrne, Marcus Greferath, Jaume Pernas, Jens Zumbrägel:
Algebraic decoding of negacyclic codes over $${\mathbb Z_4}$$. Des. Codes Cryptogr. 66(1-3): 3-16 (2013) - [j19]Marcus Greferath, Cathy Mc Fadden, Jens Zumbrägel:
Characteristics of invariant weights related to code equivalence over rings. Des. Codes Cryptogr. 66(1-3): 145-156 (2013) - [i7]Marcus Greferath, Thomas Honold, Cathy Mc Fadden, Jay A. Wood, Jens Zumbrägel:
MacWilliams' Extension Theorem for Bi-Invariant Weights over Finite Principal Ideal Rings. CoRR abs/1309.3292 (2013) - 2012
- [c5]Marcus Greferath, Jens Zumbrägel:
On the algebraic representation of selected optimal non-linear binary codes. ISIT 2012: 3115-3119 - 2011
- [i6]Eimear Byrne, Marcus Greferath, Jaume Pernas, Jens Zumbrägel:
Algebraic Decoding of Negacyclic Codes Over Z4. CoRR abs/1102.3604 (2011) - [i5]Marcus Greferath, Jens Zumbrägel:
On the algebraic representation of certain optimal non-linear binary codes. CoRR abs/1109.4770 (2011) - [i4]Marcus Greferath, Cathy Mc Fadden, Jens Zumbrägel:
Characteristics of Invariant Weights Related to Code Equivalence over Rings. CoRR abs/1110.1538 (2011) - 2010
- [j18]Eimear Byrne, Marcus Greferath, Axel Kohnert, Vitaly Skachek:
New bounds for codes over finite Frobenius rings. Des. Codes Cryptogr. 57(2): 169-179 (2010) - [c4]Marcus Greferath, Alexandr Nechaev:
Generalized Frobenius extensions of finite rings and trace functions. ITW 2010: 1-5 - [e1]Marcus Greferath, Joachim Rosenthal, Alexander Barg, Gilles Zémor:
2010 IEEE Information Theory Workshop, ITW 2010, Dublin, Ireland, August 30 - September 3, 2010. IEEE 2010, ISBN 978-1-4244-8264-1 [contents]
2000 – 2009
- 2009
- [j17]Marcus Greferath, Ryan K. Therkelsen:
On coloured constant composition designs. Discret. Math. 309(8): 2410-2416 (2009) - [j16]Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath:
Linear-programming decoding of nonbinary linear codes. IEEE Trans. Inf. Theory 55(9): 4134-4154 (2009) - [p1]Marcus Greferath:
An Introduction to Ring-Linear Coding Theory. Gröbner Bases, Coding, and Cryptography 2009: 219-238 - 2008
- [j15]Eimear Byrne, Marcus Greferath, Thomas Honold:
Ring geometries, two-weight codes, and strongly regular graphs. Des. Codes Cryptogr. 48(1): 1-16 (2008) - [c3]Vitaly Skachek, Mark F. Flanagan, Eimear Byrne, Marcus Greferath:
Polytope representations for linear-programming decoding of non-binary linear codes. ISIT 2008: 1508-1512 - [i3]Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath:
Linear-Programming Decoding of Nonbinary Linear Codes. CoRR abs/0804.4384 (2008) - 2007
- [j14]Marcus Greferath:
Editorial. Adv. Math. Commun. 1(1) (2007) - [j13]Eimear Byrne, Marcus Greferath, Michael E. O'Sullivan:
The linear programming bound for codes over finite Frobenius rings. Des. Codes Cryptogr. 42(3): 289-301 (2007) - [j12]Eimear Byrne, Marcus Greferath, Michael E. O'Sullivan:
Errata for "The linear programming bound for codes over finite Frobenius rings". Des. Codes Cryptogr. 45(2): 269-270 (2007) - [i2]Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath:
Linear-programming Decoding of Non-binary Linear Codes. CoRR abs/0707.4360 (2007) - [i1]Vitaly Skachek, Mark F. Flanagan, Eimear Byrne, Marcus Greferath:
Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes. CoRR abs/0712.4075 (2007) - 2005
- [j11]Marten van Dijk, Sebastian Egner, Marcus Greferath, Alfred Wassermann:
On two doubly even self-dual binary codes of length 160 and minimum weight 24. IEEE Trans. Inf. Theory 51(1): 408-411 (2005) - 2004
- [j10]Marcus Greferath, Michael E. O'Sullivan:
On bounds for codes over Frobenius rings under homogeneous weights. Discret. Math. 289(1-3): 11-24 (2004) - [c2]Marcus Greferath, Michael E. O'Sullivan, Roxana Smarandache:
Construction of good LDPC codes using dilation matrices. ISIT 2004: 237 - 2002
- [j9]Marcus Greferath, Cornelia Rößing:
On the Cardinality of Intersection Sets in Inversive Planes. J. Comb. Theory A 100(1): 181-188 (2002) - 2001
- [j8]Iwan M. Duursma, Marcus Greferath, Simon Litsyn, Stefan E. Schmidt:
A Z8-linear lift of the binary Golay code and a nonlinear Binary (96, 237, 24)-code. IEEE Trans. Inf. Theory 47(4): 1596-1598 (2001) - 2000
- [j7]Marcus Greferath, Stefan E. Schmidt:
Finite-Ring Combinatorics and MacWilliams' Equivalence Theorem. J. Comb. Theory A 92(1): 17-28 (2000) - [j6]Iwan M. Duursma, Marcus Greferath, Stefan E. Schmidt:
On the Optimal Integer 4 Codes of Type II and Length 16. J. Comb. Theory A 92(1): 77-82 (2000)
1990 – 1999
- 1999
- [j5]Marcus Greferath, Stefan E. Schmidt:
Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code. IEEE Trans. Inf. Theory 45(7): 2522-2524 (1999) - [j4]Marcus Greferath, Emanuele Viterbo:
On Z4- and Z9-linear lifts of the Golay codes. IEEE Trans. Inf. Theory 45(7): 2524-2527 (1999) - [c1]Marcus Greferath, Stefan E. Schmidt:
Linear Codes and Rings of Matrices. AAECC 1999: 160-169 - 1998
- [j3]Marcus Greferath, Ute Vellbinger:
Efficient Decoding of Zpk-Linear Codes. IEEE Trans. Inf. Theory 44(3): 1288-1291 (1998) - [j2]Marcus Greferath, Ute Vellbinger:
On the Extended Error-Correcting Capabilities of the Quaternary Preparata Codes. IEEE Trans. Inf. Theory 44(5): 2018-2019 (1998) - 1997
- [j1]Marcus Greferath:
Cyclic codes over finite rings. Discret. Math. 177(1-3): 273-277 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
