2013/11/11 by Myong‐Son Sin, Myong-Son Sin, Sin, Myong-Son +2
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Rings and Algebras (math.RA) #cs.IT #graph theory and CDMA systems #math.IT #math.RA
paper · pdf · doi:10.48550/arxiv.1311.2346
10 pages
arxiv created 2013/11/11 · openalex publication_date 2013/11/11 · arxiv updated 2013/11/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A. Silverberg (IEEE Trans. Inform. Theory 49, 2003) proposed a question on the equivalence of identifiable parent property and traceability property for Reed-Solomon code family. Earlier studies on Silverberg's problem motivate us to think of the stronger version of the question on equivalence of separation and traceability properties. Both, however, still remain open. In this article, we integrate all the previous works on this problem with an algebraic way, and present some new results. It is notable that the concept of subspace subcode of Reed-Solomon code, which was introduced in error-correcting code theory, provides an interesting prospect for our topic.