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.
収録刊行物
-
- Proceedings of IEEE International Symposium on Information Theory
-
Proceedings of IEEE International Symposium on Information Theory 364-, 2002-11-22
IEEE