The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A binary channel characterization using partitioned Markov chains
Abstract
The characterization of binary communication channels using functions of finite-state Markov chains is considered. Two distributions which are relevant to code evaluation, i.e., the error-free run and error-cluster distributions, are derived. It is shown for anN-state model, partitioned into a group ofkerror-free states andN-kerror states, that the general form of the error-free run distribution is the weighted sum of at mostkexponentials, and that of the error-cluster distribution the weighted sum of at mostN-kexponentials. As evidence of the capability of such models to characterize real communication channels, a simple class of models is investigated and shown experimentally to be capable of representing HF radio statistics.
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
Cites
Parzen, E. (1999) · doi:10.1137/1.9781611971125 · Cited by 1,389
Cited by
Finite-state Markov channel-a useful model for radio communication channels
Wang, H. S., & Moayeri, N. (1995) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.350282 · Cited by 1,647
Metadata
- Authors
- Fritchman, B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1967-04
- Volume
- 13
- Issue
- 2
- Pages
- 221-227
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2101602277
- Cited by
- 433
- References
- 1
- FWCI
- 9.79
- 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: A binary channel characterization using partitioned Markov chains. https://app.cochat.ai/papers/10.1109/tit.1967.1053975
- The paper
- Fritchman, B. (1967). A binary channel characterization using partitioned Markov chains. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1967.1053975
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.
