Zobrazeno 1 - 10
of 259
pro vyhledávání: '"Bossert , Martin"'
Autor:
Bossert, Martin
The Plotkin construction combines two codes to a code of doubled length. It can be applied recursively. The class of Reed-Muller (RM) codes is a particular example. Also, a special class of generalized concatenated codes (GCC) can be described as rec
Externí odkaz:
http://arxiv.org/abs/2408.12946
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 and the weight distribution of the BCH code. We construct possible BCH
Externí odkaz:
http://arxiv.org/abs/2107.07401
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 asymptotic bounds that cover the asymptotic setting that has not yet been
Externí odkaz:
http://arxiv.org/abs/2102.02244
Autor:
Bossert, Martin
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 cyclic codes where polynomials can be used, however, the modification
Externí odkaz:
http://arxiv.org/abs/2001.02956
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 numbers, we derive bounds on the coefficient growth during encoding and
Externí odkaz:
http://arxiv.org/abs/1901.06863
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 duality. Furthermore, we study the Schur squares of the new codes and sh
Externí odkaz:
http://arxiv.org/abs/1801.07003
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 soft decoding (ASD) further improves the decoding performance. This pa
Externí odkaz:
http://arxiv.org/abs/1712.00938
Autor:
Schelling, Michael, Bossert, Martin
Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size $q$ of the underlying field $\mathbb{F}_q$. In this paper we present a code construction which yields cod
Externí odkaz:
http://arxiv.org/abs/1706.05830
In this paper, we derive analytic expressions for the success probability of decoding (Partial) Unit Memory codes in memoryless channels. An applications of this result is that these codes outperform individual block codes in certain channels.
C
C
Externí odkaz:
http://arxiv.org/abs/1705.08652