71 citations · 381 across the 24 of their papers we have counts for
24 papers
Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
Yuto Mizunuma, Yuichiro Fujiwara
Disjunct matrices, also known as cover-free families and superimposed codes, are combinatorial arrays widely used in group testing. Among their variants, those that satisfy an addi…
The Asymptotics of Difference Systems of Sets for Synchronization and Phase Detection
Yu Tsunoda, Yuichiro Fujiwara
We settle the problem of determining the asymptotic behavior of the parameters of optimal difference systems of sets, or DSSes for short, which were originally introduced for compu…
Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction
Yu Tsunoda, Yuichiro Fujiwara
Weak superimposed codes are combinatorial structures related closely to generalized cover-free families, superimposed codes, and disjunct matrices in that they are only required to…
On the Maximum Number of Codewords of X-Codes of Constant Weight Three
Yu Tsunoda, Yuichiro Fujiwara
X-codes form a special class of linear maps which were originally introduced for data compression in VLSI testing and are also known to give special parity-check matrices for linea…
Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes
Yu Tsunoda, Yuichiro Fujiwara, Hana Ando +1
An error-erasure channel is a simple noise model that introduces both errors and erasures. While the two types of errors can be corrected simultaneously with error-correcting codes…
Probabilistic bounds on the trapping redundancy of linear codes
Yu Tsunoda, Yuichiro Fujiwara
The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an -trapping set. This concept was first introd…