Generalized Pair Weights of Linear Codes and Linear Isomorphisms Preserving Pair Weights

Abstract

In this paper, we introduce the notion of generalized pair weights of an <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$[n, k]$ </tex-math></inline-formula> -linear code over the finite field <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathbb {F}_{q}$ </tex-math></inline-formula> and the notion of pair <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$r$ </tex-math></inline-formula> -equiweight codes, where <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$1\le r\le k-1$ </tex-math></inline-formula> . Some basic properties of generalized pair weights of linear codes over finite fields are derived. We obtain a necessary and sufficient condition for an <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$[n,k]$ </tex-math></inline-formula> -linear code to be a pair equiweight code, and we characterize pair <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$r$ </tex-math></inline-formula> -equiweight codes for any <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$1\le r\le k-1$ </tex-math></inline-formula> . A necessary and sufficient condition for a linear isomorphism to preserve pair weights between two linear codes is obtained. At the end of this paper, an application of generalized pair weights of linear codes to symbol-pair read wire-tap channels of type II is introduced.