default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHajime Matsui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Hajime Matsui
:
An Algorithm for Finding Self-Orthogonal and Self-Dual Codes Over Gaussian and Eisenstein Integer Residue Rings Via Chinese Remainder Theorem. IEEE Access 11: 23260-23267 (2023)- [j16]Norifumi Ojiro, Kakeru Kaneko, Hajime Matsui:
An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem. Finite Fields Their Appl. 89: 102204 (2023) - 2022
- [j15]Ramy F. Taki ElDin, Hajime Matsui:
Linking Reversed and Dual Codes of Quasi-Cyclic Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 381-388 (2022) - [c14]Norifumi Ojiro, Hajime Matsui:
Construction of reversible integer codes with large moduli via Chinese remainder theorem. ISITA 2022: 179-183 - 2021
- [j14]Hajime Matsui:
A Modulus Factorization Algorithm for Self-Orthogonal and Self-Dual Quasi-Cyclic Codes via Polynomial Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(11): 1649-1653 (2021) - 2020
- [j13]Ramy F. Taki ElDin, Hajime Matsui:
On Reversibility and Self-Duality for Some Classes of Quasi-Cyclic Codes. IEEE Access 8: 143285-143293 (2020) - [j12]Ramy F. Taki ElDin, Hajime Matsui:
Run-Length Constraint of Cyclic Reverse-Complement and Constant GC-Content DNA Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(1): 325-333 (2020) - [c13]Ramy F. Taki ElDin, Hajime Matsui:
Generator Polynomial Matrices of Reversed and Reversible Quasi-Cyclic Codes. ISITA 2020: 165-169 - [c12]Masaki Kawaguchi, Hajime Matsui:
Finding Self-Dual Quasi-Cyclic Codes with Large Minimum Weight via Polynomial Matrices. ISITA 2020: 180-184
2010 – 2019
- 2019
- [j11]Ramy F. Taki ElDin, Hajime Matsui:
Quasi-Cyclic Codes Via Unfolded Cyclic Codes and Their Reversibility. IEEE Access 7: 184500-184508 (2019) - [j10]Jun-ichi Mukuno, Hajime Matsui:
Natural Gradient Descent of Complex-Valued Neural Networks Invariant under Rotations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(12): 1988-1996 (2019) - 2018
- [j9]Hajime Matsui:
A Modulus Factorization Algorithm for Self-Orthogonal and Self-Dual Integer Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(11): 1952-1956 (2018) - [c11]Ramy F. Taki ElDin, Hajime Matsui:
On Constant GC-content Cyclic DNA Codes With Long Codewords. ISITA 2018: 21-25 - 2016
- [j8]Norihiro Nakashima, Hajime Matsui:
Decoding of Projective Reed-Muller Codes by Dividing a Projective Space into Affine Spaces. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(3): 733-741 (2016) - [j7]Hajime Matsui:
A Convolution Theorem for Multiple-Valued Logic Polynomials of a Semigroup Type and Their Fast Multiplication. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1025-1033 (2016) - 2015
- [j6]Hajime Matsui:
On generator matrices and parity check matrices of generalized integer codes. Des. Codes Cryptogr. 74(3): 681-701 (2015) - [j5]Hajime Matsui:
On generator and parity-check polynomial matrices of generalized quasi-cyclic codes. Finite Fields Their Appl. 34: 280-304 (2015) - 2014
- [j4]Hajime Matsui:
Lemma for Linear Feedback Shift Registers and DFTs Applied to Affine Variety Codes. IEEE Trans. Inf. Theory 60(5): 2751-2769 (2014) - [c10]Tadasuke Matsuda, Hajime Matsui, Michihiro Kawanishi, Tatsuo Narikiyo:
Computational complexity of robust schur stability analysis by the generalized stability feeler. AuCC 2014: 55-59 - [c9]Hajime Matsui:
On generator polynomial matrices of generalized pseudo-cyclic codes. ISITA 2014: 353-357 - [c8]Norihiro Nakashima, Hajime Matsui:
A decoding algorithm for projective Reed-Muller codes of 2-dimensional projective space with DFT. ISITA 2014: 358-362 - [i7]Norihiro Nakashima, Hajime Matsui:
Fast Decoding of Projective Reed-Muller Codes by Dividing a Projective Space into Affine Spaces. CoRR abs/1412.4365 (2014) - 2012
- [c7]Hajime Matsui:
Decoding a class of affine variety codes with fast DFT. ISITA 2012: 436-440 - [i6]Hajime Matsui:
Fast Erasure-and-Error Decoding and Systematic Encoding of a Class of Affine Variety Codes. CoRR abs/1208.5429 (2012) - [i5]Hajime Matsui:
Decoding a Class of Affine Variety Codes with Fast DFT. CoRR abs/1210.0083 (2012) - [i4]Hajime Matsui:
Lemma for Linear Feedback Shift Registers and DFTs Applied to Affine Variety Codes. CoRR abs/1211.4728 (2012) - 2010
- [c6]Vo Tam Van, Hajime Matsui, Seiichi Mita:
A Class of Generalized Quasi-Cyclic LDPC Codes: High-Rate and Low-Complexity Encoder for Data Storage Devices. GLOBECOM 2010: 1-6 - [c5]Hajime Matsui:
Unified system of encoding and decoding erasures and errors for algebraic geometry codes. ISITA 2010: 1001-1006
2000 – 2009
- 2009
- [j3]Hajime Matsui:
A Simple Proof of Horiguchi's Error-Value Formula in Decoding of Alternant Codes and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 2146-2150 (2009) - [j2]Vo Tam Van, Hajime Matsui, Seiichi Mita:
Computation of Grobner Basis for Systematic Encoding of Generalized Quasi-Cyclic Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(9): 2345-2359 (2009) - [c4]Vo Tam Van, Hajime Matsui, Seiichi Mita:
Low Complexity Encoder for Generalized Quasi-Cyclic Codes Coming from Finite Geometries. ICC 2009: 1-6 - 2008
- [i3]Vo Tam Van, Hajime Matsui, Seiichi Mita:
Computation of Grobner basis for systematic encoding of generalized quasi-cyclic codes. CoRR abs/0811.4033 (2008) - 2007
- [c3]Hajime Matsui, Seiichi Mita:
Encoding via Gr??bner bases and discrete Fourier transforms for several types of algebraic codes. ISIT 2007: 2656-2660 - [i2]Hajime Matsui, Seiichi Mita:
Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes. CoRR abs/0705.0286 (2007) - [i1]Hajime Matsui, Seiichi Mita:
Encoding via Gröbner bases and discrete Fourier transforms for several types of algebraic codes. CoRR abs/cs/0703104 (2007) - 2006
- [c2]Hajime Matsui, Seiichi Mita:
Inverse-Free Implementation of Berlekamp-Massey-Sakata Algorithm for Decoding Codes on Algebraic Curves. ISIT 2006: 2250-2254 - 2005
- [j1]Hajime Matsui, Shojiro Sakata, Masazumi Kurihara, Seiichi Mita:
Systolic array architecture implementing Berlekamp-Massey-Sakata algorithm for decoding codes on a class of algebraic curves. IEEE Trans. Inf. Theory 51(11): 3856-3871 (2005) - [c1]Hajime Matsui, Henry Johan, Tomoyuki Nishita:
Creating colored pencil style images by drawing strokes based on boundaries of regions. Computer Graphics International 2005: 148-155
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:29 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:
