#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1997

2018

- This year (5)
- Last 5 years (35)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu
- IEEE Transactions on Information Theory
- 2015

By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C1 of length n over a field extension Fqm and its subcode C2 âŠ† C1. One isâ€¦ (More)

- Ryutaroh Matsumoto
- IEICE Transactions
- 2007

We give an algorithm for constructing linear network error-correcting codes that achieve the Singleton bound for network error-correcting codes. The proposed algorithm is based on the algorithm byâ€¦ (More)

- Masahito Hayashi, Ryutaroh Matsumoto
- 2010 IEEE International Symposium on Informationâ€¦
- 2010

From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mildâ€¦ (More)

- Ryutaroh Matsumoto
- IEEE Trans. Information Theory
- 2002

The stabilizer code is the most general algebraic construction of quantum error-correcting codes proposed so far. A stabilizer code can be constructed from a self-orthogonal subspace of a symplecticâ€¦ (More)

- Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
- ISIT
- 2009

- Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uyematsu
- ArXiv
- 2004

We propose use of QR factorization with sort and Dijkstraâ€™s algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signals on the multi-antennaâ€¦ (More)

- Kenta Kasai, Takayuki Tsujimoto, Ryutaroh Matsumoto, Kohichi Sakaniwa
- 2010 Data Compression Conference
- 2010

Rate-compatible asymmetric Slepian-Wolf coding with non-binary LDPC codes of moderate code length is presented.The proposed encoder and decoder use only one single mother code.With the proposedâ€¦ (More)

which is called the L-construction, was not explicitly mentioned by Goppa but known to researchers including Goppa and Manin [17, p.386]. CL(D,mQ) seems to be first explicitly defined in [8], [15].â€¦ (More)

- Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto
- IEICE Transactions
- 2012

This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using the relative dimension/length profile (RDLP) and the relative generalized Hamming weight (RGHW). Weâ€¦ (More)

- Ryutaroh Matsumoto
- J. Symb. Comput.
- 2001

We propose a method for computing the radical of an arbitrary ideal in the polynomial ring in n variables over a perfect field of characteristic p > 0. In our method Buchbergerâ€™s algorithm isâ€¦ (More)