Abstract.
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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: February 11, 1998; revised version: March 10, 1999
Rights and permissions
About this article
Cite this article
Wang, Xa., Wicker, S. The BCJR Trellis and Trellis Decoders for Some BCH Codes. AAECC 9, 521–546 (1999). https://doi.org/10.1007/s002000050116
Issue Date:
DOI: https://doi.org/10.1007/s002000050116