Generalized b-Symbol Weights of Linear Codes and b-Symbol MDS Codes

DOI10.1109/TIT.2022.3223729arXiv2103.16299OpenAlexW4312233383MaRDI QIDQ6153670FDOQ6153670

Authors: Hongwei Liu, Xu Pan 

Publication date: 19 March 2024

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information in the symbol-pair read wire-tap channels of type II. In this paper, we introduce the notion of generalized $b$-symbol weights of linear codes over finite fields, which is a generalization of generalized Hamming weights and generalized pair weights. We obtain some basic properties and bounds of generalized $b$-symbol weights which are called Singleton-like bounds for generalized $b$-symbol weights. As examples, we calculate generalized weight matrices for simplex codes and Hamming codes. We provide a necessary and sufficient condition for a linear code to be a $b$-symbol MDS code by using the generator matrix and the parity check matrix of this linear code. Finally, a necessary and sufficient condition of a linear isomorphism preserving $b$-symbol weights between two linear codes is obtained. As a corollary, we get the classical MacWilliams extension theorem when $b=1$.

Full work available at URL: https://arxiv.org/abs/2103.16299

zbMATH Keywords

MacWilliams extension theorem\(b\)-symbol MDS codesgeneralized \(b\)-symbol weightslinear isomorphisms preserving b-symbol weights

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

This page was built for publication: Generalized b-Symbol Weights of Linear Codes and b-Symbol MDS Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153670)