The structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes

説明

This paper investigates the structure and complexity of low-weight subtrellises for binary linear block codes. The state and branch complexities of low-weight subtrellises for Reed-Muller (RM) codes and some extended permuted BCH (EBCH) codes are given.

収録刊行物

詳細情報 詳細情報について

問題の指摘

ページトップへ