default search action
Hiroshi Kamabe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c32]Shan Lu, Hiroshi Kamabe:
Enhancing the Maximum Tolerable Number of Active Users for Unsourced Random Access. ISIT 2024: 3195-3200 - 2023
- [c31]Lantian Wei, Shan Lu, Hiroshi Kamabe:
BNNs- and TISTA- Based Signature Code Design for User Identification and Channel Estimation over Multiple-Access Channel with Rayleigh Fading. ITW 2023: 147-152 - [c30]Osama Ahmed, Hiroshi Kamabe:
Privacy Preserving Multi Factor Authentication Protocol for Next Generation Grids Deployed in Smart Cities. MobiSec 2023: 233-247 - 2022
- [j9]Ken-ichi Iwata, Hiroshi Kamabe:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 344 (2022) - [j8]Lantian Wei, Shan Lu, Hiroshi Kamabe, Jun Cheng:
User Identification and Channel Estimation by Iterative DNN-Based Decoder on Multiple-Access Fading Channel. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 417-424 (2022) - [c29]Yuma Narita, Shan Lu, Hiroshi Kamabe:
Accuracy Evaluation of Indoor Positioning by Received Signal Strength using Deep Learning. ICACT 2022: 132-136 - [c28]Hiroshi Kamabe, Takumi Marumo, Shan Lu:
Balanced coding with Lehmer code. ISITA 2022: 69-73 - [c27]Shan Lu, Hiroshi Kamabe:
Improved Survival Probability for Coded Compressed Sensing in Unsourced Random Access. ISITA 2022: 169-173 - 2021
- [c26]Mayumi Kawase, Kazumi Matsumoto, Hiroshi Kamabe, Hidekazu Fukai, Kazunori Terada:
Structural Changes in Discussions Using Design Thinking and Their Effect on Creativity. HCI (5) 2021: 226-241 - [c25]Yuma Narita, Shan Lu, Hiroshi Kamabe:
Accuracy Evaluation of Indoor Positioning by Received Signal Strength using Deep Learning. ICACT 2021: 132-136 - 2020
- [c24]Lantian Wei, Shan Lu, Hiroshi Kamabe, Jun Cheng:
User Identification and Channel Estimation by DNN-Based Decoder on Multiple-Access Channel. GLOBECOM 2020: 1-6 - [c23]Yuya Naruse, Shan Lu, Hiroshi Kamabe:
Design of ZDF code using uniform shift enumerator. ISITA 2020: 126-130
2010 – 2019
- 2019
- [c22]Hiroshi Kamabe, Shan Lu:
Burst Erasure Correction by 2D LDPC Codes. GLOBECOM 2019: 1-7 - [c21]Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe:
Multi-User UD k-Ary Codes Recursively Constructed from Short-Length Multiary Codes for Multiple-Access Adder Channel. ISIT 2019: 425-429 - [i6]Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe:
A construction of UD k-ary multi-user codes from (2m(k-1)+1)-ary codes for MAAC. CoRR abs/1901.06757 (2019) - [i5]A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama, Van Khu Vu, Akiko Manada, Kui Cai, Shunsuke Horii, Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta, Xingwei Zhong, Zhen Mei, Renfei Bu, Jos H. Weber, Vitaly Skachek, Hiroyoshi Morita, N. Hovhannisyan, Hiroshi Kamabe, Shan Lu, Hirosuke Yamamoto, Kengo Hashimoto, Øyvind Ytrehus, Shigeaki Kuzuoka, Mikihiko Nishiara, Han Mao Kiah, Jun Muramatsu, Shigeki Miyake:
Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory. CoRR abs/1907.02944 (2019) - 2018
- [j7]Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
Construction of Parallel Random I/O Codes Using Coset Coding with Hamming Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2125-2134 (2018) - [j6]Shan Lu, Hiroshi Kamabe, Jun Cheng, Akira Yamawaki:
Unrestricted-Rate Parallel Random Input-Output Codes for Multilevel Flash Memory. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2135-2140 (2018) - [c20]Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe:
Recursive Construction of k-Ary Uniquely Decodable Codes for Multiple-Access Adder Channel. ISITA 2018: 565-569 - [c19]Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
An Upper Bound on the Generalized Cayley Distance. ISITA 2018: 600-604 - [c18]Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe:
A New Kind of Nonbinary Uniquely Decodable Codes with Arbitrary Code Length for Multiple-Access Adder Channel. ITW 2018: 1-5 - 2017
- [j5]Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
Worst-Case Performance of ILIFC with Inversion Cells. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2662-2670 (2017) - [c17]Shan Lu, Hiroshi Kamabe, Jun Cheng, Akira Yamawaki:
Construction of unrestricted-rate parallel random input-output code. ISIT 2017: 629-633 - [c16]Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
Lower bounds on the number of write operations by index-less indexed flash code with inversion cells. ISIT 2017: 2483-2487 - [c15]Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
Construction of parallel RIO codes using coset coding with hamming codes. ITW 2017: 239-243 - [c14]Shan Lu, Hiroshi Kamabe, Jun Cheng:
Codes for T-user asymmetric multiple-access channel with independent sources. ITW 2017: 359-363 - [i4]Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
Lower Bounds on the Number of Writing Operations by ILIFC with Inversion Cells. CoRR abs/1701.08927 (2017) - [i3]Shan Lu, Hiroshi Kamabe, Jun Cheng, Akira Yamawaki:
Construction of Unrestricted Rate Parallel Random Input Output Code. CoRR abs/1702.02716 (2017) - [i2]Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
Construction of Parallel RIO Codes using Coset Coding with Hamming Codes. CoRR abs/1705.05596 (2017) - [i1]Kees A. Schouhamer Immink, Stan Baggen, Ferdaous Chaabane, Yanling Chen, Peter H. N. de With, Héla Gassara, Hamed Gharbi, Adel Ghazel, Khaled Grati, Naira M. Grigoryan, Ashot N. Harutyunyan, Masayuki Imanishi, Mitsugu Iwamoto, Ken-ichi Iwata, Hiroshi Kamabe, Brian M. Kurkoski, Shigeaki Kuzuoka, Patrick Langenhuizen, Jan Lewandowsky, Akiko Manada, Shigeki Miyake, Hiroyoshi Morita, Jun Muramatsu, Safa Najjar, Arnak V. Poghosyan, Fatma Rouissi, Yuta Sakai, Ulrich Tamm, Joost van der Putten, Fons van der Sommen, A. J. Han Vinck, Tadashi Wadayama, Dirk Wübben, Hirosuke Yamamoto:
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications. CoRR abs/1707.08567 (2017) - 2016
- [c13]Akira Yamawaki, Hiroshi Kamabe:
Maximization of average number of rewriting of ILIFC with inversion operation. ISITA 2016: 136-140 - 2014
- [c12]Shohei Takeyama, Hiroshi Kamabe:
Code rate of constrained code for phase change memories. ISITA 2014: 620-624 - [c11]Hiroshi Kamabe:
Splicing system and sofic shift. ISTC 2014: 157-161 - 2013
- [c10]Hidetoshi Ustunomiya, Hiroshi Kamabe:
Constructions of multiple error correcting WOM-Code. ISIT 2013: 1072-1076 - 2012
- [j4]Hiroshi Kamabe:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(12): 2099 (2012) - [c9]Hiroshi Kamabe, Hiroshi Ono:
3-Bit decoding algorithm for AWGN channels. ISITA 2012: 1-5 - 2011
- [c8]Hiroshi Kamabe:
Outfix-free and intercode constraints for DNA sequences. ISIT 2011: 1574-1578 - 2010
- [c7]Hiroshi Kamabe:
Floating codes with good average performance. ISITA 2010: 867-872 - [c6]Hiroshi Kamabe:
Constraints for DNA sequences by formal language and its capacity. NaBIC 2010: 622-627
2000 – 2009
- 2009
- [c5]Hiroshi Kamabe:
Insertion rate and optimization of redundancy of constrained systems with unconstrained positions. ISIT 2009: 1559-1563 - 2008
- [c4]Hiroshi Kamabe:
Combinations of Context-Free Shifts and Shifts of Finite Type. BIOCOMP 2008: 587-593 - 2007
- [c3]Hiroshi Kamabe:
Representation of 2 Dimensional RLL Constraints. ISIT 2007: 1171-1175 - 2004
- [c2]Hiroshi Kamabe:
Encoding algorithms for 2 dimensional run-length-limited constraints. ISIT 2004: 193 - 2001
- [c1]Hiroshi Kamabe, Tatsunori Ichihashi:
Three directional spectral null constraints for two-dimensional storage devices. ITW 2001: 93-95
1990 – 1999
- 1994
- [j3]Hiroshi Kamabe:
Irreducible components of canonical diagrams for spectral nulls. IEEE Trans. Inf. Theory 40(5): 1375-1391 (1994) - 1991
- [j2]Hiroshi Kamabe:
Spectral lines of codes given as functions of finite Markov chains. IEEE Trans. Inf. Theory 37(3): 927-941 (1991)
1980 – 1989
- 1989
- [j1]Hiroshi Kamabe:
Minimum scope for sliding block decoder mappings. IEEE Trans. Inf. Theory 35(6): 1335-1340 (1989)
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 2024-10-17 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint