Marcus Greferath

Cryptogr. Commun., January, 2024

MacWilliams duality for rank metric codes over finite chain rings.

[BibT_eX]

[DOI]

CoRR, 2024

Correcting adversarial errors with generalized regenerating codes.

[BibT_eX]

[DOI]

Negin Karimi

Ahmad Yousefian Darani

Adv. Math. Commun., 2024

2022

Bounds for Coding Theory over Rings.

[BibT_eX]

[DOI]

Entropy, 2022

Group testing via residuation and partial geometries.

[BibT_eX]

[DOI]

Cornelia Rößing

CoRR, 2022

List Decoding of Quaternary Codes in the Lee Metric.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

On Bounds for Ring-Based Coding Theory.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Linear codes over finite rings are trace codes.

[BibT_eX]

[DOI]

Discret. Math., 2020

On Decoding of Generalized Concatenated Codes and Matrix-Product Codes.

[BibT_eX]

[DOI]

Ferdinand Blomqvist

Oliver W. Gnilke

CoRR, 2020

2019

Improved user-private information retrieval via finite geometry.

[BibT_eX]

[DOI]

Oliver W. Gnilke

Camilla Hollanti

Guillermo Nuñez Ponasso

Padraig Ó Catháin

Eric Swartz

Des. Codes Cryptogr., 2019

2018

Mosaics of combinatorial designs.

[BibT_eX]

[DOI]

Oliver Wilhelm Gnilke

Mario-Osvin Pavcevic

Des. Codes Cryptogr., 2018

Preface to the special issue on network coding and designs.

[BibT_eX]

[DOI]

Ángeles Vázquez-Castro

Alfred Wassermann

Des. Codes Cryptogr., 2018

The Double-Plane Algorithm: A simple algorithm for the closest vector problem.

[BibT_eX]

[DOI]

Ferdinand Blomqvist

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.

[BibT_eX]

[DOI]

CoRR, 2017

2014

MacWilliams' Extension Theorem for bi-invariant weights over finite principal ideal rings.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

New Results on the Pseudoredundancy.

[BibT_eX]

[DOI]

CoRR, 2014

Notes on the pseudoredundancy.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Cathy Mc Fadden

Des. Codes Cryptogr., 2013

Algebraic decoding of negacyclic codes over $${\mathbb Z_4}$$.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

2012

On the algebraic representation of selected optimal non-linear binary codes.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Algebraic Decoding of Negacyclic Codes Over Z4

[BibT_eX]

[DOI]

CoRR, 2011

2010

New bounds for codes over finite Frobenius rings.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

Generalized Frobenius extensions of finite rings and trace functions.

[BibT_eX]

[DOI]

Alexandr Nechaev

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009

Linear-programming decoding of nonbinary linear codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

On coloured constant composition designs.

[BibT_eX]

[DOI]

Ryan K. Therkelsen

Discret. Math., 2009

An Introduction to Ring-Linear Coding Theory.

[BibT_eX]

[DOI]

Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008

Ring geometries, two-weight codes, and strongly regular graphs.

[BibT_eX]

[DOI]

Eimear Byrne

Thomas Honold

Des. Codes Cryptogr., 2008

Polytope representations for linear-programming decoding of non-binary linear codes.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Errata for "The linear programming bound for codes over finite Frobenius rings".

[BibT_eX]

[DOI]

Eimear Byrne

Des. Codes Cryptogr., 2007

The linear programming bound for codes over finite Frobenius rings.

[BibT_eX]

[DOI]

Eimear Byrne

Des. Codes Cryptogr., 2007

Linear-programming Decoding of Non-binary Linear Codes

[BibT_eX]

[DOI]

CoRR, 2007

Editorial.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2007

2005

On two doubly even self-dual binary codes of length 160 and minimum weight 24.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

2004

On bounds for codes over Frobenius rings under homogeneous weights.

[BibT_eX]

[DOI]

Discret. Math., 2004

Construction of good LDPC codes using dilation matrices.

[BibT_eX]

[DOI]

Roxana Smarandache

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2002

On the Cardinality of Intersection Sets in Inversive Planes.

[BibT_eX]

[DOI]

Cornelia Rößing

J. Comb. Theory A, 2002

2001

A Z8-linear lift of the binary Golay code and a nonlinear Binary (96, 237, 24)-code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

2000

Finite-Ring Combinatorics and MacWilliams' Equivalence Theorem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2000

On the Optimal Integer 4 Codes of Type II and Length 16.

[BibT_eX]

[DOI]

Iwan M. Duursma

J. Comb. Theory A, 2000

1999

On Z4- and Z9-linear lifts of the Golay codes.

[BibT_eX]

[DOI]

Emanuele Viterbo

IEEE Trans. Inf. Theory, 1999

Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Linear Codes and Rings of Matrices.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1999

1998

On the Extended Error-Correcting Capabilities of the Quaternary Preparata Codes.

[BibT_eX]

[DOI]

Ute Vellbinger

IEEE Trans. Inf. Theory, 1998

Efficient Decoding of Zpk-Linear Codes.

[BibT_eX]

[DOI]

Ute Vellbinger

IEEE Trans. Inf. Theory, 1998

1997

Cyclic codes over finite rings.

[BibT_eX]

[DOI]