Martin Bossert

Orcid: 0000-0002-3827-9065

Affiliations:
  • University of Ulm, Germany


According to our database1, Martin Bossert authored at least 163 papers between 1985 and 2024.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2012, "For contributions to reliable data transmission including code constructions and soft decision decoding".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Shift-Sum Decoding of Non-Binary Cyclic Codes.
IEEE Trans. Inf. Theory, February, 2024

2022
On Hard and Soft Decision Decoding of BCH Codes.
IEEE Trans. Inf. Theory, 2022

Concatenated Codes Based on the Plotkin Construction and Their Soft-Input Decoding.
IEEE Trans. Commun., 2022

On Multibasis Information Set Decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Bounds and Genericity of Sum-Rank-Metric Codes.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

2020
Low-Complexity Chase Decoding of Reed-Solomon Codes Using Module.
IEEE Trans. Commun., 2020

On Decoding Using Codewords of the Dual Code.
CoRR, 2020

Multi-Valued Physical Unclonable Functions based on Dynamic Random Access Memory.
Proceedings of the MEMSYS 2020: The International Symposium on Memory Systems, 2020

Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual Codewords.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Low-Complexity Chase Decoding of Reed-Solomon Codes through Basis Reduction.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Progressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Module Minimization.
IEEE Trans. Commun., 2019

Module minimisation based low-complexity soft decoding of Reed-Solomon codes.
IET Commun., 2019

Channel Models for Physical Unclonable Functions based on DRAM Retention Measurements.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Progressive Module Minimization for Re-encoding Transformed Soft Decoding of RS Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Reed-Solomon Codes over Fields of Characteristic Zero.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Low-Complexity Koetter-Vardy Decoding of Reed-Solomon Codes using Module Minimization.
Proceedings of the 2019 IEEE International Conference on Communications, 2019

2018
Algebraic Coding Theory for Networks, Storage, and Security (Dagstuhl Seminar 18511).
Dagstuhl Reports, 2018

Progressive Algebraic Soft Decoding of Reed-Solomon Codes Using Module Minimization.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Structural Properties of Twisted Reed-Solomon Codes with Applications to Cryptography.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm.
Electron. Notes Discret. Math., 2017

Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero.
Electron. Notes Discret. Math., 2017

Algebraic Soft Decoding Algorithms for Reed-Solomon Codes Using Module.
CoRR, 2017

Code Constructions based on Reed-Solomon Codes.
CoRR, 2017

On the Success Probability of Decoding (Partial) Unit Memory Codes.
CoRR, 2017

Security Considerations of a New Helper Data Scheme for Physical Unclonable Functions.
CoRR, 2017

Using Convolutional Codes for Key Extraction in Physical Unclonable Functions.
CoRR, 2017

Constraints for coded tunnels across long latency bottlenecks with ARQ-based congestion control.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Multi-block interleaved codes for local and global read access.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Coding Theory in the Time of Big Data (Dagstuhl Seminar 16321).
Dagstuhl Reports, 2016

Timing Attack Resilient Decoding Algorithms for Physical Unclonable Functions.
CoRR, 2016

A New Error Correction Scheme for Physical Unclonable Functions.
CoRR, 2016

Guruswami-Sudan List Decoding for Complex Reed-Solomon Codes.
CoRR, 2016

Space-time codes based on rank-metric codes and their decoding.
Proceedings of the International Symposium on Wireless Communication Systems, 2016

Algebraic chase decoding of Reed-Solomon codes using module minimisation.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

An alternative decoding method for Gabidulin codes in characteristic zero.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On (partial) unit memory codes based on Reed-Solomon codes for streaming.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Online Reliability Testing for PUF Key Derivation.
Proceedings of the 6th International Workshop on Trustworthy Embedded Devices, 2016

2015
Coherence Optimization and Best Complex Antipodal Spherical Codes.
IEEE Trans. Signal Process., 2015

Code-Based Cryptosystems Using Generalized Concatenated Codes.
CoRR, 2015

On Error Correction for Physical Unclonable Functions.
CoRR, 2015

Error Correction for Differential Linear Network Coding in Slowly-Varying Networks.
CoRR, 2015

Low-Area Reed Decoding in a Generalized Concatenated Code Construction for PUFs.
Proceedings of the 2015 IEEE Computer Society Annual Symposium on VLSI, 2015

2014
Canalizing Boolean Functions Maximize Mutual Information.
IEEE Trans. Inf. Theory, 2014

Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability.
Des. Codes Cryptogr., 2014

Fast skew-feedback shift-register synthesis.
Des. Codes Cryptogr., 2014

Inferring Boolean functions via higher-order correlations.
Comput. Stat., 2014

Error Correction for Physical Unclonable Functions Using Generalized Concatenated Codes.
CoRR, 2014

Reduced List-Decoding of Reed-Solomon Codes Using Reliability Information.
CoRR, 2014

2013
A Unified View on Known Algebraic Decoding Algorithms and New Decoding Concepts.
IEEE Trans. Inf. Theory, 2013

Properties of Boolean networks and methods for their tests.
EURASIP J. Bioinform. Syst. Biol., 2013

Harmonic analysis of Boolean networks: determinative power and perturbations.
EURASIP J. Bioinform. Syst. Biol., 2013

Dictionary Adaptation in Sparse Recovery Based on Different Types of Coherence.
CoRR, 2013

Computing preimages of Boolean networks.
BMC Bioinform., 2013

On the noise sensitivity and mutual information of (nested-) canalizing Boolean functions.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

2012
Boolean Models of Regulatory Networks: The Predecessor Problem.
Int. J. Comput. Their Appl., 2012

Model-based analysis of an adaptive evolution experiment with Escherichia coli in a pyruvate limited continuous culture with glycerol.
EURASIP J. Bioinform. Syst. Biol., 2012

Some Comments on the Strong Simplex Conjecture
CoRR, 2012

Efficient decoding of Partial Unit Memory codes of arbitrary rate.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Properties and encoding aspects of direct product convolutional codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Design of short barcodes for next generation sequencing of DNA and RNA.
Proceedings of the Proceedings 2012 IEEE International Workshop on Genomic Signal Processing and Statistics, 2012

Einführung in die Nachrichtentechnik.
Oldenbourg, ISBN: 978-3-486-70880-6, 2012

2011
Linearized Shift-Register Synthesis.
IEEE Trans. Inf. Theory, 2011

Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes.
IEEE Trans. Inf. Theory, 2011

On (Partial) unit memory codes based on Gabidulin codes.
Probl. Inf. Transm., 2011

Detecting controlling nodes of boolean regulatory networks.
EURASIP J. Bioinform. Syst. Biol., 2011

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

Performance of error correction based on Compressed Sensing.
Proceedings of the 8th International Symposium on Wireless Communication Systems, 2011

Optimal threshold-based multi-trial error/erasure decoding with the Guruswami-Sudan algorithm.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Solving the key equation for Hermitian codes with a division algorithm.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the Predecessor Problem in Boolean Network Models of Regulatory Networks.
Proceedings of the ISCA 3rd International Conference on Bioinformatics and Computational Biology, 2011

2010
Syndrome decoding of Reed-Solomon codes beyond half the minimum distance based on shift-register synthesis.
IEEE Trans. Inf. Theory, 2010

Multitrial decoding of concatenated codes using fixed thresholds.
Probl. Inf. Transm., 2010

Decoding of random network codes.
Probl. Inf. Transm., 2010

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

Single-trial decoding of concatenated codes using fixed or adaptive erasing.
Adv. Math. Commun., 2010

The Euclidean algorithm for Generalized Minimum Distance decoding of Reed-Solomon codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Adaptive single-trial error/erasure decoding of binary codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

A basis for all solutions of the key equation for Gabidulin codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Termination and tailbiting of rate-k/n direct product convolutional codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesis.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Optimal thresholds for GMD decoding with ℓ+1 over ℓ-extended Bounded Distance decoders.
Proceedings of the IEEE International Symposium on Information Theory, 2010

On spectral estimators of Boolean functions.
Proceedings of the IEEE International Symposium on Information Theory, 2010

A fast Generalized Minimum Distance decoder for Reed-Solomon codes based on the extended Euclidean algorithm.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Mathematik der digitalen Medien - präzise, verständlich, einleuchtend.
VDE-Verlag, ISBN: 978-3-8007-3137-4, 2010

2009
Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs.
IEEE Trans. Inf. Theory, 2009

An improved decoding algorithm for finite-geometry LDPC codes.
IEEE Trans. Commun., 2009

Two bit-flipping decoding algorithms for low-density parity-check codes.
IEEE Trans. Commun., 2009

Algebraic codes for network coding.
Probl. Inf. Transm., 2009

On Extended Forney-Kovalev GMD decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

One family of algebraic codes for network coding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Serially concatenated space time convolutional codes and continuous phase modulation.
IEEE Trans. Commun., 2008

Channel Correlation Properties in OFDM by using Time-Varying Cyclic Delay Diversity.
J. Commun., 2008

Mutual-information-based adaptive coding and modulation in bit-interleaved OFDM systems using punctured LDPC codes.
Eur. Trans. Telecommun., 2008

Adaptive coding and modulation in MIMO OFDMA systems.
Proceedings of the IEEE 19th International Symposium on Personal, 2008

Mutual information of V-BLAST transmission.
Proceedings of the 2008 5th International Symposium on Wireless Communication Systems, 2008

Heuristic resource allocation for sum rate optimization in MIMO-OFDM systems using eigenvalue updates.
Proceedings of the 2008 5th International Symposium on Wireless Communication Systems, 2008

Decoding generalized concatenated codes using Interleaved Reed-Solomon codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Boolean functions with noisy inputs.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Codes for network coding.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Decoding of interleaved RS codes with the Euclidean algorithm.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Woven Coded CPFSK With Hierarchical Code Structure.
IEEE Trans. Commun., 2007

Finding distance profiles of unequal error protection block codes.
Eur. Trans. Telecommun., 2007

Resulting Channel Characteristics from Time-Varying Cyclic Delay Diversity in OFDM.
Proceedings of the 66th IEEE Vehicular Technology Conference, 2007

On Multidimensional BICM-ID with 8-PSK Constellation Labeling.
Proceedings of the IEEE 18th International Symposium on Personal, 2007

From Block to Convolutional Codes using Block Distances.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Enhancing the Correcting Radius of Interleaved Reed-Solomon Decoding using Syndrome Extension Techniques.
Proceedings of the IEEE International Symposium on Information Theory, 2007

On the Mapping of Low-Density Parity-Check Codes for Bit-Interleaved Coded Modulation.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Improving the Performance of Protograph LDPC Codes by Using Different Transmission Energies.
Proceedings of the IEEE International Symposium on Information Theory, 2007

On Achievable Rates in the Two User AWGN Broadcast Channel with Finite Input Alphabets.
Proceedings of the IEEE International Symposium on Information Theory, 2007

On Active Hamming Distance Measures for Trellis Coded Modulation.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A Modified Bit-Flipping Decoding Algorithm for Low-Density Parity-Check Codes.
Proceedings of IEEE International Conference on Communications, 2007

2006
On time-varying cyclic delay diversity.
Eur. Trans. Telecommun., 2006

Multidimensional 16-QAM constellation labeling of BI-STCM-ID with the Alamouti scheme.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

Decoding Reed-Solomon Codes Beyond Half the Minimum Distance using Shift-Register Synthesis.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Optimized Asymptotic Puncturing Distributions for Different LDPC Code Constructions.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On the rank of LDPC matrices constructed by Vandermonde matrices and RS codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Error and Erasure Correction of Interleaved Reed-Solomon Codes.
Proceedings of the Coding and Cryptography, International Workshop, 2005

On polyalphabetic block codes.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Interleaved Reed-Solomon codes in concatenated code designs.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Multitrial decoding of concatenated Reed-Solomon codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Encoding and distance estimation of product convolutional codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution.
Proceedings of IEEE International Conference on Communications, 2005

Two decoding algorithms for low-density parity-check codes.
Proceedings of IEEE International Conference on Communications, 2005

2004
On nested convolutional codes and their application to woven codes.
IEEE Trans. Inf. Theory, 2004

Woven convolutional codes. II: decoding aspects.
IEEE Trans. Inf. Theory, 2004

Partially concatenated convolutional codes.
IEEE Trans. Commun., 2004

Woven coded continuous phase frequency shift keying.
Eur. Trans. Telecommun., 2004

Construction, analysis and performance of generalised woven codes.
Eur. Trans. Telecommun., 2004

Guest Editorial.
Eur. Trans. Telecommun., 2004

On space time concatenated convolutional codes.
Proceedings of the 2004 ITG Workshop on Smart Antennas, 2004

Finding a list of best paths in a trellis.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Design of woven coded CPFSK via hierarchical code structure.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A repeat request strategy based on sliding window decoding of convolutional codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Codes with good slope for serially concatenated trellis coded modulation.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Maximum rank distance codes as space-time codes.
IEEE Trans. Inf. Theory, 2003

On space-frequency coding using cyclic delay diversity for OFDM-based transmission systems.
Eur. Trans. Telecommun., 2003

Construction and soft-in/soft-out decoding of recursive codes based on the Plotkin-construction over arbitrary finite sets.
Proceedings of the Global Telecommunications Conference, 2003

2001
Woven codes with outer warp: variations, design, and distance properties.
IEEE J. Sel. Areas Commun., 2001

2000
On the equivalence of generalized concatenated codes and generalized error location codes.
IEEE Trans. Inf. Theory, 2000

Generalized Concatenation of Encoded CPFSK Modulation.
Eur. Trans. Telecommun., 2000

1999
An Introduction to Generalized Concatenated Codes.
Eur. Trans. Telecommun., 1999

Array Codes Correcting Likely Burst Error Patterns.
Eur. Trans. Telecommun., 1999

Rectangular Basis of a Linear Code.
Proceedings of the Cryptography and Coding, 1999

Rectangular Codes and Rectangular Algebra.
Proceedings of the Applied Algebra, 1999

Some Results on Generalized Concatenation of Block Codes.
Proceedings of the Applied Algebra, 1999

Digitale Netze - Funktionsgruppen digitaler Netze und Systembeispiele.
Teubner, ISBN: 978-3-519-06191-5, 1999

Channel Coding for Telecommunications.
Wiley, ISBN: 978-0-471-98277-7, 1999

1998
Array Codes Correcting a Two-Dimensional Cluster of Errors.
IEEE Trans. Inf. Theory, 1998

Generalized concatenation of encoded tamed frequency modulation.
IEEE Trans. Commun., 1998

On Iterative Soft-Decision Decoding of Linear Binary Block Codes and Product Codes.
IEEE J. Sel. Areas Commun., 1998

<i>Letter</i> soft-decision decoding of linear block codes as optimization problem.
Eur. Trans. Telecommun., 1998

1997
On the effects of trellis shaping in OFDM systems.
Ann. des Télécommunications, 1997

Capacity of MC-FDMA in mobile communications.
Proceedings of the 8th IEEE International Symposium on Personal, 1997

1996
Singleton-type bounds for blot-correcting codes.
IEEE Trans. Inf. Theory, 1996

Generalized concatenation of convolutional codes.
Eur. Trans. Telecommun., 1996

1995
Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes.
IEEE Trans. Inf. Theory, 1995

Course on Simulation in Information Technology: the Global System for Mobile communications.
Proceedings of the 1995 International Conference on Acoustics, 1995

1990
Coded Modulation with Generalized Multiple Concatenation of Block Codes.
Proceedings of the Applied Algebra, 1990

1988
Decoding of Generalized Concatenated Codes.
Proceedings of the Applied Algebra, 1988

1987
Ein Verfahren zur Decodierung von binären linearen Blockcodes über die halbe Mindestdistanz ohne und mit Kanalzustandsinformation.
PhD thesis, 1987

On Decoding Binary Quadratic Residue Codes.
Proceedings of the Applied Algebra, 1987

1986
Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes.
IEEE Trans. Inf. Theory, 1986

1985
A Decoding Algorithm for Linear Codes.
Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985


  Loading...