On the Stabilizer of Weight Enumerators of Linear Codes
From MaRDI portal
Abstract: This paper investigates the relation between linear codes and the stabilizer in of their weight enumerators. We prove a result on the finiteness of stabilizers and give a complete classification of linear codes with infinite stabilizer in the non-binary case. We present an efficient algorithm to compute explicitly the stabilizer of weight enumerators and we apply it to the family of Reed-Muller codes to show that some of their weight enumerators have trivial stabilizer.
This page was built for publication: On the Stabilizer of Weight Enumerators of Linear Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6267052)
