00000cab a22000003a 4500 UP-99796217608517734 Buklod 20231007234514.0 m |o d | ta 080912s xx d | ||r ||||| || (iLib)UPD-00051795502 DENGII eng Wang, Xiao-an The BCJR Trellis and Trellis Decoders for Some BCH Codes. Vol. 9, no. 6 pp. 521-546 This paper provides an overview of trellis descriptions for block codes. The design and implementation of efficient trellis decoders for the (32, 26) and the (32, 21) BCH codes is then considered in some detail. Minimum edge and vertex counts for the (32, 26) code are derived, and then generalized for arbitrary extended Hamming codes. A subcode analysis technique is used to tighten the lower bound on edge complexity for the (32, 21) code. A trellis is then found that satisfies the optimized lower bound with equality. Algebraic block codes. Soft decision decoding. Trellis decoding. Wicker, Stephen B. Applicable algebra in engineering, communication and computing. 9, 6 (1999). FO UPD DENG-II Article