1960
DOI: 10.1002/j.1538-7305.1960.tb03959.x
|View full text |Cite
|
Sign up to set email alerts
|

Capacity of a Burst-Noise Channel

Abstract: 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 → G and G → 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 t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

5
1,034
0
27

Year Published

1998
1998
2013
2013

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 2,055 publications
(1,066 citation statements)
references
References 1 publication
5
1,034
0
27
Order By: Relevance
“…Our network parameters are LR and MLBS. The network loss model used is the simplified Gilbert model [16] described in Section II. The range of LR and MLBS values was chosen considering very extreme scenarios and covering all possible loss conditions in VoIP problems.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Our network parameters are LR and MLBS. The network loss model used is the simplified Gilbert model [16] described in Section II. The range of LR and MLBS values was chosen considering very extreme scenarios and covering all possible loss conditions in VoIP problems.…”
Section: Methodsmentioning
confidence: 99%
“…One of them is a simplified version of Gilbert's model [16]. Let us denote by X n a binary random variable indicating if packet n is lost.…”
Section: Introductionmentioning
confidence: 99%
“…Every node has an input and an output buffer of 80 packets each to absorb the bursts of incoming and outgoing packets. Apart from packet losses due to the overflow of the input and output buffers and due to late arriving packets, we simulate packet losses on the input and the output links of the nodes via two-state Markovian models, often referred to as the Gilbert model [31]. For given stationary loss probability p and conditional loss probability (the probability that a packet is lost given that the previous packet was lost) p ω|ω we set the parameters of the model as described in [14].…”
Section: Simulation Methodologymentioning
confidence: 99%
“…Correlated Channel: For analysis we use a two-state GilbertElliot model [15], [16] with states '0' and '1' defined as the good and bad state respectively. A packet is received correctly if the channel is in state '0' and otherwise if in state '1'.…”
Section: Iid Channel: a Packet Is Lost Independently Of Other Trans-mentioning
confidence: 99%