Skip to main content
SpringerLink
Log in

The BCJR Trellis and Trellis Decoders for Some BCH Codes

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Lucent Technologies, Allentown, PA 18103, USA, , , , , , US

    Xiao-an Wang

  2. School of Electrical Engineering, Cornell University, Ithaca, NY 14853, USA, , , , , , US

    Stephen B. Wicker

Authors
  1. Xiao-an Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephen B. Wicker
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: February 11, 1998; revised version: March 10, 1999

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050116

Search

Navigation