Koji Momihara
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Koji Momihara has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Anita Pasotti
DICATAM ‐ Sez. Matematica Università degli Studi di Brescia Brescia Italy
1 shared publication - Junya Satoh
Nagoya Univ, Grad Sch Informat Sci, Chikusa Ku, Furo Cho, Nagoya, Aichi 4648601, Japan
1 shared publication - Marco Buratti
Università di Perugia
1 shared publication - Masakazu Jimbo
Nagoya University
1 shared publication - Meinard Müller
International Audio Laboratories Erlangen, Erlangen, Germany
1 shared publication - Mieko Yamada
Kanazawa University
1 shared publication
Latest Publications
- 27 March 2010
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 58 (1) , 89-109
New results on optimal (v, 4, 2, 1) optical orthogonal codes
- 27 March 2010
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 58 (1) , 89-109
New results on optimal (v, 4, 2, 1) optical orthogonal codes
- 1 August 2009
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 15 (4) , 415-427
On cyclic -support difference families- 1 August 2009
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 15 (4) , 415-427
On cyclic -support difference families- 28 June 2009
- Published by Elsevier in Discrete Mathematics
- Vol. 309 (12) , 3954-3961
Perfect difference systems of sets and Jacobi sums
- 28 June 2009
- Published by Elsevier in Discrete Mathematics
- Vol. 309 (12) , 3954-3961
Perfect difference systems of sets and Jacobi sums
- 31 December 2008
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 51 (3) , 253-273
Strong difference families, difference covers, and their applications for relative difference families
- 31 December 2008
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 51 (3) , 253-273
Strong difference families, difference covers, and their applications for relative difference families
- 11 October 2007
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 45 (3) , 379-390
Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- 11 October 2007
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 45 (3) , 379-390
Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 336-340
Bounds and Constructions for Optimal Constant Weight Conflict-Avoiding Codes
A conflict-avoiding code (CAC) C of length n with weight k is a family of binary sequences of length n and weight k satisfying Sigma0 les t les n-1 xit xj, t+s les lambda for any distinct codewords xj = (xi0,xi1,hellip,xi, n-1) and xj = (xj0, xj1,hellip, xj, n-1) in C and for any integer s, where the subscripts are taken modulo n. A CAC with maximal code size for given n and k is said to be optimal. A CAC has been studied for sending messages correctly through a multiple-access channel. The use of an optimal CAC enables the largest possible number of asynchronous users to transmit information efficiently and reliably. In this paper, the case lambda = 1 is treated, and various direct and recursive constructions of optimal CACs for weight k = 4 and 5 are obtained by providing constructions of CACs for general weight k. In particular, the maximum code size of CACs satisfying certain sufficient conditions is determined through number theoretical and combinatorial approaches.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 336-340
Bounds and Constructions for Optimal Constant Weight Conflict-Avoiding Codes
A conflict-avoiding code (CAC) C of length n with weight k is a family of binary sequences of length n and weight k satisfying Sigma0 les t les n-1 xit xj, t+s les lambda for any distinct codewords xj = (xi0,xi1,hellip,xi, n-1) and xj = (xj0, xj1,hellip, xj, n-1) in C and for any integer s, where the subscripts are taken modulo n. A CAC with maximal code size for given n and k is said to be optimal. A CAC has been studied for sending messages correctly through a multiple-access channel. The use of an optimal CAC enables the largest possible number of asynchronous users to transmit information efficiently and reliably. In this paper, the case lambda = 1 is treated, and various direct and recursive constructions of optimal CACs for weight k = 4 and 5 are obtained by providing constructions of CACs for general weight k. In particular, the maximum code size of CACs satisfying certain sufficient conditions is determined through number theoretical and combinatorial approaches.