Vladimir Sidorenko

Fedor I. Ivanov

E. A. Krouk

Probl. Inf. Transm., 2022

Identification based on random coding.

[BibT_eX]

[DOI]

Christian Deppe

CoRR, 2022

Hardware-aware Partitioning of Convolutional Neural Network Inference for Embedded AI Applications.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Distributed Computing in Sensor Systems, 2022

2021

Decoding of Interleaved Alternant Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Capacity-achieving private information retrieval scheme with a smaller sub-packetization.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2021

On transform-domain decoding of generalized Gabidulin codes : Dedicated to the memory of Ernst M. Gabidulin (1937-2021).

[BibT_eX]

[DOI]

Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Decoding of Space-Symmetric Rank Errors.

[BibT_eX]

[DOI]

Thomas Jerkovits

Proceedings of the IEEE International Symposium on Information Theory, 2021

Doubly-Exponential Identification via Channels: Code Constructions and Bounds.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Skew Convolutional Codes.

[BibT_eX]

[DOI]

Entropy, 2020

Two classes of optimal LRCs with information (r, t)-locality.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

On Skew Convolutional and Trellis Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Success Probability of Decoding Interleaved Alternant Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Randomized Nested Polar Subcode Constructions for Privacy, Secrecy, and Storage.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Nested Tailbiting Convolutional Codes for Secrecy, Privacy, and Storage.

[BibT_eX]

[DOI]

Proceedings of the IH&MMSec '20: ACM Workshop on Information Hiding and Multimedia Security, 2020

On interleaved rank metric codes.

[BibT_eX]

[DOI]

Gerhard Kramer

Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019

Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2019

Improved syndrome decoding of lifted $$L$$ L -interleaved Gabidulin codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

On Maximum-Likelihood Decoding of Time-Varying Trellis Codes.

[BibT_eX]

[DOI]

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

2018

Secure and Reliable Key Agreement with Physical Unclonable Functions.

[BibT_eX]

[DOI]

Entropy, 2018

Concatenation of convolutional codes and rank metric codes for multi-shot network coding.

[BibT_eX]

[DOI]

Diego Napp Avelli

Raquel Pinto

Des. Codes Cryptogr., 2018

2017

On Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes.

[BibT_eX]

[DOI]

Johan Sebastian Rosenkilde

Electron. Notes Discret. Math., 2017

Row reduction applied to decoding of rank-metric and subspace codes.

[BibT_eX]

[DOI]

Sven Puchinger

Des. Codes Cryptogr., 2017

Algebraic decoding of folded Gabidulin codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

Wyner-Ziv Coding for Physical Unclonable Functions and Biometric Secrecy Systems.

[BibT_eX]

[DOI]

CoRR, 2017

Interleaved subspace codes in fountain mode.

[BibT_eX]

[DOI]

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

2016

Reliable secret-key binding for physical unclonable functions with transform coding.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Global Conference on Signal and Information Processing, 2016

2015

Convolutional Codes in Rank Metric With Application to Random Network Coding.

[BibT_eX]

[DOI]

Markus Stinner

IEEE Trans. Inf. Theory, 2015

Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation.

[BibT_eX]

[DOI]

Johan Sebastian Rosenkilde Nielsen

Sven Puchinger

CoRR, 2015

List and probabilistic unique decoding of folded subspace codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Fast skew-feedback shift-register synthesis.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

On transform-domain error and erasure correction by Gabidulin codes.

[BibT_eX]

[DOI]

Danilo Silva

Des. Codes Cryptogr., 2014

On multi-trial Forney-Kovalev decoding of concatenated codes.

[BibT_eX]

[DOI]

Anas Chaaban

Adv. Math. Commun., 2014

2013

Fast decoding of Gabidulin codes.

[BibT_eX]

[DOI]

Valentin B. Afanassiev

Des. Codes Cryptogr., 2013

On decoding Interleaved Chinese Remainder codes.

[BibT_eX]

[DOI]

Johan Sebastian Rosenkilde Nielsen

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

On a multiple-access in a vector disjunctive channel.

[BibT_eX]

[DOI]

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

2012

Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff.

[BibT_eX]

[DOI]

Jos H. Weber

Khaled A. S. Abdel-Ghaffar

Probl. Inf. Transm., 2012

Rank metric convolutional codes for Random Linear Network Coding.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Network Coding, 2012

Properties and encoding aspects of direct product convolutional codes.

[BibT_eX]

[DOI]

Francesca Vatta

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

2011

Linearized Shift-Register Synthesis.

[BibT_eX]

[DOI]

Gerd Richter

IEEE Trans. Inf. Theory, 2011

Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes.

[BibT_eX]

[DOI]

Lan Jiang

IEEE Trans. Inf. Theory, 2011

On (Partial) unit memory codes based on Gabidulin codes.

[BibT_eX]

[DOI]

Antonia Wachter

Probl. Inf. Transm., 2011

A linear algebraic approach to multisequence shift-register synthesis.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2011

Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes

[BibT_eX]

[DOI]

CoRR, 2011

Optimal threshold-based multi-trial error/erasure decoding with the Guruswami-Sudan algorithm.

[BibT_eX]

[DOI]

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

2010

Syndrome decoding of Reed-Solomon codes beyond half the minimum distance based on shift-register synthesis.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Multitrial decoding of concatenated codes using fixed thresholds.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2010

Adaptive Single-Trial Error/Erasure Decoding for Binary Codes

[BibT_eX]

[DOI]

CoRR, 2010

Optimal Thresholds for GMD Decoding with (L+1)/L-extended Bounded Distance Decoders

[BibT_eX]

[DOI]

CoRR, 2010

Single-trial decoding of concatenated codes using fixed or adaptive erasing.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2010

Adaptive single-trial error/erasure decoding of binary codes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2010

A basis for all solutions of the key equation for Gabidulin codes.

[BibT_eX]

[DOI]

Antonia Wachter

Proceedings of the IEEE International Symposium on Information Theory, 2010

Termination and tailbiting of rate-k/n direct product convolutional codes.

[BibT_eX]

[DOI]

Francesca Vatta

Proceedings of the IEEE International Symposium on Information Theory, 2010

Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesis.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Optimal thresholds for GMD decoding with ℓ+1 over ℓ-extended Bounded Distance decoders.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel

[BibT_eX]

[DOI]

CoRR, 2009

On Extended Forney-Kovalev GMD decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Computation of distributions and their moments in the trellis.

[BibT_eX]

[DOI]

Axel Heim

Uli Sorger

Adv. Math. Commun., 2008

Decoding generalized concatenated codes using Interleaved Reed-Solomon codes.

[BibT_eX]

[DOI]

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

Computation of Moments in the Trellis.

[BibT_eX]

[DOI]

Axel Heim

Ulrich Sorger

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

2007

Finding distance profiles of unequal error protection block codes.

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 2007

Trellis Computations

[BibT_eX]

[DOI]

Axel Heim

Uli Sorger

CoRR, 2007

From Block to Convolutional Codes using Block Distances.

[BibT_eX]

[DOI]

Carlos Medina

Proceedings of the IEEE International Symposium on Information Theory, 2007

Enhancing the Correcting Radius of Interleaved Reed-Solomon Decoding using Syndrome Extension Techniques.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Error exponents for product convolutional codes.

[BibT_eX]

[DOI]

Carlos Medina

Probl. Inf. Transm., 2006

Linear Shift-Register Synthesis for Multiple Sequences of Varying Length

[BibT_eX]

[DOI]

CoRR, 2006

Decoding Reed-Solomon Codes Beyond Half the Minimum Distance using Shift-Register Synthesis.

[BibT_eX]

[DOI]

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

Multi-Sequence Linear Shift-Register Synthesis: The Varying Length Case.

[BibT_eX]

[DOI]

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

2005

Error and Erasure Correction of Interleaved Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptography, International Workshop, 2005

On polyalphabetic block codes.

[BibT_eX]

[DOI]

Valentin B. Afanassiev

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Interleaved Reed-Solomon codes in concatenated code designs.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Encoding and distance estimation of product convolutional codes.

[BibT_eX]

[DOI]

Carlos Medina

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

2004

Finding a list of best paths in a trellis.

[BibT_eX]

[DOI]

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

2002

A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes.

[BibT_eX]

[DOI]

Helmut Griesser

Probl. Inf. Transm., 2002

1999

On the Rectangularity of Nonlinear Block Codes.

[BibT_eX]

[DOI]

Ian Martin

Bahram Honary

IEEE Trans. Inf. Theory, 1999

Array Codes Correcting Likely Burst Error Patterns.

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 1999

Rectangular Basis of a Linear Code.

[BibT_eX]

[DOI]

Johannes Maucher

Proceedings of the Cryptography and Coding, 1999

Rectangular Codes and Rectangular Algebra.

[BibT_eX]

[DOI]

Johannes Maucher

Proceedings of the Applied Algebra, 1999

1998

Array Codes Correcting a Two-Dimensional Cluster of Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

1996

Minimal trellis design for linear codes based on the Shannon product.

[BibT_eX]

[DOI]

Garik Markarian

Bahram Honary

IEEE Trans. Inf. Theory, 1996

Singleton-type bounds for blot-correcting codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

1994

Decoding of convolutional codes using a syndrome trellis.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

1993

On Periodic (Partial) Unit Memory Codes with Maximum Free Distance.

[BibT_eX]

[DOI]

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

Periodicity of One-Dimensional Tilings.

[BibT_eX]

[DOI]

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1988

On sequential decoding for the Gilbert channel.

[BibT_eX]

[DOI]