2016/12/14 by Minjia, Shi, Liqin Qian, Patrick Solé +2
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1612.04515
openalex publication_date 2016/12/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, new few weights linear codes over the local ring R=\mathbbFp+u\mathbbFp+v\mathbbFp+uv\mathbbFp, with u2=v2=0, uv=vu, are constructed by using the trace function defined over an extension ring of degree m. %In fact, These codes are punctured from the linear code is defined in \citeSWLP up to coordinate permutations. These trace codes have the algebraic structure of abelian codes. Their weight distributions are evaluated explicitly by means of Gaussian sums over finite fields. Two different defining sets are explored. Using a linear Gray map from R to \mathbbFp4, we obtain several families of new p-ary codes from trace codes of dimension 4m. For the first defining set: when m is even, or m is odd and p≡3 ~(\rm mod ~4), we obtain a new family of two-weight codes, which are shown to be optimal by the application of the Griesmer bound; when m is even and under some special conditions, we obtain two new classes of three-weight codes. For the second defining set: we obtain a new class of two-weight codes and prove that it meets the Griesmer bound. In addition, we give the minimum distance of the dual code. Finally, applications of the p-ary image codes in secret sharing schemes are presented.