Generalized Hamming Weights of Irreducible Cyclic Codes
نویسندگان
چکیده
منابع مشابه
Hamming weights in irreducible cyclic codes
The objectives of this paper are to survey and extend earlier results on the weight distributions of irreducible cyclic codes, present a divisibility theorem and develop bounds on the weights in irreducible cyclic codes. © 2012 Elsevier B.V. All rights reserved.
متن کامل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...
متن کاملOn The Weights of Irreducible Cyclic Codes
The paper is devoted to the study of the weight distribution of irreducible cyclic codes. We start from the interpretation due to McEliece of these weights by means of Gauss sums. Firstly, a p-adic analysis using Stickelberger congruences and Gross-Koblitz formula enable us to improve the divisibility theorem of McEliece by giving results on the multiplicity of the weights. Secondly, in connect...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2444013