The DOI matches its Crossref record.
On the performance evaluation of trellis codes
Abstract
Generating function techniques for analyzing the error event and the bit-error probabilities for trellis codes are considered. The conventional state diagram approach for linear codes where the number of states is equal to the number of trellis states cannot be applied directly to arbitrary trellis codes, and instead, a state diagram where the number of states is equal to the square of the number of trellis states must be used. It is shown that for an interesting class of trellis codes a modified generating function can be defined for which the number of states {\em is equal to} the number of trellis states. The class of codes considered includes trellis codes of rateR=(n-1)/nbased upon set partitioning whenever the first partition breaks the signal constellation into two subsets which have the same "configuration matrix," i.e., the same ordered set of mutual distances. The complexity of calculating this modified generating function is the same as for the ordinary generating function of a convolutional code with the same number of trellis states. Bounds on the performance of some interesting codes are given based upon this method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
8-PSK trellis codes for a Rayleigh channel
Zehavi, E. (1992) · IEEE Transactions on Communications · doi:10.1109/26.141453 · Cited by 1,018
Self-citationModulation and coding for linear Gaussian channels
Forney, G. D., & Ungerboeck, G. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720542 · Cited by 597
A pragmatic approach to trellis-coded modulation
Viterbi, A. J., Wolf, J. K., Zehavi, E., & Padovani, R. (1989) · IEEE Communications Magazine · doi:10.1109/35.31452 · Cited by 259
Self-citation
Metadata
- Authors
- Zehavi, E., & Wolf, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1987-03
- Volume
- 33
- Issue
- 2
- Pages
- 196-202
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2152143810
- Cited by
- 200
- References
- 0
- FWCI
- 10.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the performance evaluation of trellis codes. https://app.cochat.ai/papers/10.1109/tit.1987.1057292
- The paper
- Zehavi, E., & Wolf, J. (1987). On the performance evaluation of trellis codes. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1987.1057292
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.