Multi-Covering Radius for Rank Metric Codes
نویسندگان
چکیده
The results of this paper are concerned with the multi-covering radius, a generalization of covering radius, of Rank Distance (RD) codes. This leads to greater understanding of RD codes and their distance properties. Results on multi-covering radii of RD codes under various constructions are given by varying the parameters. Some bounds are established. A relationship between multi-covering radii of an RD code and that of its ambient space is also found. The classical sphere bound is generalized.
منابع مشابه
Covering Radius of Matrix Codes Endowed with the Rank Metric
In this paper we study properties and invariants of matrix codes endowed with the rank metric, and relate them to the covering radius. We introduce new tools for the analysis of rank-metric codes, such as puncturing and shortening constructions. We give upper bounds on the covering radius of a code by applying different combinatorial methods. The various bounds are then applied to the classes o...
متن کاملProperties of Codes with the Rank Metric
In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic forms of these two bounds and the Singleton bound. Based on the asymptotic bounds, we observe that asymptotically Gilbert-Varsharmov bound is exceeded by MRD co...
متن کاملInfinity-Norm Permutation Covering Codes from Cyclic Groups
We study covering codes of permutations with the l∞-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering radius, and showing linear-time algorithms for finding a covering codeword. We also bound the covering radius of relabeled cyclic transitive groups under conjugation. In...
متن کاملProperties of Rank Metric Codes
This paper investigates general properties of codes with the rank metric. First, we investigate asymptotic packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their parameters, and investigate their asymptotic covering properties. Finally, we establish several identities that relate the rank weight distribution of a linear co...
متن کاملOn the List-Decodability of Random Linear Rank-Metric Codes
The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an Fq-linear rank-metric code over F m×n q of rate R = (1 − ρ)(1 − n m ρ) − ε is shown to be (with high probability) list-decodable up to fractional radius ρ ∈ (0, 1) with lists of size at most Cρ,q ε , where Cρ,q is a constant depending only on ρ and q. This matches the bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009