Martin Bossert

From MaRDI portal
Revision as of 05:09, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:962240

Available identifiers

zbMath Open bossert.martinMaRDI QIDQ962240

List of research outcomes





PublicationDate of PublicationType
Shift-sum decoding of non-binary cyclic codes2024-07-22Paper
On Hard and Soft Decision Decoding of BCH Codes2024-03-14Paper
Coherence Optimization and Best Complex Antipodal Spherical Codes2018-08-22Paper
Low-rank matrix recovery using Gabidulin codes in characteristic zero2018-04-13Paper
Decoding interleaved Gabidulin codes using Alekhnovich's algorithm2018-04-13Paper
Code-Based Cryptosystems Using Generalized Concatenated Codes2018-04-05Paper
Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs2017-08-08Paper
Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes2017-07-27Paper
Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis2017-07-27Paper
Linearized Shift-Register Synthesis2017-07-12Paper
A Unified View on Known Algebraic Decoding Algorithms and New Decoding Concepts2017-06-08Paper
Canalizing Boolean Functions Maximize Mutual Information2017-05-16Paper
https://portal.mardi4nfdi.de/entity/Q52589002015-06-24Paper
Kanalcodierung2015-06-24Paper
Inferring Boolean functions via higher-order correlations2015-03-05Paper
Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability2014-04-29Paper
Fast skew-feedback shift-register synthesis2014-02-25Paper
Multitrial decoding of concatenated codes using fixed thresholds2012-05-09Paper
Decoding of random network codes2012-03-13Paper
Single-trial decoding of concatenated codes using fixed or adaptive erasing2010-04-06Paper
Algebraic codes for network coding2010-03-16Paper
https://portal.mardi4nfdi.de/entity/Q36337362009-06-23Paper
Woven Convolutional Codes II: Decoding Aspects2008-12-21Paper
On Nested Convolutional Codes and Their Application to Woven Codes2008-12-21Paper
Maximum rank distance codes as space~time codes2008-12-21Paper
Coding and Cryptography2007-05-02Paper
https://portal.mardi4nfdi.de/entity/Q49453582002-03-18Paper
https://portal.mardi4nfdi.de/entity/Q45026332002-02-21Paper
https://portal.mardi4nfdi.de/entity/Q45026252001-01-14Paper
On the equivalence of generalized concatenated codes and generalized error location codes2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q45010172000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45010282000-09-03Paper
Array codes correcting a two-dimensional cluster of errors1999-11-21Paper
Codes correcting a set of clusters of errors or erasures.1998-08-19Paper
Singleton-type bounds for blot-correcting codes1997-12-01Paper
https://portal.mardi4nfdi.de/entity/Q38387111996-01-01Paper
Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes1995-11-07Paper
https://portal.mardi4nfdi.de/entity/Q46925841993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q33562221991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38294771989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38294871989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37315191986-01-01Paper
Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)1986-01-01Paper

Research outcomes over time

This page was built for person: Martin Bossert