Discretized Markov transformations - An example of ultradiscrete dynamical systems

スポンサーリンク

概要

• 論文の詳細を見る

• We define discretized Markov transformations and find an algorithm to give the number of maximal-period sequences based on discretized Markov transformations. In this report, we focus on the discretized dyadic transformations and the discretized golden mean transformations. Then we find an algorithm to give the number of maximal-period sequences based on these discretized transformations. Moreover, we define a number-theoretic function related to the numbers of maximal-period sequences based on these discretized transformations. We also introduce the entropy of the maximal-period sequences based on these discretized transformations. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers.

• 2005-10-01

著者

• Fujisaki Hiroshi

  Graduate School Of Natural Science And Technology Kanazawa University

関連論文

• On bit error probabilities of SSMA communication systems using spreading sequences of Markov chains
• Discretized Markov transformations - An example of ultradiscrete dynamical systems
• The Central Limit Theorem for the Normalized Sums of the MAI for SSMA Communication Systems Using Spreading Sequences of Markov Chains(Sequence Design and its Application in Communications)
• On Distributions of Multiple Access Interference for Spread Spectrum Communication Systems Using M-Phase Spreading Sequences of Markov Chains
• Design of Optimum M-Phase Spreading Sequences of Markov Chains(Communications and Sequences,Nonlinear Theory and its Applications)
• Generating Stochastic Processes Based on the Finitary Interval Algorithm
• On Correlation Values of M-Phase Spreading Sequences of Markov Chains
• On Generating Stochastic Processes Based on the Interval Algorithm
• On auto-correlation values of de Bruijn sequences
• Approximations for Bit Error Probabilities in SSMA Communication Systems Using Spreading Sequences of Markov Chains

スポンサーリンク