2013/08/02 by Rick Ma, Ma, Rick, Samuel Cheng +1
Computer Science · Engineering · Mathematics · #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #Wireless Signal Modulation Classification #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1308.0632
submitted to IEEE Trans Information Theory
arxiv created 2013/08/02 · openalex publication_date 2013/08/02 · arxiv updated 2013/08/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we use linear codes to study zero-error Slepian-Wolf coding of a set of sources with deviation symmetry, where the sources are generalization of the Hamming sources over an arbitrary field. We extend our previous codes, Generalized Hamming Codes for Multiple Sources, to Matrix Partition Codes and use the latter to efficiently compress the target sources. We further show that every perfect or linear-optimal code is a Matrix Partition Code. We also present some conditions when Matrix Partition Codes are perfect and/or linear-optimal. Detail discussions of Matrix Partition Codes on Hamming sources are given at last as examples.