Publication: Complete MDP convolutional codes
Complete MDP convolutional codes
Date
Date
Date
Citations
Lieb, J. (2019). Complete MDP convolutional codes. Journal of Algebra and Its Applications, 18(06), 1950105. https://doi.org/10.1142/s0219498819501056
Abstract
Abstract
Abstract
Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a certain length. Reverse MDP convolutional codes have the additional advantage that they are suitable for forward and backward decoding algorithms. Beyond that the subclass of complete MDP convolutional codes has the ability to reduce the waiting time during decoding. The first main result of this p
Additional indexing
Creators (Authors)
Journal/Series Title
Journal/Series Title
Journal/Series Title
Volume
Volume
Volume
Number
Number
Number
Page Range
Page Range
Page Range
Item Type
Item Type
Item Type
In collections
Dewey Decimal Classifikation
Dewey Decimal Classifikation
Dewey Decimal Classifikation
Keywords
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
OA Status
OA Status
OA Status
Free Access at
Free Access at
Free Access at
Publisher DOI
Citations
Lieb, J. (2019). Complete MDP convolutional codes. Journal of Algebra and Its Applications, 18(06), 1950105. https://doi.org/10.1142/s0219498819501056