Skip to main content
Yuichiro Fujiwara's user avatar
Yuichiro Fujiwara's user avatar
Yuichiro Fujiwara's user avatar
Yuichiro Fujiwara
  • Member for 12 years, 1 month
  • Last seen more than a week ago
reviewed
Reject
awarded
reviewed
Approve
comment
"Codes" in which a group of words are pairwise different at a certain position
@HaoCHEN Thanks for the link! But I should have studied Chinese seriously at school... Google's translation is way better than me. Ugh!
comment
"Codes" in which a group of words are pairwise different at a certain position
@Hao By the way, do you mind editing this post by giving a link/reference to the construction/search? If it was done by exhaustive search, $13$ must be the upper bound you asked, too. If you don't feel like it, you can just a link or reference as a comment; I'll edit this post when I have the time.
comment
"Codes" in which a group of words are pairwise different at a certain position
@HaoCHEN You mean PHF$(6;13,3,3)$, right? Thant's nice! I checked your 13 columns, too. It looks like a valid one, well, unless my programming sucks too hard!
comment
"Codes" in which a group of words are pairwise different at a certain position
@HaoCHEN It is optimal in the sense that no PHF$(5;12,3,3)$ exists, i.e., you need at least $6$ rows to have $12$ columns with the all-distinct-symbol property. But I need to check the existing literature or prove it myself to see if it's optimal in your sense. I'm pretty sure it's the best among known PHF$(6;\vert C\vert,3,3)$, though. I'll edit my post if I find the answer to the optimality. Or you can prove it and improve this post, too!
Loading…
1
10 11
12
13 14
26