Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes

نویسندگان

چکیده

Let $ \mathbb{F}_{q} be a finite field with q elements, where is power of prime p $. A polynomial over monomially squarefree if all its monomials are squarefree. In this paper, we determine an upper bound on the number common zeroes any set r linearly independent polynomials \mathbb{F}_{q}[t_{1}, t_{2}, \dots, t_{s}] in affine torus T = (\mathbb{F}_{q}^{*})^{s} under certain conditions $, s and degree these polynomials. Applying results, obtain generalized Hamming weights toric codes hypersimplices evaluation codes, as defined [14].

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relative generalized Hamming weights of cyclic codes

Abstract. Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and stor...

متن کامل

Generalized Hamming weights for linear codes

Error control codes are widely used to increase the reliability of transmission of information over various forms of communications channels. The Hamming weight of a codeword is the number of nonzero entries in the word; the weights of the words in a linear code determine the error-correcting capacity of the code. The rth generalized Hamming weight for a linear code C, denoted by dr(C), is the ...

متن کامل

Relative generalized Hamming weights of $q$-ary Reed-Muller codes

Coset constructions of q-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local error-correction. In this paper we determine the relative generalized Hamming weights of these codes which can be translated into a detailed description of the i...

متن کامل

On the generalized Hamming weights of convolutional codes

Motivated by applications in cryptology, Wei (1991) introduced the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to de...

متن کامل

Generalized Hamming Weights of Duals of Algebraic-geometric Codes

Here we extends a work of A. Couvreur on the Hamming distance of the dual of an evaluation code to its generalized Hamming weights. We prove the following result. Fix integers r ≥ 2, m > 0 and e ≥ 1. Let Z ⊂ P be a zero-dimensional scheme such that deg(Z) ≤ 3m + r − 3. If r > 2 assume that Z spans P and that the sum of the degrees of the non-reduced connected components of Z is at most 2m+ 1. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics of Communications

سال: 2023

ISSN: ['1930-5346', '1930-5338']

DOI: https://doi.org/10.3934/amc.2021013