default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaruhiko Kaneko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Ryo Shibata, Haruhiko Kaneko:
Shift-Interleave Coding for DNA-Based Storage: Correction of IDS Errors and Sequence Losses. CoRR abs/2401.14594 (2024)- 2023
- [c35]Yusuke Iiyama, Haruhiko Kaneko:
Gradient Bit-Flipping Decoding for QC-MDPC McEliece PKC. ICCE-Taiwan 2023: 491-492 - 2022
- [c34]Yusuke Iiyama, Haruhiko Kaneko:
A Study on Reaction-Based Attack on QC-MDPC McEliece PKC. ICCE-TW 2022: 103-104 - [c33]Haruhiko Kaneko:
Look-Ahead Bit-Flipping Decoding of MDPC Code. ISIT 2022: 2922-2927 - 2021
- [c32]Ryosuke Nakata, Haruhiko Kaneko:
Synchronization and Asymmetric Error Correction for Nanopore Sequencing. ICCE-TW 2021: 1-2 - 2020
- [j10]Hikari Koremura, Haruhiko Kaneko:
Insertion/Deletion/Substitution Error Correction by a Modified Successive Cancellation Decoding of Polar Code. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(4): 695-703 (2020) - [c31]Haruhiko Kaneko:
Interleaved Non-Binary LDPC Code for Synchronization Error Correction in DNA Storage. ICCE-TW 2020: 1-2 - [c30]Ryo Sakogawa, Haruhiko Kaneko:
Symbolwise MAP Estimation for Multiple-Trace Insertion/Deletion/Substitution Channels. ISIT 2020: 781-785 - [c29]Leo Otani, Haruhiko Kaneko:
Polar Coding for Oversampling Drift Channel. ISITA 2020: 289-293
2010 – 2019
- 2019
- [c28]Len Yoshida, Haruhiko Kaneko:
A Study on Redundant Computation of Matrix-Vector Product for Fault-Tolerant Neural Networks. ICCE-TW 2019: 1-2 - [c27]Hikari Koremura, Haruhiko Kaneko:
Successive Cancellation Decoding of Polar Codes for Insertion/Deletion Error Correction. ISIT 2019: 1357-1361 - 2018
- [c26]Haruhiko Kaneko:
Slepian-Wolf Coding with Side-Information Having Insertion/Deletion Errors. ISITA 2018: 575-579 - 2017
- [c25]Haruhiko Kaneko:
Timing-drift channel model and marker-based error correction coding. ISIT 2017: 1943-1947 - 2016
- [c24]Yuki Katsu, Haruhiko Kaneko:
Low-Latency Lossless Compression for Data Bus Using Multiple-Type Dictionaries. DCC 2016: 610 - [c23]Yuki Katsu, Haruhiko Kaneko:
Low-latency lossless compression codec design for high-throughput data-buses. ICCE-TW 2016: 1-2 - [c22]Ryohei Goto, Kenta Kasai, Haruhiko Kaneko:
Coding of insertion-deletion-substitution channels without markers. ISIT 2016: 635-639 - [c21]Haruhiko Kaneko, Yuki Katsu:
Low-latency lossless compression using dual-stream coding. ISITA 2016: 646-650 - 2015
- [c20]Haruhiko Kaneko:
Failure Recovery Cost Reduction of Disk Arrays Using Adaptive Erasure Correction Coding and Data Compression. PRDC 2015: 255-263 - 2014
- [j9]Daniel Johannes Louw, Haruhiko Kaneko:
A Symbol Based Distributed Video Coding System Using Multiple Hypotheses. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(2): 632-641 (2014) - [j8]Masato Inoue, Haruhiko Kaneko:
Adaptive Marker Coding for Insertion/Deletion/Substitution Error Correction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(2): 642-651 (2014) - [c19]Haruhiko Kaneko:
Symbol-level synchronization using probability lookup-table for IDS error correction. ISITA 2014: 531-535 - [c18]Kousuke Ota, Viet Ta Hong, Haruhiko Kaneko:
Adaptive Erasure Correction Coding for Energy Efficient Dependable Storage Systems. SRDS Workshops 2014: 112-118 - 2013
- [j7]Daniel J. Louw, Haruhiko Kaneko:
Suppressing feedback in a distributed video coding system by employing real field codes. EURASIP J. Adv. Signal Process. 2013: 181 (2013) - [j6]Haruhiko Kaneko:
Periodic Pattern Coding for Last Level Cache Data Compression. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2351-2359 (2013) - [c17]Haruhiko Kaneko, Satoshi Fujii, Hiroaki Sasaki:
Differential Base Pattern Coding for Cache Line Data Compression. DCC 2013: 499 - [c16]Daniel J. Louw, Haruhiko Kaneko:
Efficient conditional entropy estimation for distributed video coding. PCS 2013: 61-64 - 2012
- [c15]Masato Inoue, Haruhiko Kaneko:
Adaptive synchronization marker for insertion/deletion/substitution error correction. ISIT 2012: 508-512 - [c14]Masato Inoue, Haruhiko Kaneko:
Insertion/deletion/substitution error correction using adaptive inversion of synchronization marker. ISITA 2012: 221-225 - [c13]Daniel J. Louw, Haruhiko Kaneko:
A system combining extrapolated and interpolated side information for single view multi-hypothesis distributed video coding. ISITA 2012: 779-783 - 2011
- [c12]Masato Inoue, Haruhiko Kaneko:
Deletion/Insertion/Reversal Error Correcting Codes for Bit-Patterned Media Recording. DFT 2011: 286-293 - 2010
- [c11]Haruhiko Kaneko:
Probabilistic search of nonbinary LDPC codes for distributed video coding. ISITA 2010: 231-236
2000 – 2009
- 2009
- [j5]Haruhiko Kaneko, Eiji Fujiwara:
A Class of Array Codes Correcting a Cluster of Unidirectional Errors for Two-Dimensional Matrix Symbols. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(6): 1508-1519 (2009) - [j4]Haruhiko Kaneko, Eiji Fujiwara:
M-Ary Substitution/Deletion/Insertion/Adjacent-Symbol-Transposition Error Correcting Codes for Data Entry Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(7): 1668-1676 (2009) - [j3]Haruhiko Kaneko, Eiji Fujiwara:
Joint source-cryptographic-channel coding for dependable systems. Int. J. Comput. Appl. Technol. 34(4): 249-256 (2009) - [c10]Yuu Maeda, Haruhiko Kaneko:
Error Control Coding for Multilevel Cell Flash Memories Using Nonbinary Low-Density Parity-Check Codes. DFT 2009: 367-375 - 2008
- [c9]Haruhiko Kaneko, Takuya Matsuzaka, Eiji Fujiwara:
Three-Level Error Control Coding for Dependable Solid-State Drives. PRDC 2008: 281-288 - 2007
- [c8]Haruhiko Kaneko, Eiji Fujiwara:
Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes. AAECC 2007: 158-167 - [c7]Haruhiko Kaneko, Eiji Fujiwara:
Reconstruction of Erasure Correcting Codes for Dependable Distributed Storage System without Spare Disks. DFT 2007: 349-358 - [c6]Kazuyoshi Suzuki, Haruhiko Kaneko, Eiji Fujiwara:
Mac Williams Identity for m-Spotty Weight Enumerator. ISIT 2007: 31-35 - 2006
- [j2]Haruhiko Kaneko:
Low Encoding Complexity Video Compression Based on Low-Density Parity Check Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 340-347 (2006) - [c5]Hiroyuki Ohde, Haruhiko Kaneko, Eiji Fujiwara:
Low-Density Triple-Erasure Correcting Codes for Dependable Distributed Storage Systems. DFT 2006: 175-183 - 2005
- [c4]Haruhiko Kaneko:
Error Control Coding for Semiconductor Memory Systems in the Space Radiation Environment. DFT 2005: 93-101 - 2004
- [j1]Haruhiko Kaneko, Eiji Fujiwara:
A Class of M-Ary Asymmetric Symbol Error Correcting Codes for Data Entry Devices. IEEE Trans. Computers 53(2): 159-167 (2004) - [c3]Haruhiko Kaneko, Mariko Numakami, Eiji Fujiwara:
Nonsystematic M-Ary Asymmetric Error Correcting Codes Designed by Multilevel Coding Method. PRDC 2004: 219-226 - 2003
- [c2]Haruhiko Kaneko, Eiji Fujiwara:
Array Codes Correcting a Cluster of Unidirectional Errors for Two-Dimensional Matrix Symbols. DFT 2003: 242-249
1990 – 1999
- 1999
- [c1]Kiattichai Saowapa, Haruhiko Kaneko, Eiji Fujiwara:
Systematic Deletion/Insertion Error Correcting Codes with Random Error Correction Capability. DFT 1999: 284-292
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-04-24 23:11 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:
