Hiroyoshi Morita
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hiroyoshi Morita has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
Akiko Manada
Dept. of Information Science, Shonan Institute of Technology
2 shared publications- Akiko Manada
Department of Electrical, Electronics and Information Engineering, Nagaoka University of Technology
2 shared publications Takahiro Ota
School of Network and Information, Senshu University
2 shared publications- Takahiro Ota
Dept. of Computer & Systems Engineering Nagano Prefectural Institute of Technology 813-8 386-1211 Shimonogo Ueda Nagano JAPAN
2 shared publications Adel Ghazel
1 shared publication- Adrianus Johannes Han Vinck
Institute of Digital Signal Processing, University of Duisburg-Essen, 47057 Duisburg, Germany
1 shared publication
Latest Publications
- 1 April 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E109.A (4) , 784-796
The Capacities of Periodic-Finite-Type Shifts from the Perspective of the Forbidden-Word Length
A Periodic-Finite-Type shift (PFT) is a set of bi-infinite sequences that prohibit the appearance of forbidden words in a periodic manner. More precisely, a PFT X {T, F} is a set of bi-infinite sequences x characterized by a period T ∈ N and a family F = (F (0) , F (1) , • • • , F (T-1)) of indexed finite sets of forbidden words F (0) , F (1) , • • • , F (T-1) , so that the r-shifted sequence σ r (x) of x does not contain words in F (i mod T) at position i ∈ Z. The study on PFTs is strongly related to the study on constrained systems with unconstrained positions, which have the property as both error-correcting codes and constrained codes. The capacity of a PFT is an important value that gives us the maximum coding rate when a random sequence is encoded to a sequence in the PFT. In this paper, we derive the capacity of a PFT in two ways, using the fact that an arbitrary family F is transformed into a family F = (F (0) , ∅ • • • , ∅), where each forbidden word in F (0) has the same length k, so that X {T, F} = X {T,F}. When k ≤ T , the first proof derives the capacity directly from the definition, and the other proof does from block partitioning of the adjacency matrix of a certain graph representing X {T,F}. We also present a partial result on the capacity when k > T .
- 1 April 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E109.A (4) , 784-796
The Capacities of Periodic-Finite-Type Shifts from the Perspective of the Forbidden-Word Length
A Periodic-Finite-Type shift (PFT) is a set of bi-infinite sequences that prohibit the appearance of forbidden words in a periodic manner. More precisely, a PFT X {T, F} is a set of bi-infinite sequences x characterized by a period T ∈ N and a family F = (F (0) , F (1) , • • • , F (T-1)) of indexed finite sets of forbidden words F (0) , F (1) , • • • , F (T-1) , so that the r-shifted sequence σ r (x) of x does not contain words in F (i mod T) at position i ∈ Z. The study on PFTs is strongly related to the study on constrained systems with unconstrained positions, which have the property as both error-correcting codes and constrained codes. The capacity of a PFT is an important value that gives us the maximum coding rate when a random sequence is encoded to a sequence in the PFT. In this paper, we derive the capacity of a PFT in two ways, using the fact that an arbitrary family F is transformed into a family F = (F (0) , ∅ • • • , ∅), where each forbidden word in F (0) has the same length k, so that X {T, F} = X {T,F}. When k ≤ T , the first proof derives the capacity directly from the definition, and the other proof does from block partitioning of the adjacency matrix of a certain graph representing X {T,F}. We also present a partial result on the capacity when k > T .
- Open Access
- 28 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Error-Correcting Codes in the Two-Dimensional Lee Metric on Square and Hexagonal Signal Constellations
We construct linear codes over odd prime fields for correcting two-dimensional Lee-metric errors on the square and hexagonal signal constellations. They are obtained by puncturing and enlarging either Reed-Solomon codes or Bose-Chaudhuri-Hocquenghem codes. We introduce two-dimensional Lee weight on the square and hexagonal constellations in a similar way as the method presented by the first author in 2019 International Symposium on Information Theory, and propose an effective method for correcting two-dimensional Lee-metric errors of weight t>=1. The concept of value-locator of an error, which was introduced implicitly by K. Nakamura in 1979 and inherited to the above conference paper, is a key for decoding error-correcting Lee-metric codes. Our decoding method is based on the Buchberger algorithm for finding Groebner bases of ideals in the multivariate polynomial ring. The results of simulations show that our codes are more powerful for correcting two-dimensional Lee-metric errors in the two-dimensional signal constellations than the conventional codes for correcting Hamming-metric errors and one-dimensional Lee-metric errors, and the decoding method works well for correcting two-dimensional Lee-metric errors of small weight t.
- 28 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessError-Correcting Codes in the Two-Dimensional Lee Metric on Square and Hexagonal Signal Constellations
We construct linear codes over odd prime fields for correcting two-dimensional Lee-metric errors on the square and hexagonal signal constellations. They are obtained by puncturing and enlarging either Reed-Solomon codes or Bose-Chaudhuri-Hocquenghem codes. We introduce two-dimensional Lee weight on the square and hexagonal constellations in a similar way as the method presented by the first author in 2019 International Symposium on Information Theory, and propose an effective method for correcting two-dimensional Lee-metric errors of weight t>=1. The concept of value-locator of an error, which was introduced implicitly by K. Nakamura in 1979 and inherited to the above conference paper, is a key for decoding error-correcting Lee-metric codes. Our decoding method is based on the Buchberger algorithm for finding Groebner bases of ideals in the multivariate polynomial ring. The results of simulations show that our codes are more powerful for correcting two-dimensional Lee-metric errors in the two-dimensional signal constellations than the conventional codes for correcting Hamming-metric errors and one-dimensional Lee-metric errors, and the decoding method works well for correcting two-dimensional Lee-metric errors of small weight t.
- 1 June 2020
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E103.A (6) , 829-835
Compression by Substring Enumeration Using Sorted Contingency Tables
This paper proposes two variants of improved Compression by Substring Enumeration (CSE) with a finite alphabet. In previous studies on CSE, an encoder utilizes inequalities which evaluate the number of occurrences of a substring or a minimal forbidden word (MFW) to be encoded. The inequalities are derived from a contingency table including the number of occurrences of a substring or an MFW. Moreover, codeword length of a substring and an MFW grows with the difference between the upper and lower bounds deduced from the inequalities, however the lower bound is not tight. Therefore, we derive a new tight lower bound based on the contingency table and consequently propose a new CSE algorithm using the new inequality. We also propose a new encoding order of substrings and MFWs based on a sorted contingency table such that both its row and column marginal total are sorted in descending order instead of a lexicographical order used in previous studies. We then propose a new CSE algorithm which is the first proposed CSE algorithm using the new encoding order. Experimental results show that compression ratios of all files of the Calgary corpus in the proposed algorithms are better than those of a previous study on CSE with a finite alphabet. Moreover, compression ratios under the second proposed CSE get better than or equal to that under a well-known compressor for 11 files amongst 14 files in the corpus.
- 1 June 2020
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E103.A (6) , 829-835
Compression by Substring Enumeration Using Sorted Contingency Tables
This paper proposes two variants of improved Compression by Substring Enumeration (CSE) with a finite alphabet. In previous studies on CSE, an encoder utilizes inequalities which evaluate the number of occurrences of a substring or a minimal forbidden word (MFW) to be encoded. The inequalities are derived from a contingency table including the number of occurrences of a substring or an MFW. Moreover, codeword length of a substring and an MFW grows with the difference between the upper and lower bounds deduced from the inequalities, however the lower bound is not tight. Therefore, we derive a new tight lower bound based on the contingency table and consequently propose a new CSE algorithm using the new inequality. We also propose a new encoding order of substrings and MFWs based on a sorted contingency table such that both its row and column marginal total are sorted in descending order instead of a lexicographical order used in previous studies. We then propose a new CSE algorithm which is the first proposed CSE algorithm using the new encoding order. Experimental results show that compression ratios of all files of the Calgary corpus in the proposed algorithms are better than those of a previous study on CSE with a finite alphabet. Moreover, compression ratios under the second proposed CSE get better than or equal to that under a well-known compressor for 11 files amongst 14 files in the corpus.
- 1 February 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E102.A (2) , 440-449
A Universal Two-Dimensional Source Coding by Means of Subblock Enumeration
The technique of lossless compression via substring enumeration (CSE) is a kind of enumerative code and uses a probabilistic model built from the circular string of an input source for encoding a one-dimensional (1D) source. CSE is applicable to two-dimensional (2D) sources, such as images, by dealing with a line of pixels of a 2D source as a symbol of an extended alphabet. At the initial step of CSE encoding process, we need to output the number of occurrences of all symbols of the extended alphabet, so that the time complexity increases exponentially when the size of source becomes large. To reduce computational time, we can rearrange pixels of a 2D source into a 1D source string along a space-filling curve like a Hilbert curve. However, information on adjacent cells in a 2D source may be lost in the conversion. To reduce the time complexity and compress a 2D source without converting to a 1D source, we propose a new CSE which can encode a 2D source in a block-by-block fashion instead of in a line-by-line fashion. The proposed algorithm uses the flat torus of an input 2D source as a probabilistic model instead of the circular string of the source. Moreover, we prove the asymptotic optimality of the proposed algorithm for 2D general sources.
- 1 February 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E102.A (2) , 440-449
A Universal Two-Dimensional Source Coding by Means of Subblock Enumeration
The technique of lossless compression via substring enumeration (CSE) is a kind of enumerative code and uses a probabilistic model built from the circular string of an input source for encoding a one-dimensional (1D) source. CSE is applicable to two-dimensional (2D) sources, such as images, by dealing with a line of pixels of a 2D source as a symbol of an extended alphabet. At the initial step of CSE encoding process, we need to output the number of occurrences of all symbols of the extended alphabet, so that the time complexity increases exponentially when the size of source becomes large. To reduce computational time, we can rearrange pixels of a 2D source into a 1D source string along a space-filling curve like a Hilbert curve. However, information on adjacent cells in a 2D source may be lost in the conversion. To reduce the time complexity and compress a 2D source without converting to a 1D source, we propose a new CSE which can encode a 2D source in a block-by-block fashion instead of in a line-by-line fashion. The proposed algorithm uses the flat torus of an input 2D source as a probabilistic model instead of the circular string of the source. Moreover, we prove the asymptotic optimality of the proposed algorithm for 2D general sources.
- Open Access
- 12 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (3) , 326-335
Graph Theoretical Analysis on Distributed Line Graphs for Peer-to-Peer Networks
Distributed line graphs were introduced by Zhang and Liu as an overlay for Peer-to-Peer networks. Distributed line graphs have some useful properties as a network topology, such as out-regular and small diameter, where the former implies that each user possesses a constant size of routing table and the latter means that a reasonably small number of hops is necessary to reach a target user. In this paper, we newly introduce distributed line sharp graphs, as an extension of distributed line graphs, so as to further expand the possibility of finding better network topologies and theoretically analyze their properties. The analysis on the distributed line sharp graphs is based on the analysis on distributed line graphs presented by Zhang and Liu. In particular, we further examine the diameter and the in-degree of a vertex, and improve the previous results together with detailed proofs. We also show that the diameter of a certain distributed line sharp graph is equal to the diameter of its corresponding distributed line graph.
- 12 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (3) , 326-335
Open AccessGraph Theoretical Analysis on Distributed Line Graphs for Peer-to-Peer Networks
Distributed line graphs were introduced by Zhang and Liu as an overlay for Peer-to-Peer networks. Distributed line graphs have some useful properties as a network topology, such as out-regular and small diameter, where the former implies that each user possesses a constant size of routing table and the latter means that a reasonably small number of hops is necessary to reach a target user. In this paper, we newly introduce distributed line sharp graphs, as an extension of distributed line graphs, so as to further expand the possibility of finding better network topologies and theoretically analyze their properties. The analysis on the distributed line sharp graphs is based on the analysis on distributed line graphs presented by Zhang and Liu. In particular, we further examine the diameter and the in-degree of a vertex, and improve the previous results together with detailed proofs. We also show that the diameter of a certain distributed line sharp graph is equal to the diameter of its corresponding distributed line graph.
- Open Access
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications
The 10th Asia-Europe workshop in "Concepts in Information Theory and Communications" AEW10 was held in Boppard, Germany on June 21-23, 2017. It is based on a longstanding cooperation between Asian and European scientists. The first workshop was held in Eindhoven, the Netherlands in 1989. The idea of the workshop is threefold: 1) to improve the communication between the scientist in the different parts of the world; 2) to exchange knowledge and ideas; and 3) to pay a tribute to a well respected and special scientist.
Open AccessProceedings of Workshop AEW10: Concepts in Information Theory and Communications
The 10th Asia-Europe workshop in "Concepts in Information Theory and Communications" AEW10 was held in Boppard, Germany on June 21-23, 2017. It is based on a longstanding cooperation between Asian and European scientists. The first workshop was held in Eindhoven, the Netherlands in 1989. The idea of the workshop is threefold: 1) to improve the communication between the scientist in the different parts of the world; 2) to exchange knowledge and ideas; and 3) to pay a tribute to a well respected and special scientist.
- Open Access
Two-Dimensional Source Coding by Means of Subblock Enumeration
A technique of lossless compression via substring enumeration (CSE) attains compression ratios as well as popular lossless compressors for one-dimensional (1D) sources. The CSE utilizes a probabilistic model built from the circular string of an input source for encoding the source.The CSE is applicable to two-dimensional (2D) sources such as images by dealing with a line of pixels of 2D source as a symbol of an extended alphabet. At the initial step of the CSE encoding process, we need to output the number of occurrences of all symbols of the extended alphabet, so that the time complexity increase exponentially when the size of source becomes large. To reduce the time complexity, we propose a new CSE which can encode a 2D source in block-by-block instead of line-by-line. The proposed CSE utilizes the flat torus of an input 2D source as a probabilistic model for encoding the source instead of the circular string of the source. Moreover, we analyze the limit of the average codeword length of the proposed CSE for general sources.
Open AccessTwo-Dimensional Source Coding by Means of Subblock Enumeration
A technique of lossless compression via substring enumeration (CSE) attains compression ratios as well as popular lossless compressors for one-dimensional (1D) sources. The CSE utilizes a probabilistic model built from the circular string of an input source for encoding the source.The CSE is applicable to two-dimensional (2D) sources such as images by dealing with a line of pixels of 2D source as a symbol of an extended alphabet. At the initial step of the CSE encoding process, we need to output the number of occurrences of all symbols of the extended alphabet, so that the time complexity increase exponentially when the size of source becomes large. To reduce the time complexity, we propose a new CSE which can encode a 2D source in block-by-block instead of line-by-line. The proposed CSE utilizes the flat torus of an input 2D source as a probabilistic model for encoding the source instead of the circular string of the source. Moreover, we analyze the limit of the average codeword length of the proposed CSE for general sources.