1960/09/01 by E. N. Gilbert · 9 citations
Computer Science · #Cellular Automata and Applications
paper · doi:10.1002/j.1538-7305.1960.tb03959.x
crossref issued 1960/09/01 · crossref published 1960/09/01 · crossref published-print 1960/09/01 · openalex publication_date 1960/09/01 · crossref published-online 2013/07/29 · crossref created 2013/07/29 · crossref deposited 2020/10/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28 · crossref indexed 2026/07/30
A model of a burst-noise binary channel uses a Markov chain with two states G and B. In state G, transmission is error-free. In state B, the channel has only probability h of transmitting a digit correctly. For suitably small values of the probabilities, p, P of the B rA G and G rA B transitions, the model simulates burst-noise channels. Probability formulas relate the parameters p, P, h to easily measured statistics and provide run distributions for comparison with experimental measurements. The capacity C of the model channel exceeds the capacity C(sym. bin.) of a memoryless symmetric binary channel with the same error probability. However, the difference is slight for some values of h, p, P; then, time-division encoding schemes may be fairly efficient.