Publication: Necessary field size and probability for MDP and complete MDP convolutional codes
Necessary field size and probability for MDP and complete MDP convolutional codes
Date
Date
Date
Citations
Lieb, J. (2019). Necessary field size and probability for MDP and complete MDP convolutional codes. Designs, Codes and Cryptography, 87(12), 3019–3043. https://doi.org/10.1007/s10623-019-00661-6
Abstract
Abstract
Abstract
It has been shown that maximum distance profile (MDP) convolutional codes have optimal recovery rate for windows of a certain length, when transmitting over an erasure channel. In addition, the subclass of complete MDP convolutional codes has the ability to reduce the waiting time during decoding. Since so far general constructions of these codes have only been provided over fields of very large size, there arises the question about the necessary field size such that these codes could exist. In this paper, we derive upper bounds on th
Additional indexing
Creators (Authors)
- Lieb, Julia
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
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
Publisher DOI
Citations
Lieb, J. (2019). Necessary field size and probability for MDP and complete MDP convolutional codes. Designs, Codes and Cryptography, 87(12), 3019–3043. https://doi.org/10.1007/s10623-019-00661-6
