Miwako Mishima

From MaRDI portal
(Redirected from Person:184678)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Optimal and efficient designs for fMRI experiments via two-level circulant almost orthogonal arrays
Journal of Statistical Planning and Inference
2021-05-07Paper
Partitions of the lines in \(\mathrm{PG}( 2 n - 1, s)\) into multifold spreads for \(s = 3, 4\)
Discrete Mathematics
2020-05-21Paper
Multifold factorizations of cyclic groups into subsets
Finite Fields and their Applications
2019-03-27Paper
Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
IEEE Transactions on Information Theory
2017-08-08Paper
Optimal Conflict-Avoiding Codes of Even Length and Weight 3
IEEE Transactions on Information Theory
2017-07-27Paper
Errata to “Optimal Conflict-Avoiding Codes of Even Length and Weight 3” [Nov 10 5747-5756]
IEEE Transactions on Information Theory
2017-07-12Paper
A new series of optimal tight conflict-avoiding codes of weight 3
Discrete Mathematics
2017-02-06Paper
Decomposition of complete bipartite graphs into cycles of distinct even lengths
Graphs and Combinatorics
2016-07-28Paper
Optimal equi-difference conflict-avoiding codes of weight four
Designs, Codes and Cryptography
2016-03-09Paper
Cycle decomposition of 2-fold complete tripartite graphs and generalized pseudo-characteristic2014-07-25Paper
Optimal equi-difference conflict-avoiding codes of odd length and weight three
Finite Fields and their Applications
2014-02-11Paper
A decomposition of the 2-design formed by the planes in \(AG(2n, 3)\)
Finite Fields and their Applications
2012-10-11Paper
scientific article; zbMATH DE number 5844208 (Why is no real title available?)2011-02-02Paper
Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
Designs, Codes and Cryptography
2009-10-14Paper
On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
IEEE Transactions on Information Theory
2008-12-21Paper
Optimal Frequency Hopping Sequences: A Combinatorial Approach
IEEE Transactions on Information Theory
2008-12-21Paper
The spectrum of 1-rotational Steiner triple systems over a dicyclic group
Discrete Mathematics
2008-05-13Paper
Constructions for rectangular designs2007-02-08Paper
Optimum multilevel orthogonal arrays for correlated errors
AKCE International Journal of Graphs and Combinatorics
2005-05-03Paper
Resolvable even‐cycle systems with a 1‐rotational automorphism
Journal of Combinatorial Designs
2004-02-12Paper
1‐rotationally resolvable 4‐cycle systems of 2Kv
Journal of Combinatorial Designs
2002-10-09Paper
Cyclic Mendelsohn triple systems with a cyclic resolution or a cyclic almost resolution
Journal of Statistical Planning and Inference
2002-09-18Paper
Constructions for a certain type of balanced bipartite block designs
Journal of Statistical Planning and Inference
2002-05-20Paper
Cyclically resolvable cyclic Steiner 2-systems S(2, 4, 52)
Journal of Statistical Planning and Inference
2002-01-28Paper
Recursive constructions for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs
Discrete Mathematics
2000-12-03Paper
On the optimality of orthogonal arrays in case of correlated errors
Journal of Statistical Planning and Inference
2000-09-14Paper
scientific article; zbMATH DE number 1355286 (Why is no real title available?)1999-10-31Paper
scientific article; zbMATH DE number 1161349 (Why is no real title available?)1999-08-19Paper
scientific article; zbMATH DE number 1229613 (Why is no real title available?)1999-03-17Paper
Cyclic resolvability of cyclic Steiner 2-designs1998-12-06Paper
A series of identities for the coefficients of inverse matrices on a Hamming scheme
Discrete Mathematics
1997-04-07Paper


Research outcomes over time


This page was built for person: Miwako Mishima