On the computation of the performance probabilities for block codes with a bounded-distance decoding rule

DOI10.1109/18.2603zbMath0647.94021OpenAlexW2019114850MaRDI QIDQ3792633

Arne Dür

Publication date: 1988

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.2603

zbMATH Keywords

binary codesMDS codesdiscrete memoryless channelgeneralized distanceBCH codeblock codeprobability of erroneous decodingexpected number of symbol decoding errorsgeneralized weight enumerator polynomialsincomplete decoding ruleprobability of decoding failureReed- Solomon code

Mathematics Subject Classification ID

Decoding (94B35) Error probability in coding theory (94B70)

This page was built for publication: On the computation of the performance probabilities for block codes with a bounded-distance decoding rule