• DocumentCode
    939788
  • Title

    On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)

  • Author

    Johannesson, Rolf ; Zigangirov, K.

  • Volume
    31
  • Issue
    1
  • fYear
    1985
  • fDate
    1/1/1985 12:00:00 AM
  • Firstpage
    100
  • Lastpage
    102
  • Abstract
    Multitype branching processes have been employed to determine the stack algorithm computational distribution for one subtree. These results are extended here to the distribution of the number of computations in any finite number of subtrees. Starting from the computational distribution for K-1 subsequent subtrees, a recurrent equation for the distribution for K subsequent subtrees is determined.
  • Keywords
    Sequential decoding; Tree coding; Cellular neural networks; Convolutional codes; Decoding; Distributed computing; Equations; Probability distribution; Random variables; Superluminescent diodes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1985.1057001
  • Filename
    1057001
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=939788