32 citations · 174 across the 33 of their papers we have counts for
42 papers
On Hard and Soft Decision Decoding of BCH Codes
Martin Bossert, Rebekka Schulz, Sebastian Bitzer
The binary primitive BCH codes are cyclic and are constructed by choosing a subset of the cyclotomic cosets. Which subset is chosen determines the dimension, the minimum distance a…
Bounds and Genericity of Sum-Rank-Metric Codes
Cornelia Ott, Sven Puchinger, Martin Bossert
We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asy…
On Decoding Using Codewords of the Dual Code
Martin Bossert
We present novel decoding schemes for hard and soft decision decoding of block codes using the minimal weight codewords of the dual code. The decoding schemes will be described for…
Reed-Solomon Codes over Fields of Characteristic Zero
Carmen Sippel, Cornelia Ott, Sven Puchinger +1
We study Reed--Solomon codes over arbitrary fields, inspired by several recent papers dealing with Gabidulin codes over fields of characteristic zero. Over the field of rational nu…
Structural Properties of Twisted Reed-Solomon Codes with Applications to Cryptography
Peter Beelen, Martin Bossert, Sven Puchinger +1
We present a generalisation of Twisted Reed-Solomon codes containing a new large class of MDS codes. We prove that the code class contains a large subfamily that is closed under du…
Algebraic Soft Decoding of Reed-Solomon Codes Using Module Minimization
Jiongyue Xing, Li Chen, Martin Bossert
The interpolation based algebraic decoding for Reed-Solomon (RS) codes can correct errors beyond half of the code's minimum Hamming distance. Using soft information, the algebraic…