Hajime Matsui

Orcid: 0000-0003-4778-8045

According to our database1, Hajime Matsui authored at least 35 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem.
Finite Fields Their Appl., 2023

An Algorithm for Finding Self-Orthogonal and Self-Dual Codes Over Gaussian and Eisenstein Integer Residue Rings Via Chinese Remainder Theorem.
IEEE Access, 2023

2022
Linking Reversed and Dual Codes of Quasi-Cyclic Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Construction of reversible integer codes with large moduli via Chinese remainder theorem.
Proceedings of the International Symposium on Information Theory and Its Applications, 2022

2021
A Modulus Factorization Algorithm for Self-Orthogonal and Self-Dual Quasi-Cyclic Codes via Polynomial Matrices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

2020
Run-Length Constraint of Cyclic Reverse-Complement and Constant GC-Content DNA Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

On Reversibility and Self-Duality for Some Classes of Quasi-Cyclic Codes.
IEEE Access, 2020

Finding Self-Dual Quasi-Cyclic Codes with Large Minimum Weight via Polynomial Matrices.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Generator Polynomial Matrices of Reversed and Reversible Quasi-Cyclic Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

2019
Natural Gradient Descent of Complex-Valued Neural Networks Invariant under Rotations.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Quasi-Cyclic Codes Via Unfolded Cyclic Codes and Their Reversibility.
IEEE Access, 2019

2018
A Modulus Factorization Algorithm for Self-Orthogonal and Self-Dual Integer Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

On Constant GC-content Cyclic DNA Codes With Long Codewords.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2016
Decoding of Projective Reed-Muller Codes by Dividing a Projective Space into Affine Spaces.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

A Convolution Theorem for Multiple-Valued Logic Polynomials of a Semigroup Type and Their Fast Multiplication.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

2015
On generator and parity-check polynomial matrices of generalized quasi-cyclic codes.
Finite Fields Their Appl., 2015

On generator matrices and parity check matrices of generalized integer codes.
Des. Codes Cryptogr., 2015

2014
Lemma for Linear Feedback Shift Registers and DFTs Applied to Affine Variety Codes.
IEEE Trans. Inf. Theory, 2014

Fast Decoding of Projective Reed-Muller Codes by Dividing a Projective Space into Affine Spaces.
CoRR, 2014

A decoding algorithm for projective Reed-Muller codes of 2-dimensional projective space with DFT.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

On generator polynomial matrices of generalized pseudo-cyclic codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Computational complexity of robust schur stability analysis by the generalized stability feeler.
Proceedings of the 4th Australian Control Conference, AuCC 2014, Canberra, 2014

2012
Fast Erasure-and-Error Decoding and Systematic Encoding of a Class of Affine Variety Codes
CoRR, 2012

Decoding a class of affine variety codes with fast DFT.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

2010
Unified system of encoding and decoding erasures and errors for algebraic geometry codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

A Class of Generalized Quasi-Cyclic LDPC Codes: High-Rate and Low-Complexity Encoder for Data Storage Devices.
Proceedings of the Global Communications Conference, 2010

2009
Computation of Grobner Basis for Systematic Encoding of Generalized Quasi-Cyclic Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

A Simple Proof of Horiguchi's Error-Value Formula in Decoding of Alternant Codes and Its Applications.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Low Complexity Encoder for Generalized Quasi-Cyclic Codes Coming from Finite Geometries.
Proceedings of IEEE International Conference on Communications, 2009

2007
Encoding via Gröbner bases and discrete Fourier transforms for several types of algebraic codes
CoRR, 2007

Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes
CoRR, 2007

Encoding via Gr??bner bases and discrete Fourier transforms for several types of algebraic codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Inverse-Free Implementation of Berlekamp-Massey-Sakata Algorithm for Decoding Codes on Algebraic Curves.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Systolic array architecture implementing Berlekamp-Massey-Sakata algorithm for decoding codes on a class of algebraic curves.
IEEE Trans. Inf. Theory, 2005

Creating colored pencil style images by drawing strokes based on boundaries of regions.
Proceedings of the Computer Graphics International 2005, 2005


  Loading...