Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Zheng, Dabin"'
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in various applicat
Externí odkaz:
http://arxiv.org/abs/2405.19596
BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In the past sixty years, a lot of progress on the study of BCH codes has been made, but little is known about the properties of their duals. R
Externí odkaz:
http://arxiv.org/abs/2312.05474
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However, determining the gene
Externí odkaz:
http://arxiv.org/abs/2310.11873
Minimum storage regenerating (MSR) codes, with the MDS property and the optimal repair bandwidth, are widely used in distributed storage systems (DSS) for data recovery. In this paper, we consider the construction of $(n,k,l)$ MSR codes in the centra
Externí odkaz:
http://arxiv.org/abs/2309.15668
The high-density data storage technology aims to design high-capacity storage at a relatively low cost. In order to achieve this goal, symbol-pair codes were proposed by Cassuto and Blaum \cite{CB10,CB11} to handle channels that output pairs of overl
Externí odkaz:
http://arxiv.org/abs/2309.04068
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one of importan
Externí odkaz:
http://arxiv.org/abs/2212.03484
Insertion-deletion codes (insdel codes for short) are used for correcting synchronization errors in communications, and in other many interesting fields such as DNA storage, date analysis, race-track memory error correction and language processing, a
Externí odkaz:
http://arxiv.org/abs/2206.00287
Publikováno v:
In Finite Fields and Their Applications September 2024 98
The minimum storage rack-aware regenerating (MSRR) code is a variation of regenerating codes that achieves the optimal repair bandwidth for a single node failure in the rack-aware model. The authors in~\cite{Chen-Barg2019} and~\cite{Zhou-Zhang2021} p
Externí odkaz:
http://arxiv.org/abs/2109.08302
In this paper, two-to-one mappings and involutions without any fixed point on finite fields of even characteristic are investigated. First, we characterize a closed relationship between them by implicit functions and develop an AGW-like criterion for
Externí odkaz:
http://arxiv.org/abs/2105.11323