Joachim Rosenthal

IEEE Trans. Inf. Theory, February, 2024

Schubert Subspace Codes.

[BibT_eX]

[DOI]

Gianira N. Alfarano

Beatrice Toesca

CoRR, 2024

Criteria for the construction of MDS convolutional codes with good column distances.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2024

Algorithms for Computing the Free Distance of Convolutional Codes.

[BibT_eX]

[DOI]

Zita Abreu

Michael Schaller

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Convolutional codes over finite chain rings, MDP codes and their characterization.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

Binary convolutional codes with optimal column distances.

[BibT_eX]

[DOI]

Zita Abreu

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

A deterministic algorithm for the discrete logarithm problem in a semigroup.

[BibT_eX]

[DOI]

Simran Tinani

J. Math. Cryptol., 2022

Bounds for Coding Theory over Rings.

[BibT_eX]

[DOI]

Entropy, 2022

Moderate-density parity-check codes from projective bundles.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

Efficient Description of some Classes of Codes using Group Algebras.

[BibT_eX]

[DOI]

CoRR, 2022

Complexity of Conjugacy Search in some Polycyclic and Matrix Groups.

[BibT_eX]

[DOI]

Simran Tinani

Carlo Matteotti

CoRR, 2022

A Survey on Code-Based Cryptography.

[BibT_eX]

[DOI]

Violetta Weger

Niklas Gassner

CoRR, 2022

Analysis of Low-Density Parity-Check Codes over Finite Integer Rings for the Lee Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2022

2021

Erasure decoding of convolutional codes using first-order representations.

[BibT_eX]

[DOI]

Math. Control. Signals Syst., 2021

Construction of LDPC convolutional codes via difference triangle sets.

[BibT_eX]

[DOI]

Gianira N. Alfarano

Des. Codes Cryptogr., 2021

On the Properties of Error Patterns in the Constant Lee Weight Channel.

[BibT_eX]

[DOI]

CoRR, 2021

On Bounds for Ring-Based Coding Theory.

[BibT_eX]

[DOI]

CoRR, 2021

Encryption scheme based on expanded Reed-Solomon codes.

[BibT_eX]

[DOI]

Karan Khathuria

Violetta Weger

Adv. Math. Commun., 2021

2020

Convolutional Codes.

[BibT_eX]

[DOI]

Raquel Pinto

CoRR, 2020

Existence and Cardinality of k-Normal Elements in Finite Fields.

[BibT_eX]

[DOI]

Simran Tinani

Gianira Nicoletta Alfarano

Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

Construction of Rate (n - 1 )/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Security of generalised Reed-Solomon code-based cryptosystems.

[BibT_eX]

[DOI]

IET Inf. Secur., 2019

2018

On q-Steiner systems from rank metric codes.

[BibT_eX]

[DOI]

Discret. Math., 2018

On the genericity of maximum rank distance and Gabidulin codes.

[BibT_eX]

[DOI]

Alessandro Neri

Tovohery Randrianarisoa

Des. Codes Cryptogr., 2018

Extension of Overbeck's attack for Gabidulin-based cryptosystems.

[BibT_eX]

[DOI]

Kyle Marshall

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

Generalization of the Ball-Collision Algorithm.

[BibT_eX]

[DOI]

CoRR, 2018

Design and Implementation of a Digital Signature Scheme Based on Low-density Generator Matrix Codes.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Correction to "Cyclic Orbit Codes".

[BibT_eX]

[DOI]

Michael Braun

IEEE Trans. Inf. Theory, 2017

Fuzzy Authentication using Rank Distance.

[BibT_eX]

[DOI]

Alessandro Neri

CoRR, 2017

A decoding algorithm for twisted Gabidulin codes.

[BibT_eX]

[DOI]

Tovohery Randrianarisoa

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

MRD rank metric convolutional codes.

[BibT_eX]

[DOI]

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

Column Rank Distances of Rank Metric Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016

Enhanced Public Key Security for the McEliece Cryptosystem.

[BibT_eX]

[DOI]

J. Cryptol., 2016

An Application of Group Theory in Confidential Network Communications.

[BibT_eX]

[DOI]

Juan Antonio López-Ramos

Reto Schnyder

CoRR, 2016

Variations of the McEliece Cryptosystem.

[BibT_eX]

[DOI]

Jessalyn Bolkema

Heide Gluesing-Luerssen

CoRR, 2016

Considerations for rank-based cryptosystems.

[BibT_eX]

[DOI]

Kyle Marshall

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

An Active Attack on a Multiparty Key Exchange Protocol.

[BibT_eX]

[DOI]

Reto Schnyder

Juan Antonio López Ramos

CoRR, 2015

Group key management based on semigroup actions.

[BibT_eX]

[DOI]

Juan Antonio López Ramos

Reto Schnyder

CoRR, 2015

2014

On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes.

[BibT_eX]

[DOI]

Natalia Silberstein

Des. Codes Cryptogr., 2014

2013

Cyclic Orbit Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

A complete characterization of irreducible cyclic orbit codes and their Plücker embedding.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

List Decoding of Lifted Gabidulin Codes via the Plücker Embedding

[BibT_eX]

[DOI]

Natalia Silberstein

CoRR, 2013

Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures.

[BibT_eX]

[DOI]

Proceedings of the Post-Quantum Cryptography - 5th International Workshop, 2013

2012

Decoding of Convolutional Codes Over the Erasure Channel.

[BibT_eX]

[DOI]

Virtudes Tomás

IEEE Trans. Inf. Theory, 2012

Subspace Fuzzy Vault

[BibT_eX]

[DOI]

CoRR, 2012

Decoding of Subspace Codes, a Problem of Schubert Calculus over Finite Fields

[BibT_eX]

[DOI]

CoRR, 2012

On Burst Error Correction and Storage Security of Noisy Data

[BibT_eX]

[DOI]

CoRR, 2012

An algebraic approach for decoding spread codes.

[BibT_eX]

[DOI]

Elisa Gorla

Adv. Math. Commun., 2012

Polynomial evaluation over finite fields: new algorithms and complexity bounds.

[BibT_eX]

[DOI]

Michele Elia

Appl. Algebra Eng. Commun. Comput., 2012

2011

Coding Theory (Dagstuhl Seminar 11461).

[BibT_eX]

[DOI]

Mohammad Amin Shokrollahi

Judy L. Walker

Dagstuhl Reports, 2011

New Improvements on the Echelon-Ferrers Construction

[BibT_eX]

[DOI]

José Antonio Álvarez-Bermejo

CoRR, 2011

Managing key multicasting through orthogonal systems

[BibT_eX]

[DOI]

Juan Antonio López Ramos

CoRR, 2011

Efficient evaluation of polynomials over finite fields

[BibT_eX]

[DOI]

Michele Elia

CoRR, 2011

A Complete Characterization of Irreducible Cyclic Orbit Codes

[BibT_eX]

[DOI]

CoRR, 2011

On the decoding complexity of cyclic codes up to the BCH bound.

[BibT_eX]

[DOI]

Michele Elia

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

On conjugacy classes of subgroups of the general linear group and cyclic orbit codes.

[BibT_eX]

[DOI]

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

On fuzzy syndrome hashing with LDPC coding.

[BibT_eX]

[DOI]

Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies, 2011

2010

Orbit codes - A new concept in the area of network coding.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Coding solutions for the secure biometric storage problem.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009

Decoding of MDP convolutional codes over the erasure channel.

[BibT_eX]

[DOI]

Virtudes Tomás

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Zig-zag and replacement product graphs and LDPC codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2008

Efficient recovering of operation tables of black box groups and rings.

[BibT_eX]

[DOI]

Jens Zumbrägel

Gérard Maze

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

Spread codes and spread decoding in network coding.

[BibT_eX]

[DOI]

Elisa Gorla

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

2007

Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Public key cryptography based on semigroup actions.

[BibT_eX]

[DOI]

Gérard Maze

Chris Monico

Adv. Math. Commun., 2007

Cryptanalysis of the CFVZ cryptosystem.

[BibT_eX]

[DOI]

Joan-Josep Climent

Elisa Gorla

Adv. Math. Commun., 2007

Pole placement results for complex symmetric and Hamiltonian transfer functions.

[BibT_eX]

[DOI]

Uwe Helmke

Proceedings of the 46th IEEE Conference on Decision and Control, 2007

2006

Unitary Space-Time Constellation Analysis: An Upper Bound for the Diversity.

[BibT_eX]

[DOI]

Guangyue Han

IEEE Trans. Inf. Theory, 2006

Geometrical and Numerical Design of Structured Unitary Space-Time Constellations.

[BibT_eX]

[DOI]

Guangyue Han

IEEE Trans. Inf. Theory, 2006

Strongly-MDS convolutional codes.

[BibT_eX]

[DOI]

Heide Gluesing-Luerssen

IEEE Trans. Inf. Theory, 2006

Output Feedback Pole Assignment for Transfer Functions with Symmetries.

[BibT_eX]

[DOI]

Uwe Helmke

Xiaochang Alex Wang

SIAM J. Control. Optim., 2006

Pseudocodeword weights for non-binary LDPC codes.

[BibT_eX]

[DOI]

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

2005

Convolutional codes with maximum distance profile.

[BibT_eX]

[DOI]

Ryan Hutchinson

Syst. Control. Lett., 2005

Tree-based construction of LDPC codes.

[BibT_eX]

[DOI]

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

2004

Pole Placement and Matrix Extension Problems: A Common Point of View.

[BibT_eX]

[DOI]

Meeyoung Kim

Xiaochang Alex Wang

SIAM J. Control. Optim., 2004

Two-degree-of-freedom <i>l</i><sub>2</sub>-optimal tracking with preview.

[BibT_eX]

[DOI]

David N. Hoover

Roland Longchamp

Autom., 2004

Pseudocodeword weights and stopping sets.

[BibT_eX]

[DOI]

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

Upper bound analysis of diversity for unitary space time constellations.

[BibT_eX]

[DOI]

Guangyue Han

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

2002

A Polynomial Description of the Rijndael Advanced Encryption Standard

[BibT_eX]

[DOI]

CoRR, 2002

2001

Constructions of MDS-convolutional codes.

[BibT_eX]

[DOI]

Heide Gluesing-Luerssen

IEEE Trans. Inf. Theory, 2001

The Multiplicative Inverse Eigenvalue Problem over an Algebraically Closed Field.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2001

1999

BCH convolutional codes.

[BibT_eX]

[DOI]

Eric V. York

IEEE Trans. Inf. Theory, 1999

Maximum Distance Separable Convolutional Codes.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1999

1997

On the generalized Hamming weights of convolutional codes.

[BibT_eX]

[DOI]

Eric V. York

IEEE Trans. Inf. Theory, 1997

Realization by inspection.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1997

Homogeneous behaviors.

[BibT_eX]

[DOI]

M. S. Ravi

Math. Control. Signals Syst., 1997

A controllability test for general first-order representations.

[BibT_eX]

[DOI]

Uwe Helmke

Autom., 1997

1996

On behaviors and convolutional codes.

[BibT_eX]

[DOI]

Eric V. York

IEEE Trans. Inf. Theory, 1996

Output feedback pole placement with dynamic compensators.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1996

An observability criterion for dynamic systems governed by Riccati differential equations.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1996

1995

On decentralized dynamic pole placement and feedback stabilization.

[BibT_eX]

[DOI]

M. S. Ravi

IEEE Trans. Autom. Control., 1995

A generalized Popov-Belevitch-Hautus test of observability.

[BibT_eX]

[DOI]

Bijoy Kumar Ghosh