Abstract
The problem of finding so-called pirates via the minimum Hamming distance decoding is considered for the simplest case of two pirates. We prove that for all q ? 3 there exist "good" q-ary codes capable of finding at least one pirate by the minimum distance decoding in the Hamming metric.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
