|
Problemy Peredachi Informatsii, 1995, Volume 31, Issue 2, Pages 44–53
(Mi ppi273)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
Bounded Minimum Distance Decoding of (P)UM Codes Based on RS Codes
U. Dettmar, U. K. Sorger
Abstract:
In this paper, we describe the construction of (partial) unit memory ((P)UM) codes based on RS codes and discuss an algorithm for bounded minimum distance decoding of these codes up to half the “designed” extended row distance. The complexity of this algorithm is upper bounded by $4k_1K_B$, where $k_1$ denotes the memory of the (P)UM code and $K_B$ is the complexity for a bounded minimum distance decoder of a component block code of the (P)UM code considered.
Received: 03.12.1993 Revised: 05.05.1994
Citation:
U. Dettmar, U. K. Sorger, “Bounded Minimum Distance Decoding of (P)UM Codes Based on RS Codes”, Probl. Peredachi Inf., 31:2 (1995), 44–53; Problems Inform. Transmission, 31:2 (1995), 135–142
Linking options:
https://www.mathnet.ru/eng/ppi273 https://www.mathnet.ru/eng/ppi/v31/i2/p44
|
Statistics & downloads: |
Abstract page: | 297 | Full-text PDF : | 189 |
|