The DOI matches its Crossref record; 7 of the 7 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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Capacity of a Burst-Noise Channel
Gilbert, E. N. (1960) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1960.tb03959.x · Cited by 2,313
Mathematical Foundations of Information Theory.
Snell, J. L., Khinchin, A. I., Silverman, R. A., & Friedman, M. D. (1959) · The American Mathematical Monthly · doi:10.2307/2310044 · Cited by 1,451
Parzen, E. (1999) · doi:10.1137/1.9781611971125 · Cited by 1,389
Coding Theorems of Information Theory
Wolfowitz, J. (1978) · Springer eBooks · doi:10.1007/978-3-642-66822-7 · Cited by 391
On the Identifiability Problem for Functions of Finite Markov Chains
Gilbert, E. J. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706199 · Cited by 97
Coding Theorems of Information Theory
Wolfowitz, J. (1961) · Springer eBooks · doi:10.1007/978-3-662-01510-0 · Cited by 92
Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels
Blackwell, D., Breiman, L., & Thomasian, A. J. (1958) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706452 · Cited by 91
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
Analysis and modeling of impulsive noise in broad-band powerline communications
Zimmermann, M., & Dostert, K. (2002) · IEEE Transactions on Electromagnetic Compatibility · doi:10.1109/15.990732 · Cited by 982
On verifying the first-order Markovian assumption for a Rayleigh fading channel model
Wang, H. S., & Chang, P.-C. (1996) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.492909 · Cited by 531
Finite-state Markov modeling of fading channels - a survey of principles and applications
Sadeghi, P., Kennedy, R., Rapajic, P., & Shams, R. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2008.926683 · Cited by 473
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
- 7
- 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
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.