Language：Japanese   Publisher：Intermag Asia 2005 Digests of the IEEE International Magnetics Conference  

Scopus

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Research

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Research

Language：Japanese   Publisher：東京 : 映像情報メディア学会  

CiNii Research

Language：Japanese   Publisher：東京 : 電子情報通信学会基礎・境界ソサイエティ  

CiNii Research

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Research

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Research

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Research

Language：Japanese   Publisher：東京 : 電子情報通信学会  

CiNii Research

Language：Japanese   Publisher：東京 : 電子情報通信学会  

CiNii Research

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.3934/amc.2024030

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

Regarding quasi-cyclic codes as certain polynomial matrices, we show that all reversible quasi-cyclic codes are decomposed into reversible linear codes of shorter lengths corresponding to the coprime divisors of the polynomials with the form of one minus x to the power of m. This decomposition brings us an efficient method to construct reversible quasi-cyclic codes. We also investigate the reversibility and the self-duality of the linear codes corresponding to the coprime divisors of the polynomials. Specializing to the cases where the number of cyclic sections is not more than two, we give necessary and sufficient conditions for the divisors of the polynomials for which the self-dual codes are reversible and the reversible codes of half-length-dimension are self-dual. Our theorems are utilized to search reversible self-dual quasi-cyclic codes with two cyclic sections over binary and quaternary fields of lengths up to seventy and thirty-six, respectively, together with the maximums of their minimum weights.

DOI： 10.1016/j.ffa.2023.102204

DOI： 10.1016/j.ffa.2023.102204

Scopus

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1109/ACCESS.2023.3253774

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：Institute of Electrical and Electronics Engineers (IEEE)  

A code over Gaussian or Eisenstein integer residue ring is an additive group of vectors with entries in this integer residue ring which is closed under the action of constant multiplication by the Gaussian or Eisenstein integers. In this paper, we define the dual codes for the codes over the Gaussian and Eisenstein integer residue rings, and consider the construction of the self-dual codes. Because, in the Gaussian and Eisenstein integer rings, the uniqueness of the prime element decomposition holds in the same way as the one-variable polynomial rings over finite fields and the rational integer ring, we provide an efficient construction method for self-dual code generator matrices using that of moduli. As numerical examples, for Gaussian and Eisenstein integer rings, we enumerate and construct the self-dual codes for the actual moduli when the size of the generator matrices is two.

DOI： 10.1109/access.2023.3253774

Scopus

Authorship：Last author   Language：English   Publishing type：Research paper (international conference proceedings)  

The codes over rational integer residue rings are called integer codes. In this paper, we give a necessary and sufficient condition concerning the generator matrices when integer codes are to be reversible and show that their reversibility is preserved from the decomposition of integer codes by Chinese remainder theorem. This brings an efficient method for constructing of reversible integer codes with large moduli. Using this method, we enumerate reversible self-dual integer codes of length 3,4 with various moduli. Further, we claim that reversible and self-dual integer codes produce reversible and unimodular lattices, respectively. As a result, we see that the extended binary Hamming code produces the even unimodular lattice of rank 8 and in particular this lattice is reversible, and furthermore the lattice induces an extremal Type II integer code of length 8 with modulus 4.

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>It is known that quasi-cyclic (QC) codes over the finite field 𝔽<i>_q</i> correspond to certain 𝔽<i>_q</i>[<i>x</i>]-modules. A QC code <i>C</i> is specified by a generator polynomial matrix <i>G</i> whose rows generate <i>C</i> as an 𝔽<i>_q</i>[<i>x</i>]-module. The reversed code of <i>C</i>, denoted by <i>R</i>, is the code obtained by reversing all codewords of <i>C</i> while the dual code of <i>C</i> is denoted by <i>C</i>^⊥. We call <i>C</i> reversible, self-orthogonal, and self-dual if <i>R</i> = <i>C</i>, <i>C</i>^⊥ ⊇ <i>C</i>, and <i>C</i>^⊥ = <i>C</i>, respectively. In this study, for a given <i>C</i>, we find an explicit formula for a generator polynomial matrix of <i>R</i>. A necessary and sufficient condition for <i>C</i> to be reversible is derived from this formula. In addition, we reveal the relations among <i>C</i>, <i>R</i>, and <i>C</i>^⊥. Specifically, we give conditions on <i>G</i> corresponding to <i>C</i>^⊥ ⊇ <i>R</i>, <i>C</i>^⊥ ⊆ <i>R</i>, and <i>C</i> = <i>R</i> = <i>C</i>^⊥. As an application, we employ these theoretical results to the construction of QC codes with best parameters. Computer search is used to show that there exist various binary reversible self-orthogonal QC codes that achieve the upper bounds on the minimum distance of linear codes.</p>

DOI： 10.1587/transfun.2021tap0010

Scopus

CiNii Research

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>A construction method of self-orthogonal and self-dual quasi-cyclic codes is shown which relies on factorization of modulus polynomials for cyclicity in this study. The smaller-size generator polynomial matrices are used instead of the generator matrices as linear codes. An algorithm based on Chinese remainder theorem finds the generator polynomial matrix on the original modulus from the ones constructed on each factor. This method enables us to efficiently construct and search these codes when factoring modulus polynomials into reciprocal polynomials.</p>

DOI： 10.1587/transfun.2021eal2021

CiNii Research

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>In this paper, we consider the reversibility problem in the class of quasi-cyclic (QC) codes <i>Q</i> over <i>F_q</i> of length <i>nℓ</i> and index <i>ℓ</i> generated by unfolding cyclic codes <i>C</i> over <i>F_qℓ</i> of length <i>n</i>. We prove a necessary and sufficient condition on <i>C</i> that ensures the reversibility of <i>Q</i>. Using computer search, we offer some good reversible QC codes that are generated by unfolding cyclic codes.</p>

DOI： 10.1587/comex.2020xbl0117

CiNii Research

Authorship：Last author   Language：English   Publishing type：Research paper (international conference proceedings)  

Authorship：Last author   Language：English   Publishing type：Research paper (international conference proceedings)  

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：Institute of Electrical and Electronics Engineers (IEEE)  

DOI： 10.1109/access.2020.3013958

Scopus

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>In DNA data storage and computation, DNA strands are required to meet certain combinatorial constraints. This paper shows how some of these constraints can be achieved simultaneously. First, we use the algebraic structure of irreducible cyclic codes over finite fields to generate cyclic DNA codes that satisfy reverse and complement properties. We show how such DNA codes can meet constant guanine-cytosine content constraint by MacWilliams-Seery algorithm. Second, we consider fulfilling the run-length constraint in parallel with the above constraints, which allows a maximum predetermined number of consecutive duplicates of the same symbol in each DNA strand. Since irreducible cyclic codes can be represented in terms of the trace function over finite field extensions, the linearity of the trace function is used to fulfill a predefined run-length constraint. Thus, we provide an algorithm for constructing cyclic DNA codes with the above properties including run-length constraint. We show numerical examples to demonstrate our algorithms generating such a set of DNA strands with all the prescribed constraints.</p>

DOI： 10.1587/transfun.2019eap1053

Scopus

CiNii Research

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：Institute of Electrical and Electronics Engineers (IEEE)  

DOI： 10.1109/access.2019.2960569

Scopus

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>The natural gradient descent is an optimization method for real-valued neural networks that was proposed from the viewpoint of information geometry. Here, we present an extension of the natural gradient descent to complex-valued neural networks. Our idea is to use the Hermitian extension of the Fisher information matrix. Moreover, we generalize the projected natural gradient (PRONG), which is a fast natural gradient descent algorithm, to complex-valued neural networks. We also consider the advantage of complex-valued neural networks over real-valued neural networks. A useful property of complex numbers in the complex plane is that the rotation is simply expressed by the multiplication. By focusing on this property, we construct the output function of complex-valued neural networks, which is invariant even if the input is changed to its rotated value. Then, our complex-valued neural network can learn rotated data without data augmentation. Finally, through simulation of online character recognition, we demonstrate the effectiveness of the proposed approach.</p>

DOI： 10.1587/transfun.e102.a.1988

Scopus

CiNii Research

Authorship：Lead author   Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>A multiple-valued logic function is a multivariable function whose input and output are in a finite field and is applied to the construction of switching circuits. A multiple-valued logic polynomial is a multivariable polynomial with coefficients in a finite field. It is known that multiple-valued logic functions are equal to multiple-valued logic polynomials. Because error-correcting codes and multiple-valued logic polynomials have a dual relationship with each other, the research results of error-correcting codes can be employed to multiple-valued logic polynomials. In this study, a generalized “convolution theorem” is described, which is a relationship between multiple-valued logic functions and polynomials through discrete Fourier transforms, and it is generalized to a subset of finite fields called a semigroup. Next, this theorem is applied to speed up the multiplication of multiple-valued logic polynomials. Finally, to show a relationship between multiple-valued logic functions and error-correcting codes, a method of explicitly obtaining dual codes is given.</p>

DOI： 10.1587/essfr.12.3_182

CiNii Research

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>Integer codes are defined by error-correcting codes over integers modulo a fixed positive integer. In this paper, we show that the construction of integer codes can be reduced into the cases of prime-power moduli. We can efficiently search integer codes with small prime-power moduli and can construct target integer codes with a large composite-number modulus. Moreover, we also show that this prime-factorization reduction is useful for the construction of self-orthogonal and self-dual integer codes, i.e., these properties in the prime-power moduli are preserved in the composite-number modulus. Numerical examples of integer codes and generator matrices demonstrate these facts and processes.</p>

DOI： 10.1587/transfun.e101.a.1952

Scopus

CiNii Research

Authorship：Last author   Language：English   Publishing type：Research paper (international conference proceedings)  

Authorship：Last author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.3390/math5040082

Web of Science

Scopus

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

In this paper, a convolution theorem which is analogous to the theorem for Fourier transform is shown among a certain type of polynomials. We establish a fast method of the multiplication in a special class of quotient rings of multivariate polynomials over <i>q</i>-element finite field GF(<i>q</i>). The polynomial which we treat is one of expressing forms of the multiple-valued logic function from the product of the semigroups in GF(<i>q</i>) to GF(<i>q</i>). Our results can be applied to the speedup of both software and hardware concerning multiple-valued Boolean logic.

DOI： 10.1587/transfun.e99.a.1025

Web of Science

Scopus

CiNii Research

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

A projective Reed-Muller (PRM) code, obtained by modifying a Reed-Muller code with respect to a projective space, is a doubly extended Reed-Solomon code when the dimension of the related projective space is equal to 1. The minimum distance and the dual code of a PRM code are known, and some decoding examples have been presented for low-dimensional projective spaces. In this study, we construct a decoding algorithm for all PRM codes by dividing a projective space into a union of affine spaces. In addition, we determine the computational complexity and the number of correctable errors of our algorithm. Finally, we compare the codeword error rate of our algorithm with that of the minimum distance decoding.

DOI： 10.1587/transfun.e99.a.733

Web of Science

Scopus

CiNii Research

Authorship：Lead author   Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.ffa.2015.02.003

Web of Science

Scopus

Authorship：Last author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s10623-013-9883-7

Web of Science

Scopus

Other Link： http://link.springer.com/article/10.1007/s10623-013-9883-7/fulltext.html

Authorship：Lead author   Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

The objective of the study is to easily and briefly describe algebraic error-correcting codes and their techniques. The necessary knowledge to read the paper is assumed mainly within elementary mathematics except for a part and we discuss them along with various examples. This is because the easiest method of understanding the algebraic coding theory is considered to be the calculation of their numerical examples. We start our description of the theory of linear feedback shift registers (LFSR) which are regarded to be a class of recurrence relations. Then, we treat Reed-Solomon codes, discrete Fourier transforms, and the basics of Gr¨obner bases in this paper.

DOI： 10.1587/essfr.8.151

CiNii Research

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/aucc.2014.7358643

Scopus

Authorship：Last author   Language：English   Publishing type：Research paper (international conference proceedings)  

Web of Science

Authorship：Lead author   Language：English   Publishing type：Research paper (international conference proceedings)  

Web of Science

Authorship：Last author   Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1109/tit.2014.2311042

Web of Science

Scopus

Authorship：Lead author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author   Language：English   Publishing type：Research paper (international conference proceedings)  

Web of Science

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/glocom.2010.5683369

Web of Science

Scopus

Authorship：Lead author   Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/isita.2010.5649516

Scopus

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1109/TMAG.2009.2023626

Web of Science

Scopus

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/itw.2009.5351273

Web of Science

Scopus

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/icc.2009.5199152

Web of Science

Scopus

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

A direct short proof of Horiguchi's formula for error values in alternant codes is provided. Horiguchi's formula employs only output polynomials of Berlekamp-Massey algorithm, which has less computational complexity than extended Euclidean algorithm for decoding alternant codes. As an application of our proof, we provide an explicit formula for the generator and parity check matrices of alternant codes and their singly- and doubly-extended codes.

DOI： 10.1587/transfun.e92.a.2146

Web of Science

Scopus

CiNii Research

Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low density parity check (LDPC) codes, and Hermitian codes. Although it is known that the systematic encoding of GQC codes is equivalent to the division algorithm in the theory of Gröbner basis of modules, there has been no algorithm that computes Gröbner basis for all types of GQC codes. In this paper, we propose two algorithms to compute Gröbner basis for GQC codes from their parity check matrices; we call them echelon canonical form algorithm and transpose algorithm. Both algorithms require sufficiently small number of finite-field operations with the order of the third power of code-length. Each algorithm has its own characteristic. The first algorithm is composed of elementary methods and is appropriate for low-rate codes. The second algorithm is based on a novel formula and has smaller computational complexity than the first one for high-rate codes with the number of orbits (cyclic parts) less than half of the code length. Moreover, we show that a serial-in serial-out encoder architecture for FG LDPC codes is composed of linear feedback shift registers with the size of the linear order of code-length; to encode a binary codeword of length <i>n</i>, it takes less than 2<i>n</i> adder and 2<i>n</i> memory elements.

DOI： 10.1587/transfun.e92.a.2345

Web of Science

Scopus

CiNii Research

Authorship：Lead author   Language：English   Publishing type：Research paper (international conference proceedings)  

Web of Science

Authorship：Lead author   Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1109/TIT.2005.856950

Scopus

Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1109/TMAG.2005.854451

Scopus

Authorship：Lead author   Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author   Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author   Language：English   Publishing type：Research paper (international conference proceedings)  

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1109/TMAG.2003.821193

Scopus

Authorship：Lead author   Language：Japanese   Publishing type：Research paper (scientific journal)  

Authorship：Lead author   Language：English   Publishing type：Research paper (international conference proceedings)  

Authorship：Lead author   Language：Japanese   Publishing type：Research paper (scientific journal)  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s000130050463

Web of Science

Other Link： http://link.springer.com/article/10.1007/s000130050463/fulltext.html

Event date： 2023.8

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

電気・電子・情報関係学会東海支部連合大会，E6-1

Event date： 2023.3

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2022.11 - 2022.12

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2022.11 - 2022.12

Language：Japanese   Presentation type：Poster presentation  

Country：Japan  

Event date： 2022.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2022.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2022.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2022.8

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2022.8

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2022.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2022.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2021.12

Language：English   Presentation type：Oral presentation (general)  

Venue：Nishinomiya, Hyogo   Country：Japan  

Event date： 2021.12

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：Nishinomiya, Hyogo   Country：Japan  

Event date： 2021.12

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：Nishinomiya, Hyogo   Country：Japan  

Event date： 2021.12

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：Nishinomiya, Hyogo   Country：Japan  

Event date： 2021.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2021.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2021.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2021.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2020.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2020.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2020.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2020.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2020.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2020.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2019.11

Language：English   Presentation type：Oral presentation (general)  

Event date： 2019.11

Language：Japanese   Presentation type：Poster presentation  

Event date： 2019.11

Language：English   Presentation type：Oral presentation (general)  

Event date： 2019.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2019.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2019.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2018.12

Language：Japanese   Presentation type：Poster presentation  

Event date： 2018.10

Language：English   Presentation type：Poster presentation  

Venue：Singapore   Country：Singapore  

Event date： 2018.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2018.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2018.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2018.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2018.3

Language：Japanese   Presentation type：Oral presentation (invited, special)  

Event date： 2017.11 - 2017.12

Language：Japanese   Presentation type：Poster presentation  

Event date： 2017.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2017.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2016.10 - 2016.11

Language：English   Presentation type：Poster presentation  

Venue：Monterey, California   Country：United States  

Event date： 2016.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2015.11

Language：English   Presentation type：Oral presentation (general)  

Event date： 2015.11

Language：English   Presentation type：Oral presentation (general)  

Event date： 2015.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2015.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2015.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2015.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2015.9

Language：Japanese   Presentation type：Oral presentation (invited, special)  

Venue：石川県白山菖蒲亭   Country：Japan  

Event date： 2015.6

Language：English   Presentation type：Poster presentation  

Venue：Hong Kong   Country：Hong Kong  

Event date： 2015.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2014.12

Language：English   Presentation type：Oral presentation (general)  

Event date： 2014.12

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2014.12

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2014.12

Language：English   Presentation type：Oral presentation (general)  

Event date： 2014.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2014.6

Language：English   Presentation type：Oral presentation (general)  

Event date： 2014.4

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2014.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2014.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2013.11

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2013.11

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2013.3

Language：Japanese   Presentation type：Oral presentation (invited, special)  

Venue：九州大学マス・フォア・インダストリ研究所   Country：Japan  

Event date： 2012.12

Language：English   Presentation type：Oral presentation (general)  

Event date： 2012.12

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2012.4

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2011.11 - 2011.12

Language：English   Presentation type：Oral presentation (general)  

Event date： 2011.11 - 2011.12

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2011.11 - 2011.12

Language：English   Presentation type：Oral presentation (general)  

Event date： 2011.3

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：京都大学数理解析研究所   Country：Japan  

Event date： 2010.12

Language：English   Presentation type：Oral presentation (general)  

Venue：上智大学理工学部3–571B   Country：Japan  

Event date： 2010.11 - 2010.12

Language：English   Presentation type：Oral presentation (general)  

Event date： 2010.10

Language：English   Presentation type：Oral presentation (general)  

Venue：Ishigaki Island, Okinawa   Country：Japan  

Event date： 2010.4

Language：English   Presentation type：Oral presentation (general)  

Venue：豊田工業大学   Country：Japan  

Event date： 2010.4

Language：English   Presentation type：Oral presentation (general)  

Venue：豊田工業大学   Country：Japan  

Event date： 2009.12

Language：English   Presentation type：Oral presentation (general)  

Event date： 2009.3

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：名古屋工業大学   Country：Japan  

Event date： 2009.2

Language：English   Presentation type：Oral presentation (general)  

Venue：Nha Trang University   Country：Viet Nam  

Event date： 2008.10

Language：English   Presentation type：Oral presentation (general)  

Event date： 2008.5

Language：English   Presentation type：Oral presentation (general)  

Venue：Madrid   Country：Spain  

Event date： 2008.4

Language：English   Presentation type：Oral presentation (general)  

Event date： 2007.12

Language：Japanese   Presentation type：Oral presentation (invited, special)  

Event date： 2007.11

Language：English   Presentation type：Oral presentation (general)  

Event date： 2007.11

Language：English   Presentation type：Oral presentation (general)  

Event date： 2006.11 - 2006.12

Language：English   Presentation type：Oral presentation (general)  

Event date： 2006.11 - 2006.12

Language：English   Presentation type：Oral presentation (general)  

Event date： 2006.3

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2005.12

Language：English   Presentation type：Oral presentation (general)  

Venue：Chuo University   Country：Japan  

Event date： 2005.11

Language：English   Presentation type：Oral presentation (general)  

Event date： 2005.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2005.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2004.12

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2004.12

Language：Japanese   Presentation type：Oral presentation (invited, special)  

Event date： 2003.12

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2003.1

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2002.12

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2002.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2002.3

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2001.12

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2001.11

Language：English   Presentation type：Oral presentation (general)  

Venue：Chiang Mai   Country：Thailand  

Event date： 2001.9

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2001.5

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2001.5

Language：Japanese   Presentation type：Oral presentation (general)  

Event date： 2000.11

Language：Japanese   Presentation type：Oral presentation (general)  

テーマ名：誤り訂正符号の代数的構造の解明とその符号化・復号化システムへの応用

松井一，三田誠一，“BMSアルゴリズムを行うシストリックアレーの小型回路構成法,” 第26回情報理論とその応用シンポジウム予稿集，pp.457-460，12月17日（15-18日），2003．