default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Fujisaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Hiroshi Fujisaki:
On Flow Equivalence of the Subshifts Associated with the Stream Version of Asymmetric Binary Systems. ISITA 2024: 165-169- 2023
- [j13]Hiroshi Fujisaki:
Enumeration of Both-Ends-Fixed k-Ary Necklaces and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(3): 431-439 (2023) - 2020
- [j12]Hiroshi Fujisaki:
On Irreducibility of the Stream Version of Asymmetric Binary Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(5): 757-768 (2020) - [j11]Yuta Sakai
, Ken-ichi Iwata, Hiroshi Fujisaki:
Modular Arithmetic Erasure Channels and Their Multilevel Channel Polarization. IEEE Trans. Inf. Theory 66(7): 3976-4006 (2020)
2010 – 2019
- 2019
- [c14]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions. ISIT 2019: 2109-2113 - [i3]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions. CoRR abs/1904.11721 (2019) - 2018
- [c13]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels. ISIT 2018: 856-860 - [c12]Hiroshi Fujisaki:
Invariant Measures for the Subshifts Associated with the Asymmetric Binary Systems. ISITA 2018: 643-647 - [i2]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels. CoRR abs/1801.04422 (2018) - [i1]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Modular Arithmetic Erasure Channels and Their Multilevel Channel Polarization. CoRR abs/1804.09016 (2018) - 2016
- [j10]Hiroshi Fujisaki:
On the Topological Entropy of the Discretized Markov β-Transformations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2238-2247 (2016) - [c11]Hiroshi Fujisaki:
Correlational properties of the full-length sequences based on the discretized Markov transformations. ISITA 2016: 606-610 - 2012
- [j9]Yasuhiro Matsunaga, Hiroshi Fujisaki, Tohru Terada, Tadaomi Furuta, Kei Moritsugu, Akinori Kidera:
Minimum Free Energy Path of Ligand-Induced Transition in Adenylate Kinase. PLoS Comput. Biol. 8(6) (2012) - [c10]Hiroshi Fujisaki:
On embedding conditions of shifts of finite type into the Fibonacci-Dyck shift. ISIT 2012: 274-278 - 2011
- [j8]Hiroshi Fujisaki:
Performance Analysis of SSMA Communication Systems With Spreading Sequences of Markov Chains: Large Deviations Principle Versus the Central Limit Theorem. IEEE Trans. Inf. Theory 57(4): 1959-1967 (2011) - 2010
- [c9]Hiroshi Fujisaki:
On embeddings of shifts of finite type into the golden-mean-Dyck shift. ISITA 2010: 583-588
2000 – 2009
- 2009
- [c8]Hiroshi Fujisaki:
Entropy of the induced transformations associated with the interval algorithm. ISIT 2009: 2056-2060 - 2008
- [j7]Hiroshi Fujisaki:
Generating Stochastic Processes Based on the Finitary Interval Algorithm. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2482-2488 (2008) - [j6]Hiroshi Fujisaki, Hayato Sugimori:
Phase-Shift-Free M-Phase Spreading Sequences of Markov Chains. IEEE Trans. Circuits Syst. I Regul. Pap. 55-I(3): 876-882 (2008) - [c7]Hiroshi Fujisaki:
Large deviations analysis of SSMA communication systems with spreading sequences of Markov chains. ISIT 2008: 1383-1387 - 2007
- [j5]Hiroshi Fujisaki:
Design of Optimum M-Phase Spreading Sequences of Markov Chains. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(10): 2055-2065 (2007) - 2006
- [j4]Hiroshi Fujisaki, Gerhard Keller:
The Central Limit Theorem for the Normalized Sums of the MAI for SSMA Communication Systems Using Spreading Sequences of Markov Chains. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(9): 2307-2314 (2006) - 2005
- [j3]Hiroshi Fujisaki, Yosuke Yamada:
On Bit Error Probabilities of SSMA Communication Systems Using Spreading Sequences of Markov Chains. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2669-2677 (2005) - [j2]Hiroshi Fujisaki:
Discretized Markov Transformations - -An Example of Ultradiscrete Dynamical Systems - -. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2684-2691 (2005) - [c6]Hiroshi Fujisaki, Gerhard Keller:
Approximations for bit error probabilities in SSMA communication systems using spreading sequences of Markov chains. ISCAS (2) 2005: 872-875 - 2004
- [c5]Hiroshi Fujisaki:
On distributions of multiple access interference for spread spectrum communication systems using M-phase spreading sequences of Markov chains. ISCAS (4) 2004: 609-612 - 2003
- [c4]Hiroshi Fujisaki:
Optimization of 3-phase spreading sequences of Markov chains. ISCAS (3) 2003: 124-127 - 2002
- [j1]Hiroshi Fujisaki:
Statistical Properties of Real-Valued Sequences Generated by Chebyshev Maps. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(9): 2003-2008 (2002) - 2001
- [c3]Hiroshi Fujisaki:
On optimum 3-phase spreading sequences of simple Markov chains. ISCAS (3) 2001: 229-232 - 2000
- [c2]Tohru Kohda, Hiroshi Fujisaki:
The Jacobian elliptic Chebyshev rational maps can generate sequences of i.i.d. random variables. ISCAS 2000: 221-224 - [c1]Tohru Kohda, Hiroshi Fujisaki, Shigeru Ideue:
On distributions of correlation values of spreading sequences based on Markov information sources. ISCAS 2000: 225-228
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 00:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
